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.h>
36 #include <linux/interrupt.h>
37 #include <linux/sched.h>
38 #include <linux/nmi.h>
39 #include <linux/atomic.h>
40 #include <linux/bitops.h>
41 #include <linux/export.h>
42 #include <linux/completion.h>
43 #include <linux/moduleparam.h>
44 #include <linux/module.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 <linux/prefetch.h>
54 #include <linux/delay.h>
55 #include <linux/stop_machine.h>
56 #include <linux/random.h>
57 #include <linux/ftrace_event.h>
58 #include <linux/suspend.h>
63 MODULE_ALIAS("rcutree");
64 #ifdef MODULE_PARAM_PREFIX
65 #undef MODULE_PARAM_PREFIX
67 #define MODULE_PARAM_PREFIX "rcutree."
69 /* Data structures. */
71 static struct lock_class_key rcu_node_class[RCU_NUM_LVLS];
72 static struct lock_class_key rcu_fqs_class[RCU_NUM_LVLS];
75 * In order to export the rcu_state name to the tracing tools, it
76 * needs to be added in the __tracepoint_string section.
77 * This requires defining a separate variable tp_<sname>_varname
78 * that points to the string being used, and this will allow
79 * the tracing userspace tools to be able to decipher the string
80 * address to the matching string.
83 # define DEFINE_RCU_TPS(sname) \
84 static char sname##_varname[] = #sname; \
85 static const char *tp_##sname##_varname __used __tracepoint_string = sname##_varname;
86 # define RCU_STATE_NAME(sname) sname##_varname
88 # define DEFINE_RCU_TPS(sname)
89 # define RCU_STATE_NAME(sname) __stringify(sname)
92 #define RCU_STATE_INITIALIZER(sname, sabbr, cr) \
93 DEFINE_RCU_TPS(sname) \
94 struct rcu_state sname##_state = { \
95 .level = { &sname##_state.node[0] }, \
97 .fqs_state = RCU_GP_IDLE, \
98 .gpnum = 0UL - 300UL, \
99 .completed = 0UL - 300UL, \
100 .orphan_lock = __RAW_SPIN_LOCK_UNLOCKED(&sname##_state.orphan_lock), \
101 .orphan_nxttail = &sname##_state.orphan_nxtlist, \
102 .orphan_donetail = &sname##_state.orphan_donelist, \
103 .barrier_mutex = __MUTEX_INITIALIZER(sname##_state.barrier_mutex), \
104 .onoff_mutex = __MUTEX_INITIALIZER(sname##_state.onoff_mutex), \
105 .name = RCU_STATE_NAME(sname), \
108 DEFINE_PER_CPU_SHARED_ALIGNED(struct rcu_data, sname##_data)
110 RCU_STATE_INITIALIZER(rcu_sched, 's', call_rcu_sched);
111 RCU_STATE_INITIALIZER(rcu_bh, 'b', call_rcu_bh);
113 static struct rcu_state *rcu_state_p;
114 LIST_HEAD(rcu_struct_flavors);
116 /* Increase (but not decrease) the CONFIG_RCU_FANOUT_LEAF at boot time. */
117 static int rcu_fanout_leaf = CONFIG_RCU_FANOUT_LEAF;
118 module_param(rcu_fanout_leaf, int, 0444);
119 int rcu_num_lvls __read_mostly = RCU_NUM_LVLS;
120 static int num_rcu_lvl[] = { /* Number of rcu_nodes at specified level. */
127 int rcu_num_nodes __read_mostly = NUM_RCU_NODES; /* Total # rcu_nodes in use. */
130 * The rcu_scheduler_active variable transitions from zero to one just
131 * before the first task is spawned. So when this variable is zero, RCU
132 * can assume that there is but one task, allowing RCU to (for example)
133 * optimize synchronize_sched() to a simple barrier(). When this variable
134 * is one, RCU must actually do all the hard work required to detect real
135 * grace periods. This variable is also used to suppress boot-time false
136 * positives from lockdep-RCU error checking.
138 int rcu_scheduler_active __read_mostly;
139 EXPORT_SYMBOL_GPL(rcu_scheduler_active);
142 * The rcu_scheduler_fully_active variable transitions from zero to one
143 * during the early_initcall() processing, which is after the scheduler
144 * is capable of creating new tasks. So RCU processing (for example,
145 * creating tasks for RCU priority boosting) must be delayed until after
146 * rcu_scheduler_fully_active transitions from zero to one. We also
147 * currently delay invocation of any RCU callbacks until after this point.
149 * It might later prove better for people registering RCU callbacks during
150 * early boot to take responsibility for these callbacks, but one step at
153 static int rcu_scheduler_fully_active __read_mostly;
155 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu);
156 static void invoke_rcu_core(void);
157 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp);
160 * Track the rcutorture test sequence number and the update version
161 * number within a given test. The rcutorture_testseq is incremented
162 * on every rcutorture module load and unload, so has an odd value
163 * when a test is running. The rcutorture_vernum is set to zero
164 * when rcutorture starts and is incremented on each rcutorture update.
165 * These variables enable correlating rcutorture output with the
166 * RCU tracing information.
168 unsigned long rcutorture_testseq;
169 unsigned long rcutorture_vernum;
172 * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s
173 * permit this function to be invoked without holding the root rcu_node
174 * structure's ->lock, but of course results can be subject to change.
176 static int rcu_gp_in_progress(struct rcu_state *rsp)
178 return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum);
182 * Note a quiescent state. Because we do not need to know
183 * how many quiescent states passed, just if there was at least
184 * one since the start of the grace period, this just sets a flag.
185 * The caller must have disabled preemption.
187 void rcu_sched_qs(void)
189 if (!__this_cpu_read(rcu_sched_data.passed_quiesce)) {
190 trace_rcu_grace_period(TPS("rcu_sched"),
191 __this_cpu_read(rcu_sched_data.gpnum),
193 __this_cpu_write(rcu_sched_data.passed_quiesce, 1);
199 if (!__this_cpu_read(rcu_bh_data.passed_quiesce)) {
200 trace_rcu_grace_period(TPS("rcu_bh"),
201 __this_cpu_read(rcu_bh_data.gpnum),
203 __this_cpu_write(rcu_bh_data.passed_quiesce, 1);
207 static DEFINE_PER_CPU(int, rcu_sched_qs_mask);
209 static DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = {
210 .dynticks_nesting = DYNTICK_TASK_EXIT_IDLE,
211 .dynticks = ATOMIC_INIT(1),
212 #ifdef CONFIG_NO_HZ_FULL_SYSIDLE
213 .dynticks_idle_nesting = DYNTICK_TASK_NEST_VALUE,
214 .dynticks_idle = ATOMIC_INIT(1),
215 #endif /* #ifdef CONFIG_NO_HZ_FULL_SYSIDLE */
219 * Let the RCU core know that this CPU has gone through the scheduler,
220 * which is a quiescent state. This is called when the need for a
221 * quiescent state is urgent, so we burn an atomic operation and full
222 * memory barriers to let the RCU core know about it, regardless of what
223 * this CPU might (or might not) do in the near future.
225 * We inform the RCU core by emulating a zero-duration dyntick-idle
226 * period, which we in turn do by incrementing the ->dynticks counter
229 static void rcu_momentary_dyntick_idle(void)
232 struct rcu_data *rdp;
233 struct rcu_dynticks *rdtp;
235 struct rcu_state *rsp;
237 local_irq_save(flags);
240 * Yes, we can lose flag-setting operations. This is OK, because
241 * the flag will be set again after some delay.
243 resched_mask = raw_cpu_read(rcu_sched_qs_mask);
244 raw_cpu_write(rcu_sched_qs_mask, 0);
246 /* Find the flavor that needs a quiescent state. */
247 for_each_rcu_flavor(rsp) {
248 rdp = raw_cpu_ptr(rsp->rda);
249 if (!(resched_mask & rsp->flavor_mask))
251 smp_mb(); /* rcu_sched_qs_mask before cond_resched_completed. */
252 if (ACCESS_ONCE(rdp->mynode->completed) !=
253 ACCESS_ONCE(rdp->cond_resched_completed))
257 * Pretend to be momentarily idle for the quiescent state.
258 * This allows the grace-period kthread to record the
259 * quiescent state, with no need for this CPU to do anything
262 rdtp = this_cpu_ptr(&rcu_dynticks);
263 smp_mb__before_atomic(); /* Earlier stuff before QS. */
264 atomic_add(2, &rdtp->dynticks); /* QS. */
265 smp_mb__after_atomic(); /* Later stuff after QS. */
268 local_irq_restore(flags);
272 * Note a context switch. This is a quiescent state for RCU-sched,
273 * and requires special handling for preemptible RCU.
274 * The caller must have disabled preemption.
276 void rcu_note_context_switch(void)
278 trace_rcu_utilization(TPS("Start context switch"));
280 rcu_preempt_note_context_switch();
281 if (unlikely(raw_cpu_read(rcu_sched_qs_mask)))
282 rcu_momentary_dyntick_idle();
283 trace_rcu_utilization(TPS("End context switch"));
285 EXPORT_SYMBOL_GPL(rcu_note_context_switch);
287 static long blimit = 10; /* Maximum callbacks per rcu_do_batch. */
288 static long qhimark = 10000; /* If this many pending, ignore blimit. */
289 static long qlowmark = 100; /* Once only this many pending, use blimit. */
291 module_param(blimit, long, 0444);
292 module_param(qhimark, long, 0444);
293 module_param(qlowmark, long, 0444);
295 static ulong jiffies_till_first_fqs = ULONG_MAX;
296 static ulong jiffies_till_next_fqs = ULONG_MAX;
298 module_param(jiffies_till_first_fqs, ulong, 0644);
299 module_param(jiffies_till_next_fqs, ulong, 0644);
302 * How long the grace period must be before we start recruiting
303 * quiescent-state help from rcu_note_context_switch().
305 static ulong jiffies_till_sched_qs = HZ / 20;
306 module_param(jiffies_till_sched_qs, ulong, 0644);
308 static bool rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp,
309 struct rcu_data *rdp);
310 static void force_qs_rnp(struct rcu_state *rsp,
311 int (*f)(struct rcu_data *rsp, bool *isidle,
312 unsigned long *maxj),
313 bool *isidle, unsigned long *maxj);
314 static void force_quiescent_state(struct rcu_state *rsp);
315 static int rcu_pending(void);
318 * Return the number of RCU-sched batches processed thus far for debug & stats.
320 long rcu_batches_completed_sched(void)
322 return rcu_sched_state.completed;
324 EXPORT_SYMBOL_GPL(rcu_batches_completed_sched);
327 * Return the number of RCU BH batches processed thus far for debug & stats.
329 long rcu_batches_completed_bh(void)
331 return rcu_bh_state.completed;
333 EXPORT_SYMBOL_GPL(rcu_batches_completed_bh);
336 * Force a quiescent state.
338 void rcu_force_quiescent_state(void)
340 force_quiescent_state(rcu_state_p);
342 EXPORT_SYMBOL_GPL(rcu_force_quiescent_state);
345 * Force a quiescent state for RCU BH.
347 void rcu_bh_force_quiescent_state(void)
349 force_quiescent_state(&rcu_bh_state);
351 EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state);
354 * Show the state of the grace-period kthreads.
356 void show_rcu_gp_kthreads(void)
358 struct rcu_state *rsp;
360 for_each_rcu_flavor(rsp) {
361 pr_info("%s: wait state: %d ->state: %#lx\n",
362 rsp->name, rsp->gp_state, rsp->gp_kthread->state);
363 /* sched_show_task(rsp->gp_kthread); */
366 EXPORT_SYMBOL_GPL(show_rcu_gp_kthreads);
369 * Record the number of times rcutorture tests have been initiated and
370 * terminated. This information allows the debugfs tracing stats to be
371 * correlated to the rcutorture messages, even when the rcutorture module
372 * is being repeatedly loaded and unloaded. In other words, we cannot
373 * store this state in rcutorture itself.
375 void rcutorture_record_test_transition(void)
377 rcutorture_testseq++;
378 rcutorture_vernum = 0;
380 EXPORT_SYMBOL_GPL(rcutorture_record_test_transition);
383 * Send along grace-period-related data for rcutorture diagnostics.
385 void rcutorture_get_gp_data(enum rcutorture_type test_type, int *flags,
386 unsigned long *gpnum, unsigned long *completed)
388 struct rcu_state *rsp = NULL;
397 case RCU_SCHED_FLAVOR:
398 rsp = &rcu_sched_state;
404 *flags = ACCESS_ONCE(rsp->gp_flags);
405 *gpnum = ACCESS_ONCE(rsp->gpnum);
406 *completed = ACCESS_ONCE(rsp->completed);
413 EXPORT_SYMBOL_GPL(rcutorture_get_gp_data);
416 * Record the number of writer passes through the current rcutorture test.
417 * This is also used to correlate debugfs tracing stats with the rcutorture
420 void rcutorture_record_progress(unsigned long vernum)
424 EXPORT_SYMBOL_GPL(rcutorture_record_progress);
427 * Force a quiescent state for RCU-sched.
429 void rcu_sched_force_quiescent_state(void)
431 force_quiescent_state(&rcu_sched_state);
433 EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state);
436 * Does the CPU have callbacks ready to be invoked?
439 cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp)
441 return &rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL] &&
442 rdp->nxttail[RCU_DONE_TAIL] != NULL;
446 * Return the root node of the specified rcu_state structure.
448 static struct rcu_node *rcu_get_root(struct rcu_state *rsp)
450 return &rsp->node[0];
454 * Is there any need for future grace periods?
455 * Interrupts must be disabled. If the caller does not hold the root
456 * rnp_node structure's ->lock, the results are advisory only.
458 static int rcu_future_needs_gp(struct rcu_state *rsp)
460 struct rcu_node *rnp = rcu_get_root(rsp);
461 int idx = (ACCESS_ONCE(rnp->completed) + 1) & 0x1;
462 int *fp = &rnp->need_future_gp[idx];
464 return ACCESS_ONCE(*fp);
468 * Does the current CPU require a not-yet-started grace period?
469 * The caller must have disabled interrupts to prevent races with
470 * normal callback registry.
473 cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp)
477 if (rcu_gp_in_progress(rsp))
478 return 0; /* No, a grace period is already in progress. */
479 if (rcu_future_needs_gp(rsp))
480 return 1; /* Yes, a no-CBs CPU needs one. */
481 if (!rdp->nxttail[RCU_NEXT_TAIL])
482 return 0; /* No, this is a no-CBs (or offline) CPU. */
483 if (*rdp->nxttail[RCU_NEXT_READY_TAIL])
484 return 1; /* Yes, this CPU has newly registered callbacks. */
485 for (i = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++)
486 if (rdp->nxttail[i - 1] != rdp->nxttail[i] &&
487 ULONG_CMP_LT(ACCESS_ONCE(rsp->completed),
488 rdp->nxtcompleted[i]))
489 return 1; /* Yes, CBs for future grace period. */
490 return 0; /* No grace period needed. */
494 * rcu_eqs_enter_common - current CPU is moving towards extended quiescent state
496 * If the new value of the ->dynticks_nesting counter now is zero,
497 * we really have entered idle, and must do the appropriate accounting.
498 * The caller must have disabled interrupts.
500 static void rcu_eqs_enter_common(long long oldval, bool user)
502 struct rcu_state *rsp;
503 struct rcu_data *rdp;
504 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
506 trace_rcu_dyntick(TPS("Start"), oldval, rdtp->dynticks_nesting);
507 if (!user && !is_idle_task(current)) {
508 struct task_struct *idle __maybe_unused =
509 idle_task(smp_processor_id());
511 trace_rcu_dyntick(TPS("Error on entry: not idle task"), oldval, 0);
512 ftrace_dump(DUMP_ORIG);
513 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
514 current->pid, current->comm,
515 idle->pid, idle->comm); /* must be idle task! */
517 for_each_rcu_flavor(rsp) {
518 rdp = this_cpu_ptr(rsp->rda);
519 do_nocb_deferred_wakeup(rdp);
521 rcu_prepare_for_idle();
522 /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */
523 smp_mb__before_atomic(); /* See above. */
524 atomic_inc(&rdtp->dynticks);
525 smp_mb__after_atomic(); /* Force ordering with next sojourn. */
526 WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1);
527 rcu_dynticks_task_enter();
530 * It is illegal to enter an extended quiescent state while
531 * in an RCU read-side critical section.
533 rcu_lockdep_assert(!lock_is_held(&rcu_lock_map),
534 "Illegal idle entry in RCU read-side critical section.");
535 rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map),
536 "Illegal idle entry in RCU-bh read-side critical section.");
537 rcu_lockdep_assert(!lock_is_held(&rcu_sched_lock_map),
538 "Illegal idle entry in RCU-sched read-side critical section.");
542 * Enter an RCU extended quiescent state, which can be either the
543 * idle loop or adaptive-tickless usermode execution.
545 static void rcu_eqs_enter(bool user)
548 struct rcu_dynticks *rdtp;
550 rdtp = this_cpu_ptr(&rcu_dynticks);
551 oldval = rdtp->dynticks_nesting;
552 WARN_ON_ONCE((oldval & DYNTICK_TASK_NEST_MASK) == 0);
553 if ((oldval & DYNTICK_TASK_NEST_MASK) == DYNTICK_TASK_NEST_VALUE) {
554 rdtp->dynticks_nesting = 0;
555 rcu_eqs_enter_common(oldval, user);
557 rdtp->dynticks_nesting -= DYNTICK_TASK_NEST_VALUE;
562 * rcu_idle_enter - inform RCU that current CPU is entering idle
564 * Enter idle mode, in other words, -leave- the mode in which RCU
565 * read-side critical sections can occur. (Though RCU read-side
566 * critical sections can occur in irq handlers in idle, a possibility
567 * handled by irq_enter() and irq_exit().)
569 * We crowbar the ->dynticks_nesting field to zero to allow for
570 * the possibility of usermode upcalls having messed up our count
571 * of interrupt nesting level during the prior busy period.
573 void rcu_idle_enter(void)
577 local_irq_save(flags);
578 rcu_eqs_enter(false);
579 rcu_sysidle_enter(0);
580 local_irq_restore(flags);
582 EXPORT_SYMBOL_GPL(rcu_idle_enter);
584 #ifdef CONFIG_RCU_USER_QS
586 * rcu_user_enter - inform RCU that we are resuming userspace.
588 * Enter RCU idle mode right before resuming userspace. No use of RCU
589 * is permitted between this call and rcu_user_exit(). This way the
590 * CPU doesn't need to maintain the tick for RCU maintenance purposes
591 * when the CPU runs in userspace.
593 void rcu_user_enter(void)
597 #endif /* CONFIG_RCU_USER_QS */
600 * rcu_irq_exit - inform RCU that current CPU is exiting irq towards idle
602 * Exit from an interrupt handler, which might possibly result in entering
603 * idle mode, in other words, leaving the mode in which read-side critical
604 * sections can occur.
606 * This code assumes that the idle loop never does anything that might
607 * result in unbalanced calls to irq_enter() and irq_exit(). If your
608 * architecture violates this assumption, RCU will give you what you
609 * deserve, good and hard. But very infrequently and irreproducibly.
611 * Use things like work queues to work around this limitation.
613 * You have been warned.
615 void rcu_irq_exit(void)
619 struct rcu_dynticks *rdtp;
621 local_irq_save(flags);
622 rdtp = this_cpu_ptr(&rcu_dynticks);
623 oldval = rdtp->dynticks_nesting;
624 rdtp->dynticks_nesting--;
625 WARN_ON_ONCE(rdtp->dynticks_nesting < 0);
626 if (rdtp->dynticks_nesting)
627 trace_rcu_dyntick(TPS("--="), oldval, rdtp->dynticks_nesting);
629 rcu_eqs_enter_common(oldval, true);
630 rcu_sysidle_enter(1);
631 local_irq_restore(flags);
635 * rcu_eqs_exit_common - current CPU moving away from extended quiescent state
637 * If the new value of the ->dynticks_nesting counter was previously zero,
638 * we really have exited idle, and must do the appropriate accounting.
639 * The caller must have disabled interrupts.
641 static void rcu_eqs_exit_common(long long oldval, int user)
643 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
645 rcu_dynticks_task_exit();
646 smp_mb__before_atomic(); /* Force ordering w/previous sojourn. */
647 atomic_inc(&rdtp->dynticks);
648 /* CPUs seeing atomic_inc() must see later RCU read-side crit sects */
649 smp_mb__after_atomic(); /* See above. */
650 WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1));
651 rcu_cleanup_after_idle();
652 trace_rcu_dyntick(TPS("End"), oldval, rdtp->dynticks_nesting);
653 if (!user && !is_idle_task(current)) {
654 struct task_struct *idle __maybe_unused =
655 idle_task(smp_processor_id());
657 trace_rcu_dyntick(TPS("Error on exit: not idle task"),
658 oldval, rdtp->dynticks_nesting);
659 ftrace_dump(DUMP_ORIG);
660 WARN_ONCE(1, "Current pid: %d comm: %s / Idle pid: %d comm: %s",
661 current->pid, current->comm,
662 idle->pid, idle->comm); /* must be idle task! */
667 * Exit an RCU extended quiescent state, which can be either the
668 * idle loop or adaptive-tickless usermode execution.
670 static void rcu_eqs_exit(bool user)
672 struct rcu_dynticks *rdtp;
675 rdtp = this_cpu_ptr(&rcu_dynticks);
676 oldval = rdtp->dynticks_nesting;
677 WARN_ON_ONCE(oldval < 0);
678 if (oldval & DYNTICK_TASK_NEST_MASK) {
679 rdtp->dynticks_nesting += DYNTICK_TASK_NEST_VALUE;
681 rdtp->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE;
682 rcu_eqs_exit_common(oldval, user);
687 * rcu_idle_exit - inform RCU that current CPU is leaving idle
689 * Exit idle mode, in other words, -enter- the mode in which RCU
690 * read-side critical sections can occur.
692 * We crowbar the ->dynticks_nesting field to DYNTICK_TASK_NEST to
693 * allow for the possibility of usermode upcalls messing up our count
694 * of interrupt nesting level during the busy period that is just
697 void rcu_idle_exit(void)
701 local_irq_save(flags);
704 local_irq_restore(flags);
706 EXPORT_SYMBOL_GPL(rcu_idle_exit);
708 #ifdef CONFIG_RCU_USER_QS
710 * rcu_user_exit - inform RCU that we are exiting userspace.
712 * Exit RCU idle mode while entering the kernel because it can
713 * run a RCU read side critical section anytime.
715 void rcu_user_exit(void)
719 #endif /* CONFIG_RCU_USER_QS */
722 * rcu_irq_enter - inform RCU that current CPU is entering irq away from idle
724 * Enter an interrupt handler, which might possibly result in exiting
725 * idle mode, in other words, entering the mode in which read-side critical
726 * sections can occur.
728 * Note that the Linux kernel is fully capable of entering an interrupt
729 * handler that it never exits, for example when doing upcalls to
730 * user mode! This code assumes that the idle loop never does upcalls to
731 * user mode. If your architecture does do upcalls from the idle loop (or
732 * does anything else that results in unbalanced calls to the irq_enter()
733 * and irq_exit() functions), RCU will give you what you deserve, good
734 * and hard. But very infrequently and irreproducibly.
736 * Use things like work queues to work around this limitation.
738 * You have been warned.
740 void rcu_irq_enter(void)
743 struct rcu_dynticks *rdtp;
746 local_irq_save(flags);
747 rdtp = this_cpu_ptr(&rcu_dynticks);
748 oldval = rdtp->dynticks_nesting;
749 rdtp->dynticks_nesting++;
750 WARN_ON_ONCE(rdtp->dynticks_nesting == 0);
752 trace_rcu_dyntick(TPS("++="), oldval, rdtp->dynticks_nesting);
754 rcu_eqs_exit_common(oldval, true);
756 local_irq_restore(flags);
760 * rcu_nmi_enter - inform RCU of entry to NMI context
762 * If the CPU was idle from RCU's viewpoint, update rdtp->dynticks and
763 * rdtp->dynticks_nmi_nesting to let the RCU grace-period handling know
764 * that the CPU is active. This implementation permits nested NMIs, as
765 * long as the nesting level does not overflow an int. (You will probably
766 * run out of stack space first.)
768 void rcu_nmi_enter(void)
770 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
773 /* Complain about underflow. */
774 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting < 0);
777 * If idle from RCU viewpoint, atomically increment ->dynticks
778 * to mark non-idle and increment ->dynticks_nmi_nesting by one.
779 * Otherwise, increment ->dynticks_nmi_nesting by two. This means
780 * if ->dynticks_nmi_nesting is equal to one, we are guaranteed
781 * to be in the outermost NMI handler that interrupted an RCU-idle
782 * period (observation due to Andy Lutomirski).
784 if (!(atomic_read(&rdtp->dynticks) & 0x1)) {
785 smp_mb__before_atomic(); /* Force delay from prior write. */
786 atomic_inc(&rdtp->dynticks);
787 /* atomic_inc() before later RCU read-side crit sects */
788 smp_mb__after_atomic(); /* See above. */
789 WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1));
792 rdtp->dynticks_nmi_nesting += incby;
797 * rcu_nmi_exit - inform RCU of exit from NMI context
799 * If we are returning from the outermost NMI handler that interrupted an
800 * RCU-idle period, update rdtp->dynticks and rdtp->dynticks_nmi_nesting
801 * to let the RCU grace-period handling know that the CPU is back to
804 void rcu_nmi_exit(void)
806 struct rcu_dynticks *rdtp = this_cpu_ptr(&rcu_dynticks);
809 * Check for ->dynticks_nmi_nesting underflow and bad ->dynticks.
810 * (We are exiting an NMI handler, so RCU better be paying attention
813 WARN_ON_ONCE(rdtp->dynticks_nmi_nesting <= 0);
814 WARN_ON_ONCE(!(atomic_read(&rdtp->dynticks) & 0x1));
817 * If the nesting level is not 1, the CPU wasn't RCU-idle, so
818 * leave it in non-RCU-idle state.
820 if (rdtp->dynticks_nmi_nesting != 1) {
821 rdtp->dynticks_nmi_nesting -= 2;
825 /* This NMI interrupted an RCU-idle CPU, restore RCU-idleness. */
826 rdtp->dynticks_nmi_nesting = 0;
827 /* CPUs seeing atomic_inc() must see prior RCU read-side crit sects */
828 smp_mb__before_atomic(); /* See above. */
829 atomic_inc(&rdtp->dynticks);
830 smp_mb__after_atomic(); /* Force delay to next write. */
831 WARN_ON_ONCE(atomic_read(&rdtp->dynticks) & 0x1);
835 * __rcu_is_watching - are RCU read-side critical sections safe?
837 * Return true if RCU is watching the running CPU, which means that
838 * this CPU can safely enter RCU read-side critical sections. Unlike
839 * rcu_is_watching(), the caller of __rcu_is_watching() must have at
840 * least disabled preemption.
842 bool notrace __rcu_is_watching(void)
844 return atomic_read(this_cpu_ptr(&rcu_dynticks.dynticks)) & 0x1;
848 * rcu_is_watching - see if RCU thinks that the current CPU is idle
850 * If the current CPU is in its idle loop and is neither in an interrupt
851 * or NMI handler, return true.
853 bool notrace rcu_is_watching(void)
858 ret = __rcu_is_watching();
862 EXPORT_SYMBOL_GPL(rcu_is_watching);
864 #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU)
867 * Is the current CPU online? Disable preemption to avoid false positives
868 * that could otherwise happen due to the current CPU number being sampled,
869 * this task being preempted, its old CPU being taken offline, resuming
870 * on some other CPU, then determining that its old CPU is now offline.
871 * It is OK to use RCU on an offline processor during initial boot, hence
872 * the check for rcu_scheduler_fully_active. Note also that it is OK
873 * for a CPU coming online to use RCU for one jiffy prior to marking itself
874 * online in the cpu_online_mask. Similarly, it is OK for a CPU going
875 * offline to continue to use RCU for one jiffy after marking itself
876 * offline in the cpu_online_mask. This leniency is necessary given the
877 * non-atomic nature of the online and offline processing, for example,
878 * the fact that a CPU enters the scheduler after completing the CPU_DYING
881 * This is also why RCU internally marks CPUs online during the
882 * CPU_UP_PREPARE phase and offline during the CPU_DEAD phase.
884 * Disable checking if in an NMI handler because we cannot safely report
885 * errors from NMI handlers anyway.
887 bool rcu_lockdep_current_cpu_online(void)
889 struct rcu_data *rdp;
890 struct rcu_node *rnp;
896 rdp = this_cpu_ptr(&rcu_sched_data);
898 ret = (rdp->grpmask & rnp->qsmaskinit) ||
899 !rcu_scheduler_fully_active;
903 EXPORT_SYMBOL_GPL(rcu_lockdep_current_cpu_online);
905 #endif /* #if defined(CONFIG_PROVE_RCU) && defined(CONFIG_HOTPLUG_CPU) */
908 * rcu_is_cpu_rrupt_from_idle - see if idle or immediately interrupted from idle
910 * If the current CPU is idle or running at a first-level (not nested)
911 * interrupt from idle, return true. The caller must have at least
912 * disabled preemption.
914 static int rcu_is_cpu_rrupt_from_idle(void)
916 return __this_cpu_read(rcu_dynticks.dynticks_nesting) <= 1;
920 * Snapshot the specified CPU's dynticks counter so that we can later
921 * credit them with an implicit quiescent state. Return 1 if this CPU
922 * is in dynticks idle mode, which is an extended quiescent state.
924 static int dyntick_save_progress_counter(struct rcu_data *rdp,
925 bool *isidle, unsigned long *maxj)
927 rdp->dynticks_snap = atomic_add_return(0, &rdp->dynticks->dynticks);
928 rcu_sysidle_check_cpu(rdp, isidle, maxj);
929 if ((rdp->dynticks_snap & 0x1) == 0) {
930 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
938 * This function really isn't for public consumption, but RCU is special in
939 * that context switches can allow the state machine to make progress.
941 extern void resched_cpu(int cpu);
944 * Return true if the specified CPU has passed through a quiescent
945 * state by virtue of being in or having passed through an dynticks
946 * idle state since the last call to dyntick_save_progress_counter()
947 * for this same CPU, or by virtue of having been offline.
949 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp,
950 bool *isidle, unsigned long *maxj)
956 curr = (unsigned int)atomic_add_return(0, &rdp->dynticks->dynticks);
957 snap = (unsigned int)rdp->dynticks_snap;
960 * If the CPU passed through or entered a dynticks idle phase with
961 * no active irq/NMI handlers, then we can safely pretend that the CPU
962 * already acknowledged the request to pass through a quiescent
963 * state. Either way, that CPU cannot possibly be in an RCU
964 * read-side critical section that started before the beginning
965 * of the current RCU grace period.
967 if ((curr & 0x1) == 0 || UINT_CMP_GE(curr, snap + 2)) {
968 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("dti"));
974 * Check for the CPU being offline, but only if the grace period
975 * is old enough. We don't need to worry about the CPU changing
976 * state: If we see it offline even once, it has been through a
979 * The reason for insisting that the grace period be at least
980 * one jiffy old is that CPUs that are not quite online and that
981 * have just gone offline can still execute RCU read-side critical
984 if (ULONG_CMP_GE(rdp->rsp->gp_start + 2, jiffies))
985 return 0; /* Grace period is not old enough. */
987 if (cpu_is_offline(rdp->cpu)) {
988 trace_rcu_fqs(rdp->rsp->name, rdp->gpnum, rdp->cpu, TPS("ofl"));
994 * A CPU running for an extended time within the kernel can
995 * delay RCU grace periods. When the CPU is in NO_HZ_FULL mode,
996 * even context-switching back and forth between a pair of
997 * in-kernel CPU-bound tasks cannot advance grace periods.
998 * So if the grace period is old enough, make the CPU pay attention.
999 * Note that the unsynchronized assignments to the per-CPU
1000 * rcu_sched_qs_mask variable are safe. Yes, setting of
1001 * bits can be lost, but they will be set again on the next
1002 * force-quiescent-state pass. So lost bit sets do not result
1003 * in incorrect behavior, merely in a grace period lasting
1004 * a few jiffies longer than it might otherwise. Because
1005 * there are at most four threads involved, and because the
1006 * updates are only once every few jiffies, the probability of
1007 * lossage (and thus of slight grace-period extension) is
1010 * Note that if the jiffies_till_sched_qs boot/sysfs parameter
1011 * is set too high, we override with half of the RCU CPU stall
1014 rcrmp = &per_cpu(rcu_sched_qs_mask, rdp->cpu);
1015 if (ULONG_CMP_GE(jiffies,
1016 rdp->rsp->gp_start + jiffies_till_sched_qs) ||
1017 ULONG_CMP_GE(jiffies, rdp->rsp->jiffies_resched)) {
1018 if (!(ACCESS_ONCE(*rcrmp) & rdp->rsp->flavor_mask)) {
1019 ACCESS_ONCE(rdp->cond_resched_completed) =
1020 ACCESS_ONCE(rdp->mynode->completed);
1021 smp_mb(); /* ->cond_resched_completed before *rcrmp. */
1022 ACCESS_ONCE(*rcrmp) =
1023 ACCESS_ONCE(*rcrmp) + rdp->rsp->flavor_mask;
1024 resched_cpu(rdp->cpu); /* Force CPU into scheduler. */
1025 rdp->rsp->jiffies_resched += 5; /* Enable beating. */
1026 } else if (ULONG_CMP_GE(jiffies, rdp->rsp->jiffies_resched)) {
1027 /* Time to beat on that CPU again! */
1028 resched_cpu(rdp->cpu); /* Force CPU into scheduler. */
1029 rdp->rsp->jiffies_resched += 5; /* Re-enable beating. */
1036 static void record_gp_stall_check_time(struct rcu_state *rsp)
1038 unsigned long j = jiffies;
1042 smp_wmb(); /* Record start time before stall time. */
1043 j1 = rcu_jiffies_till_stall_check();
1044 ACCESS_ONCE(rsp->jiffies_stall) = j + j1;
1045 rsp->jiffies_resched = j + j1 / 2;
1049 * Dump stacks of all tasks running on stalled CPUs.
1051 static void rcu_dump_cpu_stacks(struct rcu_state *rsp)
1054 unsigned long flags;
1055 struct rcu_node *rnp;
1057 rcu_for_each_leaf_node(rsp, rnp) {
1058 raw_spin_lock_irqsave(&rnp->lock, flags);
1059 if (rnp->qsmask != 0) {
1060 for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++)
1061 if (rnp->qsmask & (1UL << cpu))
1062 dump_cpu_task(rnp->grplo + cpu);
1064 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1068 static void print_other_cpu_stall(struct rcu_state *rsp)
1072 unsigned long flags;
1074 struct rcu_node *rnp = rcu_get_root(rsp);
1077 /* Only let one CPU complain about others per time interval. */
1079 raw_spin_lock_irqsave(&rnp->lock, flags);
1080 delta = jiffies - ACCESS_ONCE(rsp->jiffies_stall);
1081 if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) {
1082 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1085 ACCESS_ONCE(rsp->jiffies_stall) = jiffies + 3 * rcu_jiffies_till_stall_check() + 3;
1086 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1089 * OK, time to rat on our buddy...
1090 * See Documentation/RCU/stallwarn.txt for info on how to debug
1091 * RCU CPU stall warnings.
1093 pr_err("INFO: %s detected stalls on CPUs/tasks:",
1095 print_cpu_stall_info_begin();
1096 rcu_for_each_leaf_node(rsp, rnp) {
1097 raw_spin_lock_irqsave(&rnp->lock, flags);
1098 ndetected += rcu_print_task_stall(rnp);
1099 if (rnp->qsmask != 0) {
1100 for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++)
1101 if (rnp->qsmask & (1UL << cpu)) {
1102 print_cpu_stall_info(rsp,
1107 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1111 * Now rat on any tasks that got kicked up to the root rcu_node
1112 * due to CPU offlining.
1114 rnp = rcu_get_root(rsp);
1115 raw_spin_lock_irqsave(&rnp->lock, flags);
1116 ndetected += rcu_print_task_stall(rnp);
1117 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1119 print_cpu_stall_info_end();
1120 for_each_possible_cpu(cpu)
1121 totqlen += per_cpu_ptr(rsp->rda, cpu)->qlen;
1122 pr_cont("(detected by %d, t=%ld jiffies, g=%ld, c=%ld, q=%lu)\n",
1123 smp_processor_id(), (long)(jiffies - rsp->gp_start),
1124 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1126 pr_err("INFO: Stall ended before state dump start\n");
1128 rcu_dump_cpu_stacks(rsp);
1130 /* Complain about tasks blocking the grace period. */
1132 rcu_print_detail_task_stall(rsp);
1134 force_quiescent_state(rsp); /* Kick them all. */
1137 static void print_cpu_stall(struct rcu_state *rsp)
1140 unsigned long flags;
1141 struct rcu_node *rnp = rcu_get_root(rsp);
1145 * OK, time to rat on ourselves...
1146 * See Documentation/RCU/stallwarn.txt for info on how to debug
1147 * RCU CPU stall warnings.
1149 pr_err("INFO: %s self-detected stall on CPU", rsp->name);
1150 print_cpu_stall_info_begin();
1151 print_cpu_stall_info(rsp, smp_processor_id());
1152 print_cpu_stall_info_end();
1153 for_each_possible_cpu(cpu)
1154 totqlen += per_cpu_ptr(rsp->rda, cpu)->qlen;
1155 pr_cont(" (t=%lu jiffies g=%ld c=%ld q=%lu)\n",
1156 jiffies - rsp->gp_start,
1157 (long)rsp->gpnum, (long)rsp->completed, totqlen);
1158 rcu_dump_cpu_stacks(rsp);
1160 raw_spin_lock_irqsave(&rnp->lock, flags);
1161 if (ULONG_CMP_GE(jiffies, ACCESS_ONCE(rsp->jiffies_stall)))
1162 ACCESS_ONCE(rsp->jiffies_stall) = jiffies +
1163 3 * rcu_jiffies_till_stall_check() + 3;
1164 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1167 * Attempt to revive the RCU machinery by forcing a context switch.
1169 * A context switch would normally allow the RCU state machine to make
1170 * progress and it could be we're stuck in kernel space without context
1171 * switches for an entirely unreasonable amount of time.
1173 resched_cpu(smp_processor_id());
1176 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
1178 unsigned long completed;
1179 unsigned long gpnum;
1183 struct rcu_node *rnp;
1185 if (rcu_cpu_stall_suppress || !rcu_gp_in_progress(rsp))
1190 * Lots of memory barriers to reject false positives.
1192 * The idea is to pick up rsp->gpnum, then rsp->jiffies_stall,
1193 * then rsp->gp_start, and finally rsp->completed. These values
1194 * are updated in the opposite order with memory barriers (or
1195 * equivalent) during grace-period initialization and cleanup.
1196 * Now, a false positive can occur if we get an new value of
1197 * rsp->gp_start and a old value of rsp->jiffies_stall. But given
1198 * the memory barriers, the only way that this can happen is if one
1199 * grace period ends and another starts between these two fetches.
1200 * Detect this by comparing rsp->completed with the previous fetch
1203 * Given this check, comparisons of jiffies, rsp->jiffies_stall,
1204 * and rsp->gp_start suffice to forestall false positives.
1206 gpnum = ACCESS_ONCE(rsp->gpnum);
1207 smp_rmb(); /* Pick up ->gpnum first... */
1208 js = ACCESS_ONCE(rsp->jiffies_stall);
1209 smp_rmb(); /* ...then ->jiffies_stall before the rest... */
1210 gps = ACCESS_ONCE(rsp->gp_start);
1211 smp_rmb(); /* ...and finally ->gp_start before ->completed. */
1212 completed = ACCESS_ONCE(rsp->completed);
1213 if (ULONG_CMP_GE(completed, gpnum) ||
1214 ULONG_CMP_LT(j, js) ||
1215 ULONG_CMP_GE(gps, js))
1216 return; /* No stall or GP completed since entering function. */
1218 if (rcu_gp_in_progress(rsp) &&
1219 (ACCESS_ONCE(rnp->qsmask) & rdp->grpmask)) {
1221 /* We haven't checked in, so go dump stack. */
1222 print_cpu_stall(rsp);
1224 } else if (rcu_gp_in_progress(rsp) &&
1225 ULONG_CMP_GE(j, js + RCU_STALL_RAT_DELAY)) {
1227 /* They had a few time units to dump stack, so complain. */
1228 print_other_cpu_stall(rsp);
1233 * rcu_cpu_stall_reset - prevent further stall warnings in current grace period
1235 * Set the stall-warning timeout way off into the future, thus preventing
1236 * any RCU CPU stall-warning messages from appearing in the current set of
1237 * RCU grace periods.
1239 * The caller must disable hard irqs.
1241 void rcu_cpu_stall_reset(void)
1243 struct rcu_state *rsp;
1245 for_each_rcu_flavor(rsp)
1246 ACCESS_ONCE(rsp->jiffies_stall) = jiffies + ULONG_MAX / 2;
1250 * Initialize the specified rcu_data structure's callback list to empty.
1252 static void init_callback_list(struct rcu_data *rdp)
1256 if (init_nocb_callback_list(rdp))
1258 rdp->nxtlist = NULL;
1259 for (i = 0; i < RCU_NEXT_SIZE; i++)
1260 rdp->nxttail[i] = &rdp->nxtlist;
1264 * Determine the value that ->completed will have at the end of the
1265 * next subsequent grace period. This is used to tag callbacks so that
1266 * a CPU can invoke callbacks in a timely fashion even if that CPU has
1267 * been dyntick-idle for an extended period with callbacks under the
1268 * influence of RCU_FAST_NO_HZ.
1270 * The caller must hold rnp->lock with interrupts disabled.
1272 static unsigned long rcu_cbs_completed(struct rcu_state *rsp,
1273 struct rcu_node *rnp)
1276 * If RCU is idle, we just wait for the next grace period.
1277 * But we can only be sure that RCU is idle if we are looking
1278 * at the root rcu_node structure -- otherwise, a new grace
1279 * period might have started, but just not yet gotten around
1280 * to initializing the current non-root rcu_node structure.
1282 if (rcu_get_root(rsp) == rnp && rnp->gpnum == rnp->completed)
1283 return rnp->completed + 1;
1286 * Otherwise, wait for a possible partial grace period and
1287 * then the subsequent full grace period.
1289 return rnp->completed + 2;
1293 * Trace-event helper function for rcu_start_future_gp() and
1294 * rcu_nocb_wait_gp().
1296 static void trace_rcu_future_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1297 unsigned long c, const char *s)
1299 trace_rcu_future_grace_period(rdp->rsp->name, rnp->gpnum,
1300 rnp->completed, c, rnp->level,
1301 rnp->grplo, rnp->grphi, s);
1305 * Start some future grace period, as needed to handle newly arrived
1306 * callbacks. The required future grace periods are recorded in each
1307 * rcu_node structure's ->need_future_gp field. Returns true if there
1308 * is reason to awaken the grace-period kthread.
1310 * The caller must hold the specified rcu_node structure's ->lock.
1312 static bool __maybe_unused
1313 rcu_start_future_gp(struct rcu_node *rnp, struct rcu_data *rdp,
1314 unsigned long *c_out)
1319 struct rcu_node *rnp_root = rcu_get_root(rdp->rsp);
1322 * Pick up grace-period number for new callbacks. If this
1323 * grace period is already marked as needed, return to the caller.
1325 c = rcu_cbs_completed(rdp->rsp, rnp);
1326 trace_rcu_future_gp(rnp, rdp, c, TPS("Startleaf"));
1327 if (rnp->need_future_gp[c & 0x1]) {
1328 trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartleaf"));
1333 * If either this rcu_node structure or the root rcu_node structure
1334 * believe that a grace period is in progress, then we must wait
1335 * for the one following, which is in "c". Because our request
1336 * will be noticed at the end of the current grace period, we don't
1337 * need to explicitly start one. We only do the lockless check
1338 * of rnp_root's fields if the current rcu_node structure thinks
1339 * there is no grace period in flight, and because we hold rnp->lock,
1340 * the only possible change is when rnp_root's two fields are
1341 * equal, in which case rnp_root->gpnum might be concurrently
1342 * incremented. But that is OK, as it will just result in our
1343 * doing some extra useless work.
1345 if (rnp->gpnum != rnp->completed ||
1346 ACCESS_ONCE(rnp_root->gpnum) != ACCESS_ONCE(rnp_root->completed)) {
1347 rnp->need_future_gp[c & 0x1]++;
1348 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleaf"));
1353 * There might be no grace period in progress. If we don't already
1354 * hold it, acquire the root rcu_node structure's lock in order to
1355 * start one (if needed).
1357 if (rnp != rnp_root) {
1358 raw_spin_lock(&rnp_root->lock);
1359 smp_mb__after_unlock_lock();
1363 * Get a new grace-period number. If there really is no grace
1364 * period in progress, it will be smaller than the one we obtained
1365 * earlier. Adjust callbacks as needed. Note that even no-CBs
1366 * CPUs have a ->nxtcompleted[] array, so no no-CBs checks needed.
1368 c = rcu_cbs_completed(rdp->rsp, rnp_root);
1369 for (i = RCU_DONE_TAIL; i < RCU_NEXT_TAIL; i++)
1370 if (ULONG_CMP_LT(c, rdp->nxtcompleted[i]))
1371 rdp->nxtcompleted[i] = c;
1374 * If the needed for the required grace period is already
1375 * recorded, trace and leave.
1377 if (rnp_root->need_future_gp[c & 0x1]) {
1378 trace_rcu_future_gp(rnp, rdp, c, TPS("Prestartedroot"));
1382 /* Record the need for the future grace period. */
1383 rnp_root->need_future_gp[c & 0x1]++;
1385 /* If a grace period is not already in progress, start one. */
1386 if (rnp_root->gpnum != rnp_root->completed) {
1387 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedleafroot"));
1389 trace_rcu_future_gp(rnp, rdp, c, TPS("Startedroot"));
1390 ret = rcu_start_gp_advanced(rdp->rsp, rnp_root, rdp);
1393 if (rnp != rnp_root)
1394 raw_spin_unlock(&rnp_root->lock);
1402 * Clean up any old requests for the just-ended grace period. Also return
1403 * whether any additional grace periods have been requested. Also invoke
1404 * rcu_nocb_gp_cleanup() in order to wake up any no-callbacks kthreads
1405 * waiting for this grace period to complete.
1407 static int rcu_future_gp_cleanup(struct rcu_state *rsp, struct rcu_node *rnp)
1409 int c = rnp->completed;
1411 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1413 rcu_nocb_gp_cleanup(rsp, rnp);
1414 rnp->need_future_gp[c & 0x1] = 0;
1415 needmore = rnp->need_future_gp[(c + 1) & 0x1];
1416 trace_rcu_future_gp(rnp, rdp, c,
1417 needmore ? TPS("CleanupMore") : TPS("Cleanup"));
1422 * Awaken the grace-period kthread for the specified flavor of RCU.
1423 * Don't do a self-awaken, and don't bother awakening when there is
1424 * nothing for the grace-period kthread to do (as in several CPUs
1425 * raced to awaken, and we lost), and finally don't try to awaken
1426 * a kthread that has not yet been created.
1428 static void rcu_gp_kthread_wake(struct rcu_state *rsp)
1430 if (current == rsp->gp_kthread ||
1431 !ACCESS_ONCE(rsp->gp_flags) ||
1434 wake_up(&rsp->gp_wq);
1438 * If there is room, assign a ->completed number to any callbacks on
1439 * this CPU that have not already been assigned. Also accelerate any
1440 * callbacks that were previously assigned a ->completed number that has
1441 * since proven to be too conservative, which can happen if callbacks get
1442 * assigned a ->completed number while RCU is idle, but with reference to
1443 * a non-root rcu_node structure. This function is idempotent, so it does
1444 * not hurt to call it repeatedly. Returns an flag saying that we should
1445 * awaken the RCU grace-period kthread.
1447 * The caller must hold rnp->lock with interrupts disabled.
1449 static bool rcu_accelerate_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1450 struct rcu_data *rdp)
1456 /* If the CPU has no callbacks, nothing to do. */
1457 if (!rdp->nxttail[RCU_NEXT_TAIL] || !*rdp->nxttail[RCU_DONE_TAIL])
1461 * Starting from the sublist containing the callbacks most
1462 * recently assigned a ->completed number and working down, find the
1463 * first sublist that is not assignable to an upcoming grace period.
1464 * Such a sublist has something in it (first two tests) and has
1465 * a ->completed number assigned that will complete sooner than
1466 * the ->completed number for newly arrived callbacks (last test).
1468 * The key point is that any later sublist can be assigned the
1469 * same ->completed number as the newly arrived callbacks, which
1470 * means that the callbacks in any of these later sublist can be
1471 * grouped into a single sublist, whether or not they have already
1472 * been assigned a ->completed number.
1474 c = rcu_cbs_completed(rsp, rnp);
1475 for (i = RCU_NEXT_TAIL - 1; i > RCU_DONE_TAIL; i--)
1476 if (rdp->nxttail[i] != rdp->nxttail[i - 1] &&
1477 !ULONG_CMP_GE(rdp->nxtcompleted[i], c))
1481 * If there are no sublist for unassigned callbacks, leave.
1482 * At the same time, advance "i" one sublist, so that "i" will
1483 * index into the sublist where all the remaining callbacks should
1486 if (++i >= RCU_NEXT_TAIL)
1490 * Assign all subsequent callbacks' ->completed number to the next
1491 * full grace period and group them all in the sublist initially
1494 for (; i <= RCU_NEXT_TAIL; i++) {
1495 rdp->nxttail[i] = rdp->nxttail[RCU_NEXT_TAIL];
1496 rdp->nxtcompleted[i] = c;
1498 /* Record any needed additional grace periods. */
1499 ret = rcu_start_future_gp(rnp, rdp, NULL);
1501 /* Trace depending on how much we were able to accelerate. */
1502 if (!*rdp->nxttail[RCU_WAIT_TAIL])
1503 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccWaitCB"));
1505 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("AccReadyCB"));
1510 * Move any callbacks whose grace period has completed to the
1511 * RCU_DONE_TAIL sublist, then compact the remaining sublists and
1512 * assign ->completed numbers to any callbacks in the RCU_NEXT_TAIL
1513 * sublist. This function is idempotent, so it does not hurt to
1514 * invoke it repeatedly. As long as it is not invoked -too- often...
1515 * Returns true if the RCU grace-period kthread needs to be awakened.
1517 * The caller must hold rnp->lock with interrupts disabled.
1519 static bool rcu_advance_cbs(struct rcu_state *rsp, struct rcu_node *rnp,
1520 struct rcu_data *rdp)
1524 /* If the CPU has no callbacks, nothing to do. */
1525 if (!rdp->nxttail[RCU_NEXT_TAIL] || !*rdp->nxttail[RCU_DONE_TAIL])
1529 * Find all callbacks whose ->completed numbers indicate that they
1530 * are ready to invoke, and put them into the RCU_DONE_TAIL sublist.
1532 for (i = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++) {
1533 if (ULONG_CMP_LT(rnp->completed, rdp->nxtcompleted[i]))
1535 rdp->nxttail[RCU_DONE_TAIL] = rdp->nxttail[i];
1537 /* Clean up any sublist tail pointers that were misordered above. */
1538 for (j = RCU_WAIT_TAIL; j < i; j++)
1539 rdp->nxttail[j] = rdp->nxttail[RCU_DONE_TAIL];
1541 /* Copy down callbacks to fill in empty sublists. */
1542 for (j = RCU_WAIT_TAIL; i < RCU_NEXT_TAIL; i++, j++) {
1543 if (rdp->nxttail[j] == rdp->nxttail[RCU_NEXT_TAIL])
1545 rdp->nxttail[j] = rdp->nxttail[i];
1546 rdp->nxtcompleted[j] = rdp->nxtcompleted[i];
1549 /* Classify any remaining callbacks. */
1550 return rcu_accelerate_cbs(rsp, rnp, rdp);
1554 * Update CPU-local rcu_data state to record the beginnings and ends of
1555 * grace periods. The caller must hold the ->lock of the leaf rcu_node
1556 * structure corresponding to the current CPU, and must have irqs disabled.
1557 * Returns true if the grace-period kthread needs to be awakened.
1559 static bool __note_gp_changes(struct rcu_state *rsp, struct rcu_node *rnp,
1560 struct rcu_data *rdp)
1564 /* Handle the ends of any preceding grace periods first. */
1565 if (rdp->completed == rnp->completed) {
1567 /* No grace period end, so just accelerate recent callbacks. */
1568 ret = rcu_accelerate_cbs(rsp, rnp, rdp);
1572 /* Advance callbacks. */
1573 ret = rcu_advance_cbs(rsp, rnp, rdp);
1575 /* Remember that we saw this grace-period completion. */
1576 rdp->completed = rnp->completed;
1577 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuend"));
1580 if (rdp->gpnum != rnp->gpnum) {
1582 * If the current grace period is waiting for this CPU,
1583 * set up to detect a quiescent state, otherwise don't
1584 * go looking for one.
1586 rdp->gpnum = rnp->gpnum;
1587 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpustart"));
1588 rdp->passed_quiesce = 0;
1589 rdp->qs_pending = !!(rnp->qsmask & rdp->grpmask);
1590 zero_cpu_stall_ticks(rdp);
1595 static void note_gp_changes(struct rcu_state *rsp, struct rcu_data *rdp)
1597 unsigned long flags;
1599 struct rcu_node *rnp;
1601 local_irq_save(flags);
1603 if ((rdp->gpnum == ACCESS_ONCE(rnp->gpnum) &&
1604 rdp->completed == ACCESS_ONCE(rnp->completed)) || /* w/out lock. */
1605 !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */
1606 local_irq_restore(flags);
1609 smp_mb__after_unlock_lock();
1610 needwake = __note_gp_changes(rsp, rnp, rdp);
1611 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1613 rcu_gp_kthread_wake(rsp);
1617 * Initialize a new grace period. Return 0 if no grace period required.
1619 static int rcu_gp_init(struct rcu_state *rsp)
1621 struct rcu_data *rdp;
1622 struct rcu_node *rnp = rcu_get_root(rsp);
1624 rcu_bind_gp_kthread();
1625 raw_spin_lock_irq(&rnp->lock);
1626 smp_mb__after_unlock_lock();
1627 if (!ACCESS_ONCE(rsp->gp_flags)) {
1628 /* Spurious wakeup, tell caller to go back to sleep. */
1629 raw_spin_unlock_irq(&rnp->lock);
1632 ACCESS_ONCE(rsp->gp_flags) = 0; /* Clear all flags: New grace period. */
1634 if (WARN_ON_ONCE(rcu_gp_in_progress(rsp))) {
1636 * Grace period already in progress, don't start another.
1637 * Not supposed to be able to happen.
1639 raw_spin_unlock_irq(&rnp->lock);
1643 /* Advance to a new grace period and initialize state. */
1644 record_gp_stall_check_time(rsp);
1645 /* Record GP times before starting GP, hence smp_store_release(). */
1646 smp_store_release(&rsp->gpnum, rsp->gpnum + 1);
1647 trace_rcu_grace_period(rsp->name, rsp->gpnum, TPS("start"));
1648 raw_spin_unlock_irq(&rnp->lock);
1650 /* Exclude any concurrent CPU-hotplug operations. */
1651 mutex_lock(&rsp->onoff_mutex);
1652 smp_mb__after_unlock_lock(); /* ->gpnum increment before GP! */
1655 * Set the quiescent-state-needed bits in all the rcu_node
1656 * structures for all currently online CPUs in breadth-first order,
1657 * starting from the root rcu_node structure, relying on the layout
1658 * of the tree within the rsp->node[] array. Note that other CPUs
1659 * will access only the leaves of the hierarchy, thus seeing that no
1660 * grace period is in progress, at least until the corresponding
1661 * leaf node has been initialized. In addition, we have excluded
1662 * CPU-hotplug operations.
1664 * The grace period cannot complete until the initialization
1665 * process finishes, because this kthread handles both.
1667 rcu_for_each_node_breadth_first(rsp, rnp) {
1668 raw_spin_lock_irq(&rnp->lock);
1669 smp_mb__after_unlock_lock();
1670 rdp = this_cpu_ptr(rsp->rda);
1671 rcu_preempt_check_blocked_tasks(rnp);
1672 rnp->qsmask = rnp->qsmaskinit;
1673 ACCESS_ONCE(rnp->gpnum) = rsp->gpnum;
1674 WARN_ON_ONCE(rnp->completed != rsp->completed);
1675 ACCESS_ONCE(rnp->completed) = rsp->completed;
1676 if (rnp == rdp->mynode)
1677 (void)__note_gp_changes(rsp, rnp, rdp);
1678 rcu_preempt_boost_start_gp(rnp);
1679 trace_rcu_grace_period_init(rsp->name, rnp->gpnum,
1680 rnp->level, rnp->grplo,
1681 rnp->grphi, rnp->qsmask);
1682 raw_spin_unlock_irq(&rnp->lock);
1683 cond_resched_rcu_qs();
1686 mutex_unlock(&rsp->onoff_mutex);
1691 * Do one round of quiescent-state forcing.
1693 static int rcu_gp_fqs(struct rcu_state *rsp, int fqs_state_in)
1695 int fqs_state = fqs_state_in;
1696 bool isidle = false;
1698 struct rcu_node *rnp = rcu_get_root(rsp);
1701 if (fqs_state == RCU_SAVE_DYNTICK) {
1702 /* Collect dyntick-idle snapshots. */
1703 if (is_sysidle_rcu_state(rsp)) {
1705 maxj = jiffies - ULONG_MAX / 4;
1707 force_qs_rnp(rsp, dyntick_save_progress_counter,
1709 rcu_sysidle_report_gp(rsp, isidle, maxj);
1710 fqs_state = RCU_FORCE_QS;
1712 /* Handle dyntick-idle and offline CPUs. */
1714 force_qs_rnp(rsp, rcu_implicit_dynticks_qs, &isidle, &maxj);
1716 /* Clear flag to prevent immediate re-entry. */
1717 if (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
1718 raw_spin_lock_irq(&rnp->lock);
1719 smp_mb__after_unlock_lock();
1720 ACCESS_ONCE(rsp->gp_flags) =
1721 ACCESS_ONCE(rsp->gp_flags) & ~RCU_GP_FLAG_FQS;
1722 raw_spin_unlock_irq(&rnp->lock);
1728 * Clean up after the old grace period.
1730 static void rcu_gp_cleanup(struct rcu_state *rsp)
1732 unsigned long gp_duration;
1733 bool needgp = false;
1735 struct rcu_data *rdp;
1736 struct rcu_node *rnp = rcu_get_root(rsp);
1738 raw_spin_lock_irq(&rnp->lock);
1739 smp_mb__after_unlock_lock();
1740 gp_duration = jiffies - rsp->gp_start;
1741 if (gp_duration > rsp->gp_max)
1742 rsp->gp_max = gp_duration;
1745 * We know the grace period is complete, but to everyone else
1746 * it appears to still be ongoing. But it is also the case
1747 * that to everyone else it looks like there is nothing that
1748 * they can do to advance the grace period. It is therefore
1749 * safe for us to drop the lock in order to mark the grace
1750 * period as completed in all of the rcu_node structures.
1752 raw_spin_unlock_irq(&rnp->lock);
1755 * Propagate new ->completed value to rcu_node structures so
1756 * that other CPUs don't have to wait until the start of the next
1757 * grace period to process their callbacks. This also avoids
1758 * some nasty RCU grace-period initialization races by forcing
1759 * the end of the current grace period to be completely recorded in
1760 * all of the rcu_node structures before the beginning of the next
1761 * grace period is recorded in any of the rcu_node structures.
1763 rcu_for_each_node_breadth_first(rsp, rnp) {
1764 raw_spin_lock_irq(&rnp->lock);
1765 smp_mb__after_unlock_lock();
1766 ACCESS_ONCE(rnp->completed) = rsp->gpnum;
1767 rdp = this_cpu_ptr(rsp->rda);
1768 if (rnp == rdp->mynode)
1769 needgp = __note_gp_changes(rsp, rnp, rdp) || needgp;
1770 /* smp_mb() provided by prior unlock-lock pair. */
1771 nocb += rcu_future_gp_cleanup(rsp, rnp);
1772 raw_spin_unlock_irq(&rnp->lock);
1773 cond_resched_rcu_qs();
1775 rnp = rcu_get_root(rsp);
1776 raw_spin_lock_irq(&rnp->lock);
1777 smp_mb__after_unlock_lock(); /* Order GP before ->completed update. */
1778 rcu_nocb_gp_set(rnp, nocb);
1780 /* Declare grace period done. */
1781 ACCESS_ONCE(rsp->completed) = rsp->gpnum;
1782 trace_rcu_grace_period(rsp->name, rsp->completed, TPS("end"));
1783 rsp->fqs_state = RCU_GP_IDLE;
1784 rdp = this_cpu_ptr(rsp->rda);
1785 /* Advance CBs to reduce false positives below. */
1786 needgp = rcu_advance_cbs(rsp, rnp, rdp) || needgp;
1787 if (needgp || cpu_needs_another_gp(rsp, rdp)) {
1788 ACCESS_ONCE(rsp->gp_flags) = RCU_GP_FLAG_INIT;
1789 trace_rcu_grace_period(rsp->name,
1790 ACCESS_ONCE(rsp->gpnum),
1793 raw_spin_unlock_irq(&rnp->lock);
1797 * Body of kthread that handles grace periods.
1799 static int __noreturn rcu_gp_kthread(void *arg)
1805 struct rcu_state *rsp = arg;
1806 struct rcu_node *rnp = rcu_get_root(rsp);
1810 /* Handle grace-period start. */
1812 trace_rcu_grace_period(rsp->name,
1813 ACCESS_ONCE(rsp->gpnum),
1815 rsp->gp_state = RCU_GP_WAIT_GPS;
1816 wait_event_interruptible(rsp->gp_wq,
1817 ACCESS_ONCE(rsp->gp_flags) &
1819 /* Locking provides needed memory barrier. */
1820 if (rcu_gp_init(rsp))
1822 cond_resched_rcu_qs();
1823 WARN_ON(signal_pending(current));
1824 trace_rcu_grace_period(rsp->name,
1825 ACCESS_ONCE(rsp->gpnum),
1829 /* Handle quiescent-state forcing. */
1830 fqs_state = RCU_SAVE_DYNTICK;
1831 j = jiffies_till_first_fqs;
1834 jiffies_till_first_fqs = HZ;
1839 rsp->jiffies_force_qs = jiffies + j;
1840 trace_rcu_grace_period(rsp->name,
1841 ACCESS_ONCE(rsp->gpnum),
1843 rsp->gp_state = RCU_GP_WAIT_FQS;
1844 ret = wait_event_interruptible_timeout(rsp->gp_wq,
1845 ((gf = ACCESS_ONCE(rsp->gp_flags)) &
1847 (!ACCESS_ONCE(rnp->qsmask) &&
1848 !rcu_preempt_blocked_readers_cgp(rnp)),
1850 /* Locking provides needed memory barriers. */
1851 /* If grace period done, leave loop. */
1852 if (!ACCESS_ONCE(rnp->qsmask) &&
1853 !rcu_preempt_blocked_readers_cgp(rnp))
1855 /* If time for quiescent-state forcing, do it. */
1856 if (ULONG_CMP_GE(jiffies, rsp->jiffies_force_qs) ||
1857 (gf & RCU_GP_FLAG_FQS)) {
1858 trace_rcu_grace_period(rsp->name,
1859 ACCESS_ONCE(rsp->gpnum),
1861 fqs_state = rcu_gp_fqs(rsp, fqs_state);
1862 trace_rcu_grace_period(rsp->name,
1863 ACCESS_ONCE(rsp->gpnum),
1865 cond_resched_rcu_qs();
1867 /* Deal with stray signal. */
1868 cond_resched_rcu_qs();
1869 WARN_ON(signal_pending(current));
1870 trace_rcu_grace_period(rsp->name,
1871 ACCESS_ONCE(rsp->gpnum),
1874 j = jiffies_till_next_fqs;
1877 jiffies_till_next_fqs = HZ;
1880 jiffies_till_next_fqs = 1;
1884 /* Handle grace-period end. */
1885 rcu_gp_cleanup(rsp);
1890 * Start a new RCU grace period if warranted, re-initializing the hierarchy
1891 * in preparation for detecting the next grace period. The caller must hold
1892 * the root node's ->lock and hard irqs must be disabled.
1894 * Note that it is legal for a dying CPU (which is marked as offline) to
1895 * invoke this function. This can happen when the dying CPU reports its
1898 * Returns true if the grace-period kthread must be awakened.
1901 rcu_start_gp_advanced(struct rcu_state *rsp, struct rcu_node *rnp,
1902 struct rcu_data *rdp)
1904 if (!rsp->gp_kthread || !cpu_needs_another_gp(rsp, rdp)) {
1906 * Either we have not yet spawned the grace-period
1907 * task, this CPU does not need another grace period,
1908 * or a grace period is already in progress.
1909 * Either way, don't start a new grace period.
1913 ACCESS_ONCE(rsp->gp_flags) = RCU_GP_FLAG_INIT;
1914 trace_rcu_grace_period(rsp->name, ACCESS_ONCE(rsp->gpnum),
1918 * We can't do wakeups while holding the rnp->lock, as that
1919 * could cause possible deadlocks with the rq->lock. Defer
1920 * the wakeup to our caller.
1926 * Similar to rcu_start_gp_advanced(), but also advance the calling CPU's
1927 * callbacks. Note that rcu_start_gp_advanced() cannot do this because it
1928 * is invoked indirectly from rcu_advance_cbs(), which would result in
1929 * endless recursion -- or would do so if it wasn't for the self-deadlock
1930 * that is encountered beforehand.
1932 * Returns true if the grace-period kthread needs to be awakened.
1934 static bool rcu_start_gp(struct rcu_state *rsp)
1936 struct rcu_data *rdp = this_cpu_ptr(rsp->rda);
1937 struct rcu_node *rnp = rcu_get_root(rsp);
1941 * If there is no grace period in progress right now, any
1942 * callbacks we have up to this point will be satisfied by the
1943 * next grace period. Also, advancing the callbacks reduces the
1944 * probability of false positives from cpu_needs_another_gp()
1945 * resulting in pointless grace periods. So, advance callbacks
1946 * then start the grace period!
1948 ret = rcu_advance_cbs(rsp, rnp, rdp) || ret;
1949 ret = rcu_start_gp_advanced(rsp, rnp, rdp) || ret;
1954 * Report a full set of quiescent states to the specified rcu_state
1955 * data structure. This involves cleaning up after the prior grace
1956 * period and letting rcu_start_gp() start up the next grace period
1957 * if one is needed. Note that the caller must hold rnp->lock, which
1958 * is released before return.
1960 static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags)
1961 __releases(rcu_get_root(rsp)->lock)
1963 WARN_ON_ONCE(!rcu_gp_in_progress(rsp));
1964 raw_spin_unlock_irqrestore(&rcu_get_root(rsp)->lock, flags);
1965 rcu_gp_kthread_wake(rsp);
1969 * Similar to rcu_report_qs_rdp(), for which it is a helper function.
1970 * Allows quiescent states for a group of CPUs to be reported at one go
1971 * to the specified rcu_node structure, though all the CPUs in the group
1972 * must be represented by the same rcu_node structure (which need not be
1973 * a leaf rcu_node structure, though it often will be). That structure's
1974 * lock must be held upon entry, and it is released before return.
1977 rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp,
1978 struct rcu_node *rnp, unsigned long flags)
1979 __releases(rnp->lock)
1981 struct rcu_node *rnp_c;
1983 /* Walk up the rcu_node hierarchy. */
1985 if (!(rnp->qsmask & mask)) {
1987 /* Our bit has already been cleared, so done. */
1988 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1991 rnp->qsmask &= ~mask;
1992 trace_rcu_quiescent_state_report(rsp->name, rnp->gpnum,
1993 mask, rnp->qsmask, rnp->level,
1994 rnp->grplo, rnp->grphi,
1996 if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
1998 /* Other bits still set at this level, so done. */
1999 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2002 mask = rnp->grpmask;
2003 if (rnp->parent == NULL) {
2005 /* No more levels. Exit loop holding root lock. */
2009 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2012 raw_spin_lock_irqsave(&rnp->lock, flags);
2013 smp_mb__after_unlock_lock();
2014 WARN_ON_ONCE(rnp_c->qsmask);
2018 * Get here if we are the last CPU to pass through a quiescent
2019 * state for this grace period. Invoke rcu_report_qs_rsp()
2020 * to clean up and start the next grace period if one is needed.
2022 rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */
2026 * Record a quiescent state for the specified CPU to that CPU's rcu_data
2027 * structure. This must be either called from the specified CPU, or
2028 * called when the specified CPU is known to be offline (and when it is
2029 * also known that no other CPU is concurrently trying to help the offline
2030 * CPU). The lastcomp argument is used to make sure we are still in the
2031 * grace period of interest. We don't want to end the current grace period
2032 * based on quiescent states detected in an earlier grace period!
2035 rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp)
2037 unsigned long flags;
2040 struct rcu_node *rnp;
2043 raw_spin_lock_irqsave(&rnp->lock, flags);
2044 smp_mb__after_unlock_lock();
2045 if (rdp->passed_quiesce == 0 || rdp->gpnum != rnp->gpnum ||
2046 rnp->completed == rnp->gpnum) {
2049 * The grace period in which this quiescent state was
2050 * recorded has ended, so don't report it upwards.
2051 * We will instead need a new quiescent state that lies
2052 * within the current grace period.
2054 rdp->passed_quiesce = 0; /* need qs for new gp. */
2055 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2058 mask = rdp->grpmask;
2059 if ((rnp->qsmask & mask) == 0) {
2060 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2062 rdp->qs_pending = 0;
2065 * This GP can't end until cpu checks in, so all of our
2066 * callbacks can be processed during the next GP.
2068 needwake = rcu_accelerate_cbs(rsp, rnp, rdp);
2070 rcu_report_qs_rnp(mask, rsp, rnp, flags); /* rlses rnp->lock */
2072 rcu_gp_kthread_wake(rsp);
2077 * Check to see if there is a new grace period of which this CPU
2078 * is not yet aware, and if so, set up local rcu_data state for it.
2079 * Otherwise, see if this CPU has just passed through its first
2080 * quiescent state for this grace period, and record that fact if so.
2083 rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp)
2085 /* Check for grace-period ends and beginnings. */
2086 note_gp_changes(rsp, rdp);
2089 * Does this CPU still need to do its part for current grace period?
2090 * If no, return and let the other CPUs do their part as well.
2092 if (!rdp->qs_pending)
2096 * Was there a quiescent state since the beginning of the grace
2097 * period? If no, then exit and wait for the next call.
2099 if (!rdp->passed_quiesce)
2103 * Tell RCU we are done (but rcu_report_qs_rdp() will be the
2106 rcu_report_qs_rdp(rdp->cpu, rsp, rdp);
2109 #ifdef CONFIG_HOTPLUG_CPU
2112 * Send the specified CPU's RCU callbacks to the orphanage. The
2113 * specified CPU must be offline, and the caller must hold the
2117 rcu_send_cbs_to_orphanage(int cpu, struct rcu_state *rsp,
2118 struct rcu_node *rnp, struct rcu_data *rdp)
2120 /* No-CBs CPUs do not have orphanable callbacks. */
2121 if (rcu_is_nocb_cpu(rdp->cpu))
2125 * Orphan the callbacks. First adjust the counts. This is safe
2126 * because _rcu_barrier() excludes CPU-hotplug operations, so it
2127 * cannot be running now. Thus no memory barrier is required.
2129 if (rdp->nxtlist != NULL) {
2130 rsp->qlen_lazy += rdp->qlen_lazy;
2131 rsp->qlen += rdp->qlen;
2132 rdp->n_cbs_orphaned += rdp->qlen;
2134 ACCESS_ONCE(rdp->qlen) = 0;
2138 * Next, move those callbacks still needing a grace period to
2139 * the orphanage, where some other CPU will pick them up.
2140 * Some of the callbacks might have gone partway through a grace
2141 * period, but that is too bad. They get to start over because we
2142 * cannot assume that grace periods are synchronized across CPUs.
2143 * We don't bother updating the ->nxttail[] array yet, instead
2144 * we just reset the whole thing later on.
2146 if (*rdp->nxttail[RCU_DONE_TAIL] != NULL) {
2147 *rsp->orphan_nxttail = *rdp->nxttail[RCU_DONE_TAIL];
2148 rsp->orphan_nxttail = rdp->nxttail[RCU_NEXT_TAIL];
2149 *rdp->nxttail[RCU_DONE_TAIL] = NULL;
2153 * Then move the ready-to-invoke callbacks to the orphanage,
2154 * where some other CPU will pick them up. These will not be
2155 * required to pass though another grace period: They are done.
2157 if (rdp->nxtlist != NULL) {
2158 *rsp->orphan_donetail = rdp->nxtlist;
2159 rsp->orphan_donetail = rdp->nxttail[RCU_DONE_TAIL];
2162 /* Finally, initialize the rcu_data structure's list to empty. */
2163 init_callback_list(rdp);
2167 * Adopt the RCU callbacks from the specified rcu_state structure's
2168 * orphanage. The caller must hold the ->orphan_lock.
2170 static void rcu_adopt_orphan_cbs(struct rcu_state *rsp, unsigned long flags)
2173 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
2175 /* No-CBs CPUs are handled specially. */
2176 if (rcu_nocb_adopt_orphan_cbs(rsp, rdp, flags))
2179 /* Do the accounting first. */
2180 rdp->qlen_lazy += rsp->qlen_lazy;
2181 rdp->qlen += rsp->qlen;
2182 rdp->n_cbs_adopted += rsp->qlen;
2183 if (rsp->qlen_lazy != rsp->qlen)
2184 rcu_idle_count_callbacks_posted();
2189 * We do not need a memory barrier here because the only way we
2190 * can get here if there is an rcu_barrier() in flight is if
2191 * we are the task doing the rcu_barrier().
2194 /* First adopt the ready-to-invoke callbacks. */
2195 if (rsp->orphan_donelist != NULL) {
2196 *rsp->orphan_donetail = *rdp->nxttail[RCU_DONE_TAIL];
2197 *rdp->nxttail[RCU_DONE_TAIL] = rsp->orphan_donelist;
2198 for (i = RCU_NEXT_SIZE - 1; i >= RCU_DONE_TAIL; i--)
2199 if (rdp->nxttail[i] == rdp->nxttail[RCU_DONE_TAIL])
2200 rdp->nxttail[i] = rsp->orphan_donetail;
2201 rsp->orphan_donelist = NULL;
2202 rsp->orphan_donetail = &rsp->orphan_donelist;
2205 /* And then adopt the callbacks that still need a grace period. */
2206 if (rsp->orphan_nxtlist != NULL) {
2207 *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_nxtlist;
2208 rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_nxttail;
2209 rsp->orphan_nxtlist = NULL;
2210 rsp->orphan_nxttail = &rsp->orphan_nxtlist;
2215 * Trace the fact that this CPU is going offline.
2217 static void rcu_cleanup_dying_cpu(struct rcu_state *rsp)
2219 RCU_TRACE(unsigned long mask);
2220 RCU_TRACE(struct rcu_data *rdp = this_cpu_ptr(rsp->rda));
2221 RCU_TRACE(struct rcu_node *rnp = rdp->mynode);
2223 RCU_TRACE(mask = rdp->grpmask);
2224 trace_rcu_grace_period(rsp->name,
2225 rnp->gpnum + 1 - !!(rnp->qsmask & mask),
2230 * The CPU has been completely removed, and some other CPU is reporting
2231 * this fact from process context. Do the remainder of the cleanup,
2232 * including orphaning the outgoing CPU's RCU callbacks, and also
2233 * adopting them. There can only be one CPU hotplug operation at a time,
2234 * so no other CPU can be attempting to update rcu_cpu_kthread_task.
2236 static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp)
2238 unsigned long flags;
2240 int need_report = 0;
2241 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
2242 struct rcu_node *rnp = rdp->mynode; /* Outgoing CPU's rdp & rnp. */
2244 /* Adjust any no-longer-needed kthreads. */
2245 rcu_boost_kthread_setaffinity(rnp, -1);
2247 /* Exclude any attempts to start a new grace period. */
2248 mutex_lock(&rsp->onoff_mutex);
2249 raw_spin_lock_irqsave(&rsp->orphan_lock, flags);
2251 /* Orphan the dead CPU's callbacks, and adopt them if appropriate. */
2252 rcu_send_cbs_to_orphanage(cpu, rsp, rnp, rdp);
2253 rcu_adopt_orphan_cbs(rsp, flags);
2255 /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */
2256 mask = rdp->grpmask; /* rnp->grplo is constant. */
2258 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
2259 smp_mb__after_unlock_lock();
2260 rnp->qsmaskinit &= ~mask;
2261 if (rnp->qsmaskinit != 0) {
2262 if (rnp != rdp->mynode)
2263 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
2266 if (rnp == rdp->mynode)
2267 need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp);
2269 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
2270 mask = rnp->grpmask;
2272 } while (rnp != NULL);
2275 * We still hold the leaf rcu_node structure lock here, and
2276 * irqs are still disabled. The reason for this subterfuge is
2277 * because invoking rcu_report_unblock_qs_rnp() with ->orphan_lock
2278 * held leads to deadlock.
2280 raw_spin_unlock(&rsp->orphan_lock); /* irqs remain disabled. */
2282 if (need_report & RCU_OFL_TASKS_NORM_GP)
2283 rcu_report_unblock_qs_rnp(rnp, flags);
2285 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2286 if (need_report & RCU_OFL_TASKS_EXP_GP)
2287 rcu_report_exp_rnp(rsp, rnp, true);
2288 WARN_ONCE(rdp->qlen != 0 || rdp->nxtlist != NULL,
2289 "rcu_cleanup_dead_cpu: Callbacks on offline CPU %d: qlen=%lu, nxtlist=%p\n",
2290 cpu, rdp->qlen, rdp->nxtlist);
2291 init_callback_list(rdp);
2292 /* Disallow further callbacks on this CPU. */
2293 rdp->nxttail[RCU_NEXT_TAIL] = NULL;
2294 mutex_unlock(&rsp->onoff_mutex);
2297 #else /* #ifdef CONFIG_HOTPLUG_CPU */
2299 static void rcu_cleanup_dying_cpu(struct rcu_state *rsp)
2303 static void rcu_cleanup_dead_cpu(int cpu, struct rcu_state *rsp)
2307 #endif /* #else #ifdef CONFIG_HOTPLUG_CPU */
2310 * Invoke any RCU callbacks that have made it to the end of their grace
2311 * period. Thottle as specified by rdp->blimit.
2313 static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
2315 unsigned long flags;
2316 struct rcu_head *next, *list, **tail;
2317 long bl, count, count_lazy;
2320 /* If no callbacks are ready, just return. */
2321 if (!cpu_has_callbacks_ready_to_invoke(rdp)) {
2322 trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, 0);
2323 trace_rcu_batch_end(rsp->name, 0, !!ACCESS_ONCE(rdp->nxtlist),
2324 need_resched(), is_idle_task(current),
2325 rcu_is_callbacks_kthread());
2330 * Extract the list of ready callbacks, disabling to prevent
2331 * races with call_rcu() from interrupt handlers.
2333 local_irq_save(flags);
2334 WARN_ON_ONCE(cpu_is_offline(smp_processor_id()));
2336 trace_rcu_batch_start(rsp->name, rdp->qlen_lazy, rdp->qlen, bl);
2337 list = rdp->nxtlist;
2338 rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL];
2339 *rdp->nxttail[RCU_DONE_TAIL] = NULL;
2340 tail = rdp->nxttail[RCU_DONE_TAIL];
2341 for (i = RCU_NEXT_SIZE - 1; i >= 0; i--)
2342 if (rdp->nxttail[i] == rdp->nxttail[RCU_DONE_TAIL])
2343 rdp->nxttail[i] = &rdp->nxtlist;
2344 local_irq_restore(flags);
2346 /* Invoke callbacks. */
2347 count = count_lazy = 0;
2351 debug_rcu_head_unqueue(list);
2352 if (__rcu_reclaim(rsp->name, list))
2355 /* Stop only if limit reached and CPU has something to do. */
2356 if (++count >= bl &&
2358 (!is_idle_task(current) && !rcu_is_callbacks_kthread())))
2362 local_irq_save(flags);
2363 trace_rcu_batch_end(rsp->name, count, !!list, need_resched(),
2364 is_idle_task(current),
2365 rcu_is_callbacks_kthread());
2367 /* Update count, and requeue any remaining callbacks. */
2369 *tail = rdp->nxtlist;
2370 rdp->nxtlist = list;
2371 for (i = 0; i < RCU_NEXT_SIZE; i++)
2372 if (&rdp->nxtlist == rdp->nxttail[i])
2373 rdp->nxttail[i] = tail;
2377 smp_mb(); /* List handling before counting for rcu_barrier(). */
2378 rdp->qlen_lazy -= count_lazy;
2379 ACCESS_ONCE(rdp->qlen) = rdp->qlen - count;
2380 rdp->n_cbs_invoked += count;
2382 /* Reinstate batch limit if we have worked down the excess. */
2383 if (rdp->blimit == LONG_MAX && rdp->qlen <= qlowmark)
2384 rdp->blimit = blimit;
2386 /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */
2387 if (rdp->qlen == 0 && rdp->qlen_last_fqs_check != 0) {
2388 rdp->qlen_last_fqs_check = 0;
2389 rdp->n_force_qs_snap = rsp->n_force_qs;
2390 } else if (rdp->qlen < rdp->qlen_last_fqs_check - qhimark)
2391 rdp->qlen_last_fqs_check = rdp->qlen;
2392 WARN_ON_ONCE((rdp->nxtlist == NULL) != (rdp->qlen == 0));
2394 local_irq_restore(flags);
2396 /* Re-invoke RCU core processing if there are callbacks remaining. */
2397 if (cpu_has_callbacks_ready_to_invoke(rdp))
2402 * Check to see if this CPU is in a non-context-switch quiescent state
2403 * (user mode or idle loop for rcu, non-softirq execution for rcu_bh).
2404 * Also schedule RCU core processing.
2406 * This function must be called from hardirq context. It is normally
2407 * invoked from the scheduling-clock interrupt. If rcu_pending returns
2408 * false, there is no point in invoking rcu_check_callbacks().
2410 void rcu_check_callbacks(int user)
2412 trace_rcu_utilization(TPS("Start scheduler-tick"));
2413 increment_cpu_stall_ticks();
2414 if (user || rcu_is_cpu_rrupt_from_idle()) {
2417 * Get here if this CPU took its interrupt from user
2418 * mode or from the idle loop, and if this is not a
2419 * nested interrupt. In this case, the CPU is in
2420 * a quiescent state, so note it.
2422 * No memory barrier is required here because both
2423 * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local
2424 * variables that other CPUs neither access nor modify,
2425 * at least not while the corresponding CPU is online.
2431 } else if (!in_softirq()) {
2434 * Get here if this CPU did not take its interrupt from
2435 * softirq, in other words, if it is not interrupting
2436 * a rcu_bh read-side critical section. This is an _bh
2437 * critical section, so note it.
2442 rcu_preempt_check_callbacks();
2446 rcu_note_voluntary_context_switch(current);
2447 trace_rcu_utilization(TPS("End scheduler-tick"));
2451 * Scan the leaf rcu_node structures, processing dyntick state for any that
2452 * have not yet encountered a quiescent state, using the function specified.
2453 * Also initiate boosting for any threads blocked on the root rcu_node.
2455 * The caller must have suppressed start of new grace periods.
2457 static void force_qs_rnp(struct rcu_state *rsp,
2458 int (*f)(struct rcu_data *rsp, bool *isidle,
2459 unsigned long *maxj),
2460 bool *isidle, unsigned long *maxj)
2464 unsigned long flags;
2466 struct rcu_node *rnp;
2468 rcu_for_each_leaf_node(rsp, rnp) {
2469 cond_resched_rcu_qs();
2471 raw_spin_lock_irqsave(&rnp->lock, flags);
2472 smp_mb__after_unlock_lock();
2473 if (!rcu_gp_in_progress(rsp)) {
2474 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2477 if (rnp->qsmask == 0) {
2478 rcu_initiate_boost(rnp, flags); /* releases rnp->lock */
2483 for (; cpu <= rnp->grphi; cpu++, bit <<= 1) {
2484 if ((rnp->qsmask & bit) != 0) {
2485 if ((rnp->qsmaskinit & bit) != 0)
2487 if (f(per_cpu_ptr(rsp->rda, cpu), isidle, maxj))
2493 /* rcu_report_qs_rnp() releases rnp->lock. */
2494 rcu_report_qs_rnp(mask, rsp, rnp, flags);
2497 raw_spin_unlock_irqrestore(&rnp->lock, flags);
2499 rnp = rcu_get_root(rsp);
2500 if (rnp->qsmask == 0) {
2501 raw_spin_lock_irqsave(&rnp->lock, flags);
2502 smp_mb__after_unlock_lock();
2503 rcu_initiate_boost(rnp, flags); /* releases rnp->lock. */
2508 * Force quiescent states on reluctant CPUs, and also detect which
2509 * CPUs are in dyntick-idle mode.
2511 static void force_quiescent_state(struct rcu_state *rsp)
2513 unsigned long flags;
2515 struct rcu_node *rnp;
2516 struct rcu_node *rnp_old = NULL;
2518 /* Funnel through hierarchy to reduce memory contention. */
2519 rnp = __this_cpu_read(rsp->rda->mynode);
2520 for (; rnp != NULL; rnp = rnp->parent) {
2521 ret = (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) ||
2522 !raw_spin_trylock(&rnp->fqslock);
2523 if (rnp_old != NULL)
2524 raw_spin_unlock(&rnp_old->fqslock);
2526 rsp->n_force_qs_lh++;
2531 /* rnp_old == rcu_get_root(rsp), rnp == NULL. */
2533 /* Reached the root of the rcu_node tree, acquire lock. */
2534 raw_spin_lock_irqsave(&rnp_old->lock, flags);
2535 smp_mb__after_unlock_lock();
2536 raw_spin_unlock(&rnp_old->fqslock);
2537 if (ACCESS_ONCE(rsp->gp_flags) & RCU_GP_FLAG_FQS) {
2538 rsp->n_force_qs_lh++;
2539 raw_spin_unlock_irqrestore(&rnp_old->lock, flags);
2540 return; /* Someone beat us to it. */
2542 ACCESS_ONCE(rsp->gp_flags) =
2543 ACCESS_ONCE(rsp->gp_flags) | RCU_GP_FLAG_FQS;
2544 raw_spin_unlock_irqrestore(&rnp_old->lock, flags);
2545 rcu_gp_kthread_wake(rsp);
2549 * This does the RCU core processing work for the specified rcu_state
2550 * and rcu_data structures. This may be called only from the CPU to
2551 * whom the rdp belongs.
2554 __rcu_process_callbacks(struct rcu_state *rsp)
2556 unsigned long flags;
2558 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
2560 WARN_ON_ONCE(rdp->beenonline == 0);
2562 /* Update RCU state based on any recent quiescent states. */
2563 rcu_check_quiescent_state(rsp, rdp);
2565 /* Does this CPU require a not-yet-started grace period? */
2566 local_irq_save(flags);
2567 if (cpu_needs_another_gp(rsp, rdp)) {
2568 raw_spin_lock(&rcu_get_root(rsp)->lock); /* irqs disabled. */
2569 needwake = rcu_start_gp(rsp);
2570 raw_spin_unlock_irqrestore(&rcu_get_root(rsp)->lock, flags);
2572 rcu_gp_kthread_wake(rsp);
2574 local_irq_restore(flags);
2577 /* If there are callbacks ready, invoke them. */
2578 if (cpu_has_callbacks_ready_to_invoke(rdp))
2579 invoke_rcu_callbacks(rsp, rdp);
2581 /* Do any needed deferred wakeups of rcuo kthreads. */
2582 do_nocb_deferred_wakeup(rdp);
2586 * Do RCU core processing for the current CPU.
2588 static void rcu_process_callbacks(struct softirq_action *unused)
2590 struct rcu_state *rsp;
2592 if (cpu_is_offline(smp_processor_id()))
2594 trace_rcu_utilization(TPS("Start RCU core"));
2595 for_each_rcu_flavor(rsp)
2596 __rcu_process_callbacks(rsp);
2597 trace_rcu_utilization(TPS("End RCU core"));
2601 * Schedule RCU callback invocation. If the specified type of RCU
2602 * does not support RCU priority boosting, just do a direct call,
2603 * otherwise wake up the per-CPU kernel kthread. Note that because we
2604 * are running on the current CPU with interrupts disabled, the
2605 * rcu_cpu_kthread_task cannot disappear out from under us.
2607 static void invoke_rcu_callbacks(struct rcu_state *rsp, struct rcu_data *rdp)
2609 if (unlikely(!ACCESS_ONCE(rcu_scheduler_fully_active)))
2611 if (likely(!rsp->boost)) {
2612 rcu_do_batch(rsp, rdp);
2615 invoke_rcu_callbacks_kthread();
2618 static void invoke_rcu_core(void)
2620 if (cpu_online(smp_processor_id()))
2621 raise_softirq(RCU_SOFTIRQ);
2625 * Handle any core-RCU processing required by a call_rcu() invocation.
2627 static void __call_rcu_core(struct rcu_state *rsp, struct rcu_data *rdp,
2628 struct rcu_head *head, unsigned long flags)
2633 * If called from an extended quiescent state, invoke the RCU
2634 * core in order to force a re-evaluation of RCU's idleness.
2636 if (!rcu_is_watching() && cpu_online(smp_processor_id()))
2639 /* If interrupts were disabled or CPU offline, don't invoke RCU core. */
2640 if (irqs_disabled_flags(flags) || cpu_is_offline(smp_processor_id()))
2644 * Force the grace period if too many callbacks or too long waiting.
2645 * Enforce hysteresis, and don't invoke force_quiescent_state()
2646 * if some other CPU has recently done so. Also, don't bother
2647 * invoking force_quiescent_state() if the newly enqueued callback
2648 * is the only one waiting for a grace period to complete.
2650 if (unlikely(rdp->qlen > rdp->qlen_last_fqs_check + qhimark)) {
2652 /* Are we ignoring a completed grace period? */
2653 note_gp_changes(rsp, rdp);
2655 /* Start a new grace period if one not already started. */
2656 if (!rcu_gp_in_progress(rsp)) {
2657 struct rcu_node *rnp_root = rcu_get_root(rsp);
2659 raw_spin_lock(&rnp_root->lock);
2660 smp_mb__after_unlock_lock();
2661 needwake = rcu_start_gp(rsp);
2662 raw_spin_unlock(&rnp_root->lock);
2664 rcu_gp_kthread_wake(rsp);
2666 /* Give the grace period a kick. */
2667 rdp->blimit = LONG_MAX;
2668 if (rsp->n_force_qs == rdp->n_force_qs_snap &&
2669 *rdp->nxttail[RCU_DONE_TAIL] != head)
2670 force_quiescent_state(rsp);
2671 rdp->n_force_qs_snap = rsp->n_force_qs;
2672 rdp->qlen_last_fqs_check = rdp->qlen;
2678 * RCU callback function to leak a callback.
2680 static void rcu_leak_callback(struct rcu_head *rhp)
2685 * Helper function for call_rcu() and friends. The cpu argument will
2686 * normally be -1, indicating "currently running CPU". It may specify
2687 * a CPU only if that CPU is a no-CBs CPU. Currently, only _rcu_barrier()
2688 * is expected to specify a CPU.
2691 __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu),
2692 struct rcu_state *rsp, int cpu, bool lazy)
2694 unsigned long flags;
2695 struct rcu_data *rdp;
2697 WARN_ON_ONCE((unsigned long)head & 0x1); /* Misaligned rcu_head! */
2698 if (debug_rcu_head_queue(head)) {
2699 /* Probable double call_rcu(), so leak the callback. */
2700 ACCESS_ONCE(head->func) = rcu_leak_callback;
2701 WARN_ONCE(1, "__call_rcu(): Leaked duplicate callback\n");
2708 * Opportunistically note grace-period endings and beginnings.
2709 * Note that we might see a beginning right after we see an
2710 * end, but never vice versa, since this CPU has to pass through
2711 * a quiescent state betweentimes.
2713 local_irq_save(flags);
2714 rdp = this_cpu_ptr(rsp->rda);
2716 /* Add the callback to our list. */
2717 if (unlikely(rdp->nxttail[RCU_NEXT_TAIL] == NULL) || cpu != -1) {
2721 rdp = per_cpu_ptr(rsp->rda, cpu);
2722 offline = !__call_rcu_nocb(rdp, head, lazy, flags);
2723 WARN_ON_ONCE(offline);
2724 /* _call_rcu() is illegal on offline CPU; leak the callback. */
2725 local_irq_restore(flags);
2728 ACCESS_ONCE(rdp->qlen) = rdp->qlen + 1;
2732 rcu_idle_count_callbacks_posted();
2733 smp_mb(); /* Count before adding callback for rcu_barrier(). */
2734 *rdp->nxttail[RCU_NEXT_TAIL] = head;
2735 rdp->nxttail[RCU_NEXT_TAIL] = &head->next;
2737 if (__is_kfree_rcu_offset((unsigned long)func))
2738 trace_rcu_kfree_callback(rsp->name, head, (unsigned long)func,
2739 rdp->qlen_lazy, rdp->qlen);
2741 trace_rcu_callback(rsp->name, head, rdp->qlen_lazy, rdp->qlen);
2743 /* Go handle any RCU core processing required. */
2744 __call_rcu_core(rsp, rdp, head, flags);
2745 local_irq_restore(flags);
2749 * Queue an RCU-sched callback for invocation after a grace period.
2751 void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
2753 __call_rcu(head, func, &rcu_sched_state, -1, 0);
2755 EXPORT_SYMBOL_GPL(call_rcu_sched);
2758 * Queue an RCU callback for invocation after a quicker grace period.
2760 void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
2762 __call_rcu(head, func, &rcu_bh_state, -1, 0);
2764 EXPORT_SYMBOL_GPL(call_rcu_bh);
2767 * Queue an RCU callback for lazy invocation after a grace period.
2768 * This will likely be later named something like "call_rcu_lazy()",
2769 * but this change will require some way of tagging the lazy RCU
2770 * callbacks in the list of pending callbacks. Until then, this
2771 * function may only be called from __kfree_rcu().
2773 void kfree_call_rcu(struct rcu_head *head,
2774 void (*func)(struct rcu_head *rcu))
2776 __call_rcu(head, func, rcu_state_p, -1, 1);
2778 EXPORT_SYMBOL_GPL(kfree_call_rcu);
2781 * Because a context switch is a grace period for RCU-sched and RCU-bh,
2782 * any blocking grace-period wait automatically implies a grace period
2783 * if there is only one CPU online at any point time during execution
2784 * of either synchronize_sched() or synchronize_rcu_bh(). It is OK to
2785 * occasionally incorrectly indicate that there are multiple CPUs online
2786 * when there was in fact only one the whole time, as this just adds
2787 * some overhead: RCU still operates correctly.
2789 static inline int rcu_blocking_is_gp(void)
2793 might_sleep(); /* Check for RCU read-side critical section. */
2795 ret = num_online_cpus() <= 1;
2801 * synchronize_sched - wait until an rcu-sched grace period has elapsed.
2803 * Control will return to the caller some time after a full rcu-sched
2804 * grace period has elapsed, in other words after all currently executing
2805 * rcu-sched read-side critical sections have completed. These read-side
2806 * critical sections are delimited by rcu_read_lock_sched() and
2807 * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(),
2808 * local_irq_disable(), and so on may be used in place of
2809 * rcu_read_lock_sched().
2811 * This means that all preempt_disable code sequences, including NMI and
2812 * non-threaded hardware-interrupt handlers, in progress on entry will
2813 * have completed before this primitive returns. However, this does not
2814 * guarantee that softirq handlers will have completed, since in some
2815 * kernels, these handlers can run in process context, and can block.
2817 * Note that this guarantee implies further memory-ordering guarantees.
2818 * On systems with more than one CPU, when synchronize_sched() returns,
2819 * each CPU is guaranteed to have executed a full memory barrier since the
2820 * end of its last RCU-sched read-side critical section whose beginning
2821 * preceded the call to synchronize_sched(). In addition, each CPU having
2822 * an RCU read-side critical section that extends beyond the return from
2823 * synchronize_sched() is guaranteed to have executed a full memory barrier
2824 * after the beginning of synchronize_sched() and before the beginning of
2825 * that RCU read-side critical section. Note that these guarantees include
2826 * CPUs that are offline, idle, or executing in user mode, as well as CPUs
2827 * that are executing in the kernel.
2829 * Furthermore, if CPU A invoked synchronize_sched(), which returned
2830 * to its caller on CPU B, then both CPU A and CPU B are guaranteed
2831 * to have executed a full memory barrier during the execution of
2832 * synchronize_sched() -- even if CPU A and CPU B are the same CPU (but
2833 * again only if the system has more than one CPU).
2835 * This primitive provides the guarantees made by the (now removed)
2836 * synchronize_kernel() API. In contrast, synchronize_rcu() only
2837 * guarantees that rcu_read_lock() sections will have completed.
2838 * In "classic RCU", these two guarantees happen to be one and
2839 * the same, but can differ in realtime RCU implementations.
2841 void synchronize_sched(void)
2843 rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) &&
2844 !lock_is_held(&rcu_lock_map) &&
2845 !lock_is_held(&rcu_sched_lock_map),
2846 "Illegal synchronize_sched() in RCU-sched read-side critical section");
2847 if (rcu_blocking_is_gp())
2850 synchronize_sched_expedited();
2852 wait_rcu_gp(call_rcu_sched);
2854 EXPORT_SYMBOL_GPL(synchronize_sched);
2857 * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed.
2859 * Control will return to the caller some time after a full rcu_bh grace
2860 * period has elapsed, in other words after all currently executing rcu_bh
2861 * read-side critical sections have completed. RCU read-side critical
2862 * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(),
2863 * and may be nested.
2865 * See the description of synchronize_sched() for more detailed information
2866 * on memory ordering guarantees.
2868 void synchronize_rcu_bh(void)
2870 rcu_lockdep_assert(!lock_is_held(&rcu_bh_lock_map) &&
2871 !lock_is_held(&rcu_lock_map) &&
2872 !lock_is_held(&rcu_sched_lock_map),
2873 "Illegal synchronize_rcu_bh() in RCU-bh read-side critical section");
2874 if (rcu_blocking_is_gp())
2877 synchronize_rcu_bh_expedited();
2879 wait_rcu_gp(call_rcu_bh);
2881 EXPORT_SYMBOL_GPL(synchronize_rcu_bh);
2884 * get_state_synchronize_rcu - Snapshot current RCU state
2886 * Returns a cookie that is used by a later call to cond_synchronize_rcu()
2887 * to determine whether or not a full grace period has elapsed in the
2890 unsigned long get_state_synchronize_rcu(void)
2893 * Any prior manipulation of RCU-protected data must happen
2894 * before the load from ->gpnum.
2899 * Make sure this load happens before the purportedly
2900 * time-consuming work between get_state_synchronize_rcu()
2901 * and cond_synchronize_rcu().
2903 return smp_load_acquire(&rcu_state_p->gpnum);
2905 EXPORT_SYMBOL_GPL(get_state_synchronize_rcu);
2908 * cond_synchronize_rcu - Conditionally wait for an RCU grace period
2910 * @oldstate: return value from earlier call to get_state_synchronize_rcu()
2912 * If a full RCU grace period has elapsed since the earlier call to
2913 * get_state_synchronize_rcu(), just return. Otherwise, invoke
2914 * synchronize_rcu() to wait for a full grace period.
2916 * Yes, this function does not take counter wrap into account. But
2917 * counter wrap is harmless. If the counter wraps, we have waited for
2918 * more than 2 billion grace periods (and way more on a 64-bit system!),
2919 * so waiting for one additional grace period should be just fine.
2921 void cond_synchronize_rcu(unsigned long oldstate)
2923 unsigned long newstate;
2926 * Ensure that this load happens before any RCU-destructive
2927 * actions the caller might carry out after we return.
2929 newstate = smp_load_acquire(&rcu_state_p->completed);
2930 if (ULONG_CMP_GE(oldstate, newstate))
2933 EXPORT_SYMBOL_GPL(cond_synchronize_rcu);
2935 static int synchronize_sched_expedited_cpu_stop(void *data)
2938 * There must be a full memory barrier on each affected CPU
2939 * between the time that try_stop_cpus() is called and the
2940 * time that it returns.
2942 * In the current initial implementation of cpu_stop, the
2943 * above condition is already met when the control reaches
2944 * this point and the following smp_mb() is not strictly
2945 * necessary. Do smp_mb() anyway for documentation and
2946 * robustness against future implementation changes.
2948 smp_mb(); /* See above comment block. */
2953 * synchronize_sched_expedited - Brute-force RCU-sched grace period
2955 * Wait for an RCU-sched grace period to elapse, but use a "big hammer"
2956 * approach to force the grace period to end quickly. This consumes
2957 * significant time on all CPUs and is unfriendly to real-time workloads,
2958 * so is thus not recommended for any sort of common-case code. In fact,
2959 * if you are using synchronize_sched_expedited() in a loop, please
2960 * restructure your code to batch your updates, and then use a single
2961 * synchronize_sched() instead.
2963 * This implementation can be thought of as an application of ticket
2964 * locking to RCU, with sync_sched_expedited_started and
2965 * sync_sched_expedited_done taking on the roles of the halves
2966 * of the ticket-lock word. Each task atomically increments
2967 * sync_sched_expedited_started upon entry, snapshotting the old value,
2968 * then attempts to stop all the CPUs. If this succeeds, then each
2969 * CPU will have executed a context switch, resulting in an RCU-sched
2970 * grace period. We are then done, so we use atomic_cmpxchg() to
2971 * update sync_sched_expedited_done to match our snapshot -- but
2972 * only if someone else has not already advanced past our snapshot.
2974 * On the other hand, if try_stop_cpus() fails, we check the value
2975 * of sync_sched_expedited_done. If it has advanced past our
2976 * initial snapshot, then someone else must have forced a grace period
2977 * some time after we took our snapshot. In this case, our work is
2978 * done for us, and we can simply return. Otherwise, we try again,
2979 * but keep our initial snapshot for purposes of checking for someone
2980 * doing our work for us.
2982 * If we fail too many times in a row, we fall back to synchronize_sched().
2984 void synchronize_sched_expedited(void)
2989 long firstsnap, s, snap;
2991 struct rcu_state *rsp = &rcu_sched_state;
2994 * If we are in danger of counter wrap, just do synchronize_sched().
2995 * By allowing sync_sched_expedited_started to advance no more than
2996 * ULONG_MAX/8 ahead of sync_sched_expedited_done, we are ensuring
2997 * that more than 3.5 billion CPUs would be required to force a
2998 * counter wrap on a 32-bit system. Quite a few more CPUs would of
2999 * course be required on a 64-bit system.
3001 if (ULONG_CMP_GE((ulong)atomic_long_read(&rsp->expedited_start),
3002 (ulong)atomic_long_read(&rsp->expedited_done) +
3004 synchronize_sched();
3005 atomic_long_inc(&rsp->expedited_wrap);
3010 * Take a ticket. Note that atomic_inc_return() implies a
3011 * full memory barrier.
3013 snap = atomic_long_inc_return(&rsp->expedited_start);
3015 if (!try_get_online_cpus()) {
3016 /* CPU hotplug operation in flight, fall back to normal GP. */
3017 wait_rcu_gp(call_rcu_sched);
3018 atomic_long_inc(&rsp->expedited_normal);
3021 WARN_ON_ONCE(cpu_is_offline(raw_smp_processor_id()));
3023 /* Offline CPUs, idle CPUs, and any CPU we run on are quiescent. */
3024 cma = zalloc_cpumask_var(&cm, GFP_KERNEL);
3026 cpumask_copy(cm, cpu_online_mask);
3027 cpumask_clear_cpu(raw_smp_processor_id(), cm);
3028 for_each_cpu(cpu, cm) {
3029 struct rcu_dynticks *rdtp = &per_cpu(rcu_dynticks, cpu);
3031 if (!(atomic_add_return(0, &rdtp->dynticks) & 0x1))
3032 cpumask_clear_cpu(cpu, cm);
3034 if (cpumask_weight(cm) == 0)
3039 * Each pass through the following loop attempts to force a
3040 * context switch on each CPU.
3042 while (try_stop_cpus(cma ? cm : cpu_online_mask,
3043 synchronize_sched_expedited_cpu_stop,
3046 atomic_long_inc(&rsp->expedited_tryfail);
3048 /* Check to see if someone else did our work for us. */
3049 s = atomic_long_read(&rsp->expedited_done);
3050 if (ULONG_CMP_GE((ulong)s, (ulong)firstsnap)) {
3051 /* ensure test happens before caller kfree */
3052 smp_mb__before_atomic(); /* ^^^ */
3053 atomic_long_inc(&rsp->expedited_workdone1);
3054 free_cpumask_var(cm);
3058 /* No joy, try again later. Or just synchronize_sched(). */
3059 if (trycount++ < 10) {
3060 udelay(trycount * num_online_cpus());
3062 wait_rcu_gp(call_rcu_sched);
3063 atomic_long_inc(&rsp->expedited_normal);
3064 free_cpumask_var(cm);
3068 /* Recheck to see if someone else did our work for us. */
3069 s = atomic_long_read(&rsp->expedited_done);
3070 if (ULONG_CMP_GE((ulong)s, (ulong)firstsnap)) {
3071 /* ensure test happens before caller kfree */
3072 smp_mb__before_atomic(); /* ^^^ */
3073 atomic_long_inc(&rsp->expedited_workdone2);
3074 free_cpumask_var(cm);
3079 * Refetching sync_sched_expedited_started allows later
3080 * callers to piggyback on our grace period. We retry
3081 * after they started, so our grace period works for them,
3082 * and they started after our first try, so their grace
3083 * period works for us.
3085 if (!try_get_online_cpus()) {
3086 /* CPU hotplug operation in flight, use normal GP. */
3087 wait_rcu_gp(call_rcu_sched);
3088 atomic_long_inc(&rsp->expedited_normal);
3089 free_cpumask_var(cm);
3092 snap = atomic_long_read(&rsp->expedited_start);
3093 smp_mb(); /* ensure read is before try_stop_cpus(). */
3095 atomic_long_inc(&rsp->expedited_stoppedcpus);
3098 free_cpumask_var(cm);
3101 * Everyone up to our most recent fetch is covered by our grace
3102 * period. Update the counter, but only if our work is still
3103 * relevant -- which it won't be if someone who started later
3104 * than we did already did their update.
3107 atomic_long_inc(&rsp->expedited_done_tries);
3108 s = atomic_long_read(&rsp->expedited_done);
3109 if (ULONG_CMP_GE((ulong)s, (ulong)snap)) {
3110 /* ensure test happens before caller kfree */
3111 smp_mb__before_atomic(); /* ^^^ */
3112 atomic_long_inc(&rsp->expedited_done_lost);
3115 } while (atomic_long_cmpxchg(&rsp->expedited_done, s, snap) != s);
3116 atomic_long_inc(&rsp->expedited_done_exit);
3120 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
3123 * Check to see if there is any immediate RCU-related work to be done
3124 * by the current CPU, for the specified type of RCU, returning 1 if so.
3125 * The checks are in order of increasing expense: checks that can be
3126 * carried out against CPU-local state are performed first. However,
3127 * we must check for CPU stalls first, else we might not get a chance.
3129 static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp)
3131 struct rcu_node *rnp = rdp->mynode;
3133 rdp->n_rcu_pending++;
3135 /* Check for CPU stalls, if enabled. */
3136 check_cpu_stall(rsp, rdp);
3138 /* Is this CPU a NO_HZ_FULL CPU that should ignore RCU? */
3139 if (rcu_nohz_full_cpu(rsp))
3142 /* Is the RCU core waiting for a quiescent state from this CPU? */
3143 if (rcu_scheduler_fully_active &&
3144 rdp->qs_pending && !rdp->passed_quiesce) {
3145 rdp->n_rp_qs_pending++;
3146 } else if (rdp->qs_pending && rdp->passed_quiesce) {
3147 rdp->n_rp_report_qs++;
3151 /* Does this CPU have callbacks ready to invoke? */
3152 if (cpu_has_callbacks_ready_to_invoke(rdp)) {
3153 rdp->n_rp_cb_ready++;
3157 /* Has RCU gone idle with this CPU needing another grace period? */
3158 if (cpu_needs_another_gp(rsp, rdp)) {
3159 rdp->n_rp_cpu_needs_gp++;
3163 /* Has another RCU grace period completed? */
3164 if (ACCESS_ONCE(rnp->completed) != rdp->completed) { /* outside lock */
3165 rdp->n_rp_gp_completed++;
3169 /* Has a new RCU grace period started? */
3170 if (ACCESS_ONCE(rnp->gpnum) != rdp->gpnum) { /* outside lock */
3171 rdp->n_rp_gp_started++;
3175 /* Does this CPU need a deferred NOCB wakeup? */
3176 if (rcu_nocb_need_deferred_wakeup(rdp)) {
3177 rdp->n_rp_nocb_defer_wakeup++;
3182 rdp->n_rp_need_nothing++;
3187 * Check to see if there is any immediate RCU-related work to be done
3188 * by the current CPU, returning 1 if so. This function is part of the
3189 * RCU implementation; it is -not- an exported member of the RCU API.
3191 static int rcu_pending(void)
3193 struct rcu_state *rsp;
3195 for_each_rcu_flavor(rsp)
3196 if (__rcu_pending(rsp, this_cpu_ptr(rsp->rda)))
3202 * Return true if the specified CPU has any callback. If all_lazy is
3203 * non-NULL, store an indication of whether all callbacks are lazy.
3204 * (If there are no callbacks, all of them are deemed to be lazy.)
3206 static int __maybe_unused rcu_cpu_has_callbacks(bool *all_lazy)
3210 struct rcu_data *rdp;
3211 struct rcu_state *rsp;
3213 for_each_rcu_flavor(rsp) {
3214 rdp = this_cpu_ptr(rsp->rda);
3218 if (rdp->qlen != rdp->qlen_lazy || !all_lazy) {
3229 * Helper function for _rcu_barrier() tracing. If tracing is disabled,
3230 * the compiler is expected to optimize this away.
3232 static void _rcu_barrier_trace(struct rcu_state *rsp, const char *s,
3233 int cpu, unsigned long done)
3235 trace_rcu_barrier(rsp->name, s, cpu,
3236 atomic_read(&rsp->barrier_cpu_count), done);
3240 * RCU callback function for _rcu_barrier(). If we are last, wake
3241 * up the task executing _rcu_barrier().
3243 static void rcu_barrier_callback(struct rcu_head *rhp)
3245 struct rcu_data *rdp = container_of(rhp, struct rcu_data, barrier_head);
3246 struct rcu_state *rsp = rdp->rsp;
3248 if (atomic_dec_and_test(&rsp->barrier_cpu_count)) {
3249 _rcu_barrier_trace(rsp, "LastCB", -1, rsp->n_barrier_done);
3250 complete(&rsp->barrier_completion);
3252 _rcu_barrier_trace(rsp, "CB", -1, rsp->n_barrier_done);
3257 * Called with preemption disabled, and from cross-cpu IRQ context.
3259 static void rcu_barrier_func(void *type)
3261 struct rcu_state *rsp = type;
3262 struct rcu_data *rdp = raw_cpu_ptr(rsp->rda);
3264 _rcu_barrier_trace(rsp, "IRQ", -1, rsp->n_barrier_done);
3265 atomic_inc(&rsp->barrier_cpu_count);
3266 rsp->call(&rdp->barrier_head, rcu_barrier_callback);
3270 * Orchestrate the specified type of RCU barrier, waiting for all
3271 * RCU callbacks of the specified type to complete.
3273 static void _rcu_barrier(struct rcu_state *rsp)
3276 struct rcu_data *rdp;
3277 unsigned long snap = ACCESS_ONCE(rsp->n_barrier_done);
3278 unsigned long snap_done;
3280 _rcu_barrier_trace(rsp, "Begin", -1, snap);
3282 /* Take mutex to serialize concurrent rcu_barrier() requests. */
3283 mutex_lock(&rsp->barrier_mutex);
3286 * Ensure that all prior references, including to ->n_barrier_done,
3287 * are ordered before the _rcu_barrier() machinery.
3289 smp_mb(); /* See above block comment. */
3292 * Recheck ->n_barrier_done to see if others did our work for us.
3293 * This means checking ->n_barrier_done for an even-to-odd-to-even
3294 * transition. The "if" expression below therefore rounds the old
3295 * value up to the next even number and adds two before comparing.
3297 snap_done = rsp->n_barrier_done;
3298 _rcu_barrier_trace(rsp, "Check", -1, snap_done);
3301 * If the value in snap is odd, we needed to wait for the current
3302 * rcu_barrier() to complete, then wait for the next one, in other
3303 * words, we need the value of snap_done to be three larger than
3304 * the value of snap. On the other hand, if the value in snap is
3305 * even, we only had to wait for the next rcu_barrier() to complete,
3306 * in other words, we need the value of snap_done to be only two
3307 * greater than the value of snap. The "(snap + 3) & ~0x1" computes
3308 * this for us (thank you, Linus!).
3310 if (ULONG_CMP_GE(snap_done, (snap + 3) & ~0x1)) {
3311 _rcu_barrier_trace(rsp, "EarlyExit", -1, snap_done);
3312 smp_mb(); /* caller's subsequent code after above check. */
3313 mutex_unlock(&rsp->barrier_mutex);
3318 * Increment ->n_barrier_done to avoid duplicate work. Use
3319 * ACCESS_ONCE() to prevent the compiler from speculating
3320 * the increment to precede the early-exit check.
3322 ACCESS_ONCE(rsp->n_barrier_done) = rsp->n_barrier_done + 1;
3323 WARN_ON_ONCE((rsp->n_barrier_done & 0x1) != 1);
3324 _rcu_barrier_trace(rsp, "Inc1", -1, rsp->n_barrier_done);
3325 smp_mb(); /* Order ->n_barrier_done increment with below mechanism. */
3328 * Initialize the count to one rather than to zero in order to
3329 * avoid a too-soon return to zero in case of a short grace period
3330 * (or preemption of this task). Exclude CPU-hotplug operations
3331 * to ensure that no offline CPU has callbacks queued.
3333 init_completion(&rsp->barrier_completion);
3334 atomic_set(&rsp->barrier_cpu_count, 1);
3338 * Force each CPU with callbacks to register a new callback.
3339 * When that callback is invoked, we will know that all of the
3340 * corresponding CPU's preceding callbacks have been invoked.
3342 for_each_possible_cpu(cpu) {
3343 if (!cpu_online(cpu) && !rcu_is_nocb_cpu(cpu))
3345 rdp = per_cpu_ptr(rsp->rda, cpu);
3346 if (rcu_is_nocb_cpu(cpu)) {
3347 if (!rcu_nocb_cpu_needs_barrier(rsp, cpu)) {
3348 _rcu_barrier_trace(rsp, "OfflineNoCB", cpu,
3349 rsp->n_barrier_done);
3351 _rcu_barrier_trace(rsp, "OnlineNoCB", cpu,
3352 rsp->n_barrier_done);
3353 atomic_inc(&rsp->barrier_cpu_count);
3354 __call_rcu(&rdp->barrier_head,
3355 rcu_barrier_callback, rsp, cpu, 0);
3357 } else if (ACCESS_ONCE(rdp->qlen)) {
3358 _rcu_barrier_trace(rsp, "OnlineQ", cpu,
3359 rsp->n_barrier_done);
3360 smp_call_function_single(cpu, rcu_barrier_func, rsp, 1);
3362 _rcu_barrier_trace(rsp, "OnlineNQ", cpu,
3363 rsp->n_barrier_done);
3369 * Now that we have an rcu_barrier_callback() callback on each
3370 * CPU, and thus each counted, remove the initial count.
3372 if (atomic_dec_and_test(&rsp->barrier_cpu_count))
3373 complete(&rsp->barrier_completion);
3375 /* Increment ->n_barrier_done to prevent duplicate work. */
3376 smp_mb(); /* Keep increment after above mechanism. */
3377 ACCESS_ONCE(rsp->n_barrier_done) = rsp->n_barrier_done + 1;
3378 WARN_ON_ONCE((rsp->n_barrier_done & 0x1) != 0);
3379 _rcu_barrier_trace(rsp, "Inc2", -1, rsp->n_barrier_done);
3380 smp_mb(); /* Keep increment before caller's subsequent code. */
3382 /* Wait for all rcu_barrier_callback() callbacks to be invoked. */
3383 wait_for_completion(&rsp->barrier_completion);
3385 /* Other rcu_barrier() invocations can now safely proceed. */
3386 mutex_unlock(&rsp->barrier_mutex);
3390 * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete.
3392 void rcu_barrier_bh(void)
3394 _rcu_barrier(&rcu_bh_state);
3396 EXPORT_SYMBOL_GPL(rcu_barrier_bh);
3399 * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks.
3401 void rcu_barrier_sched(void)
3403 _rcu_barrier(&rcu_sched_state);
3405 EXPORT_SYMBOL_GPL(rcu_barrier_sched);
3408 * Do boot-time initialization of a CPU's per-CPU RCU data.
3411 rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp)
3413 unsigned long flags;
3414 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3415 struct rcu_node *rnp = rcu_get_root(rsp);
3417 /* Set up local state, ensuring consistent view of global state. */
3418 raw_spin_lock_irqsave(&rnp->lock, flags);
3419 rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo);
3420 init_callback_list(rdp);
3422 ACCESS_ONCE(rdp->qlen) = 0;
3423 rdp->dynticks = &per_cpu(rcu_dynticks, cpu);
3424 WARN_ON_ONCE(rdp->dynticks->dynticks_nesting != DYNTICK_TASK_EXIT_IDLE);
3425 WARN_ON_ONCE(atomic_read(&rdp->dynticks->dynticks) != 1);
3428 rcu_boot_init_nocb_percpu_data(rdp);
3429 raw_spin_unlock_irqrestore(&rnp->lock, flags);
3433 * Initialize a CPU's per-CPU RCU data. Note that only one online or
3434 * offline event can be happening at a given time. Note also that we
3435 * can accept some slop in the rsp->completed access due to the fact
3436 * that this CPU cannot possibly have any RCU callbacks in flight yet.
3439 rcu_init_percpu_data(int cpu, struct rcu_state *rsp)
3441 unsigned long flags;
3443 struct rcu_data *rdp = per_cpu_ptr(rsp->rda, cpu);
3444 struct rcu_node *rnp = rcu_get_root(rsp);
3446 /* Exclude new grace periods. */
3447 mutex_lock(&rsp->onoff_mutex);
3449 /* Set up local state, ensuring consistent view of global state. */
3450 raw_spin_lock_irqsave(&rnp->lock, flags);
3451 rdp->beenonline = 1; /* We have now been online. */
3452 rdp->qlen_last_fqs_check = 0;
3453 rdp->n_force_qs_snap = rsp->n_force_qs;
3454 rdp->blimit = blimit;
3455 init_callback_list(rdp); /* Re-enable callbacks on this CPU. */
3456 rdp->dynticks->dynticks_nesting = DYNTICK_TASK_EXIT_IDLE;
3457 rcu_sysidle_init_percpu_data(rdp->dynticks);
3458 atomic_set(&rdp->dynticks->dynticks,
3459 (atomic_read(&rdp->dynticks->dynticks) & ~0x1) + 1);
3460 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
3462 /* Add CPU to rcu_node bitmasks. */
3464 mask = rdp->grpmask;
3466 /* Exclude any attempts to start a new GP on small systems. */
3467 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
3468 rnp->qsmaskinit |= mask;
3469 mask = rnp->grpmask;
3470 if (rnp == rdp->mynode) {
3472 * If there is a grace period in progress, we will
3473 * set up to wait for it next time we run the
3476 rdp->gpnum = rnp->completed;
3477 rdp->completed = rnp->completed;
3478 rdp->passed_quiesce = 0;
3479 rdp->qs_pending = 0;
3480 trace_rcu_grace_period(rsp->name, rdp->gpnum, TPS("cpuonl"));
3482 raw_spin_unlock(&rnp->lock); /* irqs already disabled. */
3484 } while (rnp != NULL && !(rnp->qsmaskinit & mask));
3485 local_irq_restore(flags);
3487 mutex_unlock(&rsp->onoff_mutex);
3490 static void rcu_prepare_cpu(int cpu)
3492 struct rcu_state *rsp;
3494 for_each_rcu_flavor(rsp)
3495 rcu_init_percpu_data(cpu, rsp);
3499 * Handle CPU online/offline notification events.
3501 static int rcu_cpu_notify(struct notifier_block *self,
3502 unsigned long action, void *hcpu)
3504 long cpu = (long)hcpu;
3505 struct rcu_data *rdp = per_cpu_ptr(rcu_state_p->rda, cpu);
3506 struct rcu_node *rnp = rdp->mynode;
3507 struct rcu_state *rsp;
3509 trace_rcu_utilization(TPS("Start CPU hotplug"));
3511 case CPU_UP_PREPARE:
3512 case CPU_UP_PREPARE_FROZEN:
3513 rcu_prepare_cpu(cpu);
3514 rcu_prepare_kthreads(cpu);
3515 rcu_spawn_all_nocb_kthreads(cpu);
3518 case CPU_DOWN_FAILED:
3519 rcu_boost_kthread_setaffinity(rnp, -1);
3521 case CPU_DOWN_PREPARE:
3522 rcu_boost_kthread_setaffinity(rnp, cpu);
3525 case CPU_DYING_FROZEN:
3526 for_each_rcu_flavor(rsp)
3527 rcu_cleanup_dying_cpu(rsp);
3530 case CPU_DEAD_FROZEN:
3531 case CPU_UP_CANCELED:
3532 case CPU_UP_CANCELED_FROZEN:
3533 for_each_rcu_flavor(rsp) {
3534 rcu_cleanup_dead_cpu(cpu, rsp);
3535 do_nocb_deferred_wakeup(per_cpu_ptr(rsp->rda, cpu));
3541 trace_rcu_utilization(TPS("End CPU hotplug"));
3545 static int rcu_pm_notify(struct notifier_block *self,
3546 unsigned long action, void *hcpu)
3549 case PM_HIBERNATION_PREPARE:
3550 case PM_SUSPEND_PREPARE:
3551 if (nr_cpu_ids <= 256) /* Expediting bad for large systems. */
3554 case PM_POST_HIBERNATION:
3555 case PM_POST_SUSPEND:
3565 * Spawn the kthreads that handle each RCU flavor's grace periods.
3567 static int __init rcu_spawn_gp_kthread(void)
3569 unsigned long flags;
3570 struct rcu_node *rnp;
3571 struct rcu_state *rsp;
3572 struct task_struct *t;
3574 rcu_scheduler_fully_active = 1;
3575 for_each_rcu_flavor(rsp) {
3576 t = kthread_run(rcu_gp_kthread, rsp, "%s", rsp->name);
3578 rnp = rcu_get_root(rsp);
3579 raw_spin_lock_irqsave(&rnp->lock, flags);
3580 rsp->gp_kthread = t;
3581 raw_spin_unlock_irqrestore(&rnp->lock, flags);
3583 rcu_spawn_nocb_kthreads();
3584 rcu_spawn_boost_kthreads();
3587 early_initcall(rcu_spawn_gp_kthread);
3590 * This function is invoked towards the end of the scheduler's initialization
3591 * process. Before this is called, the idle task might contain
3592 * RCU read-side critical sections (during which time, this idle
3593 * task is booting the system). After this function is called, the
3594 * idle tasks are prohibited from containing RCU read-side critical
3595 * sections. This function also enables RCU lockdep checking.
3597 void rcu_scheduler_starting(void)
3599 WARN_ON(num_online_cpus() != 1);
3600 WARN_ON(nr_context_switches() > 0);
3601 rcu_scheduler_active = 1;
3605 * Compute the per-level fanout, either using the exact fanout specified
3606 * or balancing the tree, depending on CONFIG_RCU_FANOUT_EXACT.
3608 #ifdef CONFIG_RCU_FANOUT_EXACT
3609 static void __init rcu_init_levelspread(struct rcu_state *rsp)
3613 rsp->levelspread[rcu_num_lvls - 1] = rcu_fanout_leaf;
3614 for (i = rcu_num_lvls - 2; i >= 0; i--)
3615 rsp->levelspread[i] = CONFIG_RCU_FANOUT;
3617 #else /* #ifdef CONFIG_RCU_FANOUT_EXACT */
3618 static void __init rcu_init_levelspread(struct rcu_state *rsp)
3625 for (i = rcu_num_lvls - 1; i >= 0; i--) {
3626 ccur = rsp->levelcnt[i];
3627 rsp->levelspread[i] = (cprv + ccur - 1) / ccur;
3631 #endif /* #else #ifdef CONFIG_RCU_FANOUT_EXACT */
3634 * Helper function for rcu_init() that initializes one rcu_state structure.
3636 static void __init rcu_init_one(struct rcu_state *rsp,
3637 struct rcu_data __percpu *rda)
3639 static const char * const buf[] = {
3643 "rcu_node_3" }; /* Match MAX_RCU_LVLS */
3644 static const char * const fqs[] = {
3648 "rcu_node_fqs_3" }; /* Match MAX_RCU_LVLS */
3649 static u8 fl_mask = 0x1;
3653 struct rcu_node *rnp;
3655 BUILD_BUG_ON(MAX_RCU_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */
3657 /* Silence gcc 4.8 warning about array index out of range. */
3658 if (rcu_num_lvls > RCU_NUM_LVLS)
3659 panic("rcu_init_one: rcu_num_lvls overflow");
3661 /* Initialize the level-tracking arrays. */
3663 for (i = 0; i < rcu_num_lvls; i++)
3664 rsp->levelcnt[i] = num_rcu_lvl[i];
3665 for (i = 1; i < rcu_num_lvls; i++)
3666 rsp->level[i] = rsp->level[i - 1] + rsp->levelcnt[i - 1];
3667 rcu_init_levelspread(rsp);
3668 rsp->flavor_mask = fl_mask;
3671 /* Initialize the elements themselves, starting from the leaves. */
3673 for (i = rcu_num_lvls - 1; i >= 0; i--) {
3674 cpustride *= rsp->levelspread[i];
3675 rnp = rsp->level[i];
3676 for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) {
3677 raw_spin_lock_init(&rnp->lock);
3678 lockdep_set_class_and_name(&rnp->lock,
3679 &rcu_node_class[i], buf[i]);
3680 raw_spin_lock_init(&rnp->fqslock);
3681 lockdep_set_class_and_name(&rnp->fqslock,
3682 &rcu_fqs_class[i], fqs[i]);
3683 rnp->gpnum = rsp->gpnum;
3684 rnp->completed = rsp->completed;
3686 rnp->qsmaskinit = 0;
3687 rnp->grplo = j * cpustride;
3688 rnp->grphi = (j + 1) * cpustride - 1;
3689 if (rnp->grphi >= nr_cpu_ids)
3690 rnp->grphi = nr_cpu_ids - 1;
3696 rnp->grpnum = j % rsp->levelspread[i - 1];
3697 rnp->grpmask = 1UL << rnp->grpnum;
3698 rnp->parent = rsp->level[i - 1] +
3699 j / rsp->levelspread[i - 1];
3702 INIT_LIST_HEAD(&rnp->blkd_tasks);
3703 rcu_init_one_nocb(rnp);
3708 init_waitqueue_head(&rsp->gp_wq);
3709 rnp = rsp->level[rcu_num_lvls - 1];
3710 for_each_possible_cpu(i) {
3711 while (i > rnp->grphi)
3713 per_cpu_ptr(rsp->rda, i)->mynode = rnp;
3714 rcu_boot_init_percpu_data(i, rsp);
3716 list_add(&rsp->flavors, &rcu_struct_flavors);
3720 * Compute the rcu_node tree geometry from kernel parameters. This cannot
3721 * replace the definitions in tree.h because those are needed to size
3722 * the ->node array in the rcu_state structure.
3724 static void __init rcu_init_geometry(void)
3730 int rcu_capacity[MAX_RCU_LVLS + 1];
3733 * Initialize any unspecified boot parameters.
3734 * The default values of jiffies_till_first_fqs and
3735 * jiffies_till_next_fqs are set to the RCU_JIFFIES_TILL_FORCE_QS
3736 * value, which is a function of HZ, then adding one for each
3737 * RCU_JIFFIES_FQS_DIV CPUs that might be on the system.
3739 d = RCU_JIFFIES_TILL_FORCE_QS + nr_cpu_ids / RCU_JIFFIES_FQS_DIV;
3740 if (jiffies_till_first_fqs == ULONG_MAX)
3741 jiffies_till_first_fqs = d;
3742 if (jiffies_till_next_fqs == ULONG_MAX)
3743 jiffies_till_next_fqs = d;
3745 /* If the compile-time values are accurate, just leave. */
3746 if (rcu_fanout_leaf == CONFIG_RCU_FANOUT_LEAF &&
3747 nr_cpu_ids == NR_CPUS)
3749 pr_info("RCU: Adjusting geometry for rcu_fanout_leaf=%d, nr_cpu_ids=%d\n",
3750 rcu_fanout_leaf, nr_cpu_ids);
3753 * Compute number of nodes that can be handled an rcu_node tree
3754 * with the given number of levels. Setting rcu_capacity[0] makes
3755 * some of the arithmetic easier.
3757 rcu_capacity[0] = 1;
3758 rcu_capacity[1] = rcu_fanout_leaf;
3759 for (i = 2; i <= MAX_RCU_LVLS; i++)
3760 rcu_capacity[i] = rcu_capacity[i - 1] * CONFIG_RCU_FANOUT;
3763 * The boot-time rcu_fanout_leaf parameter is only permitted
3764 * to increase the leaf-level fanout, not decrease it. Of course,
3765 * the leaf-level fanout cannot exceed the number of bits in
3766 * the rcu_node masks. Finally, the tree must be able to accommodate
3767 * the configured number of CPUs. Complain and fall back to the
3768 * compile-time values if these limits are exceeded.
3770 if (rcu_fanout_leaf < CONFIG_RCU_FANOUT_LEAF ||
3771 rcu_fanout_leaf > sizeof(unsigned long) * 8 ||
3772 n > rcu_capacity[MAX_RCU_LVLS]) {
3777 /* Calculate the number of rcu_nodes at each level of the tree. */
3778 for (i = 1; i <= MAX_RCU_LVLS; i++)
3779 if (n <= rcu_capacity[i]) {
3780 for (j = 0; j <= i; j++)
3782 DIV_ROUND_UP(n, rcu_capacity[i - j]);
3784 for (j = i + 1; j <= MAX_RCU_LVLS; j++)
3789 /* Calculate the total number of rcu_node structures. */
3791 for (i = 0; i <= MAX_RCU_LVLS; i++)
3792 rcu_num_nodes += num_rcu_lvl[i];
3796 void __init rcu_init(void)
3800 rcu_bootup_announce();
3801 rcu_init_geometry();
3802 rcu_init_one(&rcu_bh_state, &rcu_bh_data);
3803 rcu_init_one(&rcu_sched_state, &rcu_sched_data);
3804 __rcu_init_preempt();
3805 open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
3808 * We don't need protection against CPU-hotplug here because
3809 * this is called early in boot, before either interrupts
3810 * or the scheduler are operational.
3812 cpu_notifier(rcu_cpu_notify, 0);
3813 pm_notifier(rcu_pm_notify, 0);
3814 for_each_online_cpu(cpu)
3815 rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)cpu);
3817 rcu_early_boot_tests();
3820 #include "tree_plugin.h"