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, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
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 <asm/atomic.h>
40 #include <linux/bitops.h>
41 #include <linux/module.h>
42 #include <linux/completion.h>
43 #include <linux/moduleparam.h>
44 #include <linux/percpu.h>
45 #include <linux/notifier.h>
46 #include <linux/cpu.h>
47 #include <linux/mutex.h>
48 #include <linux/time.h>
49 #include <linux/kernel_stat.h>
53 /* Data structures. */
55 static struct lock_class_key rcu_node_class[NUM_RCU_LVLS];
57 #define RCU_STATE_INITIALIZER(name) { \
58 .level = { &name.node[0] }, \
60 NUM_RCU_LVL_0, /* root of hierarchy. */ \
64 NUM_RCU_LVL_4, /* == MAX_RCU_LVLS */ \
66 .signaled = RCU_GP_IDLE, \
69 .onofflock = __RAW_SPIN_LOCK_UNLOCKED(&name.onofflock), \
70 .orphan_cbs_list = NULL, \
71 .orphan_cbs_tail = &name.orphan_cbs_list, \
73 .fqslock = __RAW_SPIN_LOCK_UNLOCKED(&name.fqslock), \
75 .n_force_qs_ngp = 0, \
78 struct rcu_state rcu_sched_state = RCU_STATE_INITIALIZER(rcu_sched_state);
79 DEFINE_PER_CPU(struct rcu_data, rcu_sched_data);
81 struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state);
82 DEFINE_PER_CPU(struct rcu_data, rcu_bh_data);
84 int rcu_scheduler_active __read_mostly;
85 EXPORT_SYMBOL_GPL(rcu_scheduler_active);
88 * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s
89 * permit this function to be invoked without holding the root rcu_node
90 * structure's ->lock, but of course results can be subject to change.
92 static int rcu_gp_in_progress(struct rcu_state *rsp)
94 return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum);
98 * Note a quiescent state. Because we do not need to know
99 * how many quiescent states passed, just if there was at least
100 * one since the start of the grace period, this just sets a flag.
102 void rcu_sched_qs(int cpu)
104 struct rcu_data *rdp = &per_cpu(rcu_sched_data, cpu);
106 rdp->passed_quiesc_completed = rdp->gpnum - 1;
108 rdp->passed_quiesc = 1;
111 void rcu_bh_qs(int cpu)
113 struct rcu_data *rdp = &per_cpu(rcu_bh_data, cpu);
115 rdp->passed_quiesc_completed = rdp->gpnum - 1;
117 rdp->passed_quiesc = 1;
121 * Note a context switch. This is a quiescent state for RCU-sched,
122 * and requires special handling for preemptible RCU.
124 void rcu_note_context_switch(int cpu)
127 rcu_preempt_note_context_switch(cpu);
131 DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = {
132 .dynticks_nesting = 1,
135 #endif /* #ifdef CONFIG_NO_HZ */
137 static int blimit = 10; /* Maximum callbacks per softirq. */
138 static int qhimark = 10000; /* If this many pending, ignore blimit. */
139 static int qlowmark = 100; /* Once only this many pending, use blimit. */
141 module_param(blimit, int, 0);
142 module_param(qhimark, int, 0);
143 module_param(qlowmark, int, 0);
145 static void force_quiescent_state(struct rcu_state *rsp, int relaxed);
146 static int rcu_pending(int cpu);
149 * Return the number of RCU-sched batches processed thus far for debug & stats.
151 long rcu_batches_completed_sched(void)
153 return rcu_sched_state.completed;
155 EXPORT_SYMBOL_GPL(rcu_batches_completed_sched);
158 * Return the number of RCU BH batches processed thus far for debug & stats.
160 long rcu_batches_completed_bh(void)
162 return rcu_bh_state.completed;
164 EXPORT_SYMBOL_GPL(rcu_batches_completed_bh);
167 * Force a quiescent state for RCU BH.
169 void rcu_bh_force_quiescent_state(void)
171 force_quiescent_state(&rcu_bh_state, 0);
173 EXPORT_SYMBOL_GPL(rcu_bh_force_quiescent_state);
176 * Force a quiescent state for RCU-sched.
178 void rcu_sched_force_quiescent_state(void)
180 force_quiescent_state(&rcu_sched_state, 0);
182 EXPORT_SYMBOL_GPL(rcu_sched_force_quiescent_state);
185 * Does the CPU have callbacks ready to be invoked?
188 cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp)
190 return &rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL];
194 * Does the current CPU require a yet-as-unscheduled grace period?
197 cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp)
199 return *rdp->nxttail[RCU_DONE_TAIL] && !rcu_gp_in_progress(rsp);
203 * Return the root node of the specified rcu_state structure.
205 static struct rcu_node *rcu_get_root(struct rcu_state *rsp)
207 return &rsp->node[0];
213 * If the specified CPU is offline, tell the caller that it is in
214 * a quiescent state. Otherwise, whack it with a reschedule IPI.
215 * Grace periods can end up waiting on an offline CPU when that
216 * CPU is in the process of coming online -- it will be added to the
217 * rcu_node bitmasks before it actually makes it online. The same thing
218 * can happen while a CPU is in the process of coming online. Because this
219 * race is quite rare, we check for it after detecting that the grace
220 * period has been delayed rather than checking each and every CPU
221 * each and every time we start a new grace period.
223 static int rcu_implicit_offline_qs(struct rcu_data *rdp)
226 * If the CPU is offline, it is in a quiescent state. We can
227 * trust its state not to change because interrupts are disabled.
229 if (cpu_is_offline(rdp->cpu)) {
234 /* If preemptable RCU, no point in sending reschedule IPI. */
235 if (rdp->preemptable)
238 /* The CPU is online, so send it a reschedule IPI. */
239 if (rdp->cpu != smp_processor_id())
240 smp_send_reschedule(rdp->cpu);
247 #endif /* #ifdef CONFIG_SMP */
252 * rcu_enter_nohz - inform RCU that current CPU is entering nohz
254 * Enter nohz mode, in other words, -leave- the mode in which RCU
255 * read-side critical sections can occur. (Though RCU read-side
256 * critical sections can occur in irq handlers in nohz mode, a possibility
257 * handled by rcu_irq_enter() and rcu_irq_exit()).
259 void rcu_enter_nohz(void)
262 struct rcu_dynticks *rdtp;
264 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
265 local_irq_save(flags);
266 rdtp = &__get_cpu_var(rcu_dynticks);
268 rdtp->dynticks_nesting--;
269 WARN_ON_ONCE(rdtp->dynticks & 0x1);
270 local_irq_restore(flags);
274 * rcu_exit_nohz - inform RCU that current CPU is leaving nohz
276 * Exit nohz mode, in other words, -enter- the mode in which RCU
277 * read-side critical sections normally occur.
279 void rcu_exit_nohz(void)
282 struct rcu_dynticks *rdtp;
284 local_irq_save(flags);
285 rdtp = &__get_cpu_var(rcu_dynticks);
287 rdtp->dynticks_nesting++;
288 WARN_ON_ONCE(!(rdtp->dynticks & 0x1));
289 local_irq_restore(flags);
290 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
294 * rcu_nmi_enter - inform RCU of entry to NMI context
296 * If the CPU was idle with dynamic ticks active, and there is no
297 * irq handler running, this updates rdtp->dynticks_nmi to let the
298 * RCU grace-period handling know that the CPU is active.
300 void rcu_nmi_enter(void)
302 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
304 if (rdtp->dynticks & 0x1)
306 rdtp->dynticks_nmi++;
307 WARN_ON_ONCE(!(rdtp->dynticks_nmi & 0x1));
308 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
312 * rcu_nmi_exit - inform RCU of exit from NMI context
314 * If the CPU was idle with dynamic ticks active, and there is no
315 * irq handler running, this updates rdtp->dynticks_nmi to let the
316 * RCU grace-period handling know that the CPU is no longer active.
318 void rcu_nmi_exit(void)
320 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
322 if (rdtp->dynticks & 0x1)
324 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
325 rdtp->dynticks_nmi++;
326 WARN_ON_ONCE(rdtp->dynticks_nmi & 0x1);
330 * rcu_irq_enter - inform RCU of entry to hard irq context
332 * If the CPU was idle with dynamic ticks active, this updates the
333 * rdtp->dynticks to let the RCU handling know that the CPU is active.
335 void rcu_irq_enter(void)
337 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
339 if (rdtp->dynticks_nesting++)
342 WARN_ON_ONCE(!(rdtp->dynticks & 0x1));
343 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
347 * rcu_irq_exit - inform RCU of exit from hard irq context
349 * If the CPU was idle with dynamic ticks active, update the rdp->dynticks
350 * to put let the RCU handling be aware that the CPU is going back to idle
353 void rcu_irq_exit(void)
355 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
357 if (--rdtp->dynticks_nesting)
359 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
361 WARN_ON_ONCE(rdtp->dynticks & 0x1);
363 /* If the interrupt queued a callback, get out of dyntick mode. */
364 if (__get_cpu_var(rcu_sched_data).nxtlist ||
365 __get_cpu_var(rcu_bh_data).nxtlist)
372 * Snapshot the specified CPU's dynticks counter so that we can later
373 * credit them with an implicit quiescent state. Return 1 if this CPU
374 * is in dynticks idle mode, which is an extended quiescent state.
376 static int dyntick_save_progress_counter(struct rcu_data *rdp)
382 snap = rdp->dynticks->dynticks;
383 snap_nmi = rdp->dynticks->dynticks_nmi;
384 smp_mb(); /* Order sampling of snap with end of grace period. */
385 rdp->dynticks_snap = snap;
386 rdp->dynticks_nmi_snap = snap_nmi;
387 ret = ((snap & 0x1) == 0) && ((snap_nmi & 0x1) == 0);
394 * Return true if the specified CPU has passed through a quiescent
395 * state by virtue of being in or having passed through an dynticks
396 * idle state since the last call to dyntick_save_progress_counter()
399 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
406 curr = rdp->dynticks->dynticks;
407 snap = rdp->dynticks_snap;
408 curr_nmi = rdp->dynticks->dynticks_nmi;
409 snap_nmi = rdp->dynticks_nmi_snap;
410 smp_mb(); /* force ordering with cpu entering/leaving dynticks. */
413 * If the CPU passed through or entered a dynticks idle phase with
414 * no active irq/NMI handlers, then we can safely pretend that the CPU
415 * already acknowledged the request to pass through a quiescent
416 * state. Either way, that CPU cannot possibly be in an RCU
417 * read-side critical section that started before the beginning
418 * of the current RCU grace period.
420 if ((curr != snap || (curr & 0x1) == 0) &&
421 (curr_nmi != snap_nmi || (curr_nmi & 0x1) == 0)) {
426 /* Go check for the CPU being offline. */
427 return rcu_implicit_offline_qs(rdp);
430 #endif /* #ifdef CONFIG_SMP */
432 #else /* #ifdef CONFIG_NO_HZ */
436 static int dyntick_save_progress_counter(struct rcu_data *rdp)
441 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
443 return rcu_implicit_offline_qs(rdp);
446 #endif /* #ifdef CONFIG_SMP */
448 #endif /* #else #ifdef CONFIG_NO_HZ */
450 #ifdef CONFIG_RCU_CPU_STALL_DETECTOR
452 int rcu_cpu_stall_panicking __read_mostly;
454 static void record_gp_stall_check_time(struct rcu_state *rsp)
456 rsp->gp_start = jiffies;
457 rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_CHECK;
460 static void print_other_cpu_stall(struct rcu_state *rsp)
465 struct rcu_node *rnp = rcu_get_root(rsp);
467 /* Only let one CPU complain about others per time interval. */
469 raw_spin_lock_irqsave(&rnp->lock, flags);
470 delta = jiffies - rsp->jiffies_stall;
471 if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) {
472 raw_spin_unlock_irqrestore(&rnp->lock, flags);
475 rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK;
478 * Now rat on any tasks that got kicked up to the root rcu_node
479 * due to CPU offlining.
481 rcu_print_task_stall(rnp);
482 raw_spin_unlock_irqrestore(&rnp->lock, flags);
484 /* OK, time to rat on our buddy... */
486 printk(KERN_ERR "INFO: RCU detected CPU stalls:");
487 rcu_for_each_leaf_node(rsp, rnp) {
488 raw_spin_lock_irqsave(&rnp->lock, flags);
489 rcu_print_task_stall(rnp);
490 raw_spin_unlock_irqrestore(&rnp->lock, flags);
491 if (rnp->qsmask == 0)
493 for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++)
494 if (rnp->qsmask & (1UL << cpu))
495 printk(" %d", rnp->grplo + cpu);
497 printk(" (detected by %d, t=%ld jiffies)\n",
498 smp_processor_id(), (long)(jiffies - rsp->gp_start));
499 trigger_all_cpu_backtrace();
501 /* If so configured, complain about tasks blocking the grace period. */
503 rcu_print_detail_task_stall(rsp);
505 force_quiescent_state(rsp, 0); /* Kick them all. */
508 static void print_cpu_stall(struct rcu_state *rsp)
511 struct rcu_node *rnp = rcu_get_root(rsp);
513 printk(KERN_ERR "INFO: RCU detected CPU %d stall (t=%lu jiffies)\n",
514 smp_processor_id(), jiffies - rsp->gp_start);
515 trigger_all_cpu_backtrace();
517 raw_spin_lock_irqsave(&rnp->lock, flags);
518 if (ULONG_CMP_GE(jiffies, rsp->jiffies_stall))
520 jiffies + RCU_SECONDS_TILL_STALL_RECHECK;
521 raw_spin_unlock_irqrestore(&rnp->lock, flags);
523 set_need_resched(); /* kick ourselves to get things going. */
526 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
529 struct rcu_node *rnp;
531 if (rcu_cpu_stall_panicking)
533 delta = jiffies - rsp->jiffies_stall;
535 if ((rnp->qsmask & rdp->grpmask) && delta >= 0) {
537 /* We haven't checked in, so go dump stack. */
538 print_cpu_stall(rsp);
540 } else if (rcu_gp_in_progress(rsp) && delta >= RCU_STALL_RAT_DELAY) {
542 /* They had two time units to dump stack, so complain. */
543 print_other_cpu_stall(rsp);
547 static int rcu_panic(struct notifier_block *this, unsigned long ev, void *ptr)
549 rcu_cpu_stall_panicking = 1;
553 static struct notifier_block rcu_panic_block = {
554 .notifier_call = rcu_panic,
557 static void __init check_cpu_stall_init(void)
559 atomic_notifier_chain_register(&panic_notifier_list, &rcu_panic_block);
562 #else /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */
564 static void record_gp_stall_check_time(struct rcu_state *rsp)
568 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
572 static void __init check_cpu_stall_init(void)
576 #endif /* #else #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */
579 * Update CPU-local rcu_data state to record the newly noticed grace period.
580 * This is used both when we started the grace period and when we notice
581 * that someone else started the grace period. The caller must hold the
582 * ->lock of the leaf rcu_node structure corresponding to the current CPU,
583 * and must have irqs disabled.
585 static void __note_new_gpnum(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
587 if (rdp->gpnum != rnp->gpnum) {
589 rdp->passed_quiesc = 0;
590 rdp->gpnum = rnp->gpnum;
594 static void note_new_gpnum(struct rcu_state *rsp, struct rcu_data *rdp)
597 struct rcu_node *rnp;
599 local_irq_save(flags);
601 if (rdp->gpnum == ACCESS_ONCE(rnp->gpnum) || /* outside lock. */
602 !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */
603 local_irq_restore(flags);
606 __note_new_gpnum(rsp, rnp, rdp);
607 raw_spin_unlock_irqrestore(&rnp->lock, flags);
611 * Did someone else start a new RCU grace period start since we last
612 * checked? Update local state appropriately if so. Must be called
613 * on the CPU corresponding to rdp.
616 check_for_new_grace_period(struct rcu_state *rsp, struct rcu_data *rdp)
621 local_irq_save(flags);
622 if (rdp->gpnum != rsp->gpnum) {
623 note_new_gpnum(rsp, rdp);
626 local_irq_restore(flags);
631 * Advance this CPU's callbacks, but only if the current grace period
632 * has ended. This may be called only from the CPU to whom the rdp
633 * belongs. In addition, the corresponding leaf rcu_node structure's
634 * ->lock must be held by the caller, with irqs disabled.
637 __rcu_process_gp_end(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
639 /* Did another grace period end? */
640 if (rdp->completed != rnp->completed) {
642 /* Advance callbacks. No harm if list empty. */
643 rdp->nxttail[RCU_DONE_TAIL] = rdp->nxttail[RCU_WAIT_TAIL];
644 rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_READY_TAIL];
645 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
647 /* Remember that we saw this grace-period completion. */
648 rdp->completed = rnp->completed;
653 * Advance this CPU's callbacks, but only if the current grace period
654 * has ended. This may be called only from the CPU to whom the rdp
658 rcu_process_gp_end(struct rcu_state *rsp, struct rcu_data *rdp)
661 struct rcu_node *rnp;
663 local_irq_save(flags);
665 if (rdp->completed == ACCESS_ONCE(rnp->completed) || /* outside lock. */
666 !raw_spin_trylock(&rnp->lock)) { /* irqs already off, so later. */
667 local_irq_restore(flags);
670 __rcu_process_gp_end(rsp, rnp, rdp);
671 raw_spin_unlock_irqrestore(&rnp->lock, flags);
675 * Do per-CPU grace-period initialization for running CPU. The caller
676 * must hold the lock of the leaf rcu_node structure corresponding to
680 rcu_start_gp_per_cpu(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
682 /* Prior grace period ended, so advance callbacks for current CPU. */
683 __rcu_process_gp_end(rsp, rnp, rdp);
686 * Because this CPU just now started the new grace period, we know
687 * that all of its callbacks will be covered by this upcoming grace
688 * period, even the ones that were registered arbitrarily recently.
689 * Therefore, advance all outstanding callbacks to RCU_WAIT_TAIL.
691 * Other CPUs cannot be sure exactly when the grace period started.
692 * Therefore, their recently registered callbacks must pass through
693 * an additional RCU_NEXT_READY stage, so that they will be handled
694 * by the next RCU grace period.
696 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
697 rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
699 /* Set state so that this CPU will detect the next quiescent state. */
700 __note_new_gpnum(rsp, rnp, rdp);
704 * Start a new RCU grace period if warranted, re-initializing the hierarchy
705 * in preparation for detecting the next grace period. The caller must hold
706 * the root node's ->lock, which is released before return. Hard irqs must
710 rcu_start_gp(struct rcu_state *rsp, unsigned long flags)
711 __releases(rcu_get_root(rsp)->lock)
713 struct rcu_data *rdp = rsp->rda[smp_processor_id()];
714 struct rcu_node *rnp = rcu_get_root(rsp);
716 if (!cpu_needs_another_gp(rsp, rdp) || rsp->fqs_active) {
717 if (cpu_needs_another_gp(rsp, rdp))
718 rsp->fqs_need_gp = 1;
719 if (rnp->completed == rsp->completed) {
720 raw_spin_unlock_irqrestore(&rnp->lock, flags);
723 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
726 * Propagate new ->completed value to rcu_node structures
727 * so that other CPUs don't have to wait until the start
728 * of the next grace period to process their callbacks.
730 rcu_for_each_node_breadth_first(rsp, rnp) {
731 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
732 rnp->completed = rsp->completed;
733 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
735 local_irq_restore(flags);
739 /* Advance to a new grace period and initialize state. */
741 WARN_ON_ONCE(rsp->signaled == RCU_GP_INIT);
742 rsp->signaled = RCU_GP_INIT; /* Hold off force_quiescent_state. */
743 rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS;
744 record_gp_stall_check_time(rsp);
746 /* Special-case the common single-level case. */
747 if (NUM_RCU_NODES == 1) {
748 rcu_preempt_check_blocked_tasks(rnp);
749 rnp->qsmask = rnp->qsmaskinit;
750 rnp->gpnum = rsp->gpnum;
751 rnp->completed = rsp->completed;
752 rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state OK. */
753 rcu_start_gp_per_cpu(rsp, rnp, rdp);
754 raw_spin_unlock_irqrestore(&rnp->lock, flags);
758 raw_spin_unlock(&rnp->lock); /* leave irqs disabled. */
761 /* Exclude any concurrent CPU-hotplug operations. */
762 raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */
765 * Set the quiescent-state-needed bits in all the rcu_node
766 * structures for all currently online CPUs in breadth-first
767 * order, starting from the root rcu_node structure. This
768 * operation relies on the layout of the hierarchy within the
769 * rsp->node[] array. Note that other CPUs will access only
770 * the leaves of the hierarchy, which still indicate that no
771 * grace period is in progress, at least until the corresponding
772 * leaf node has been initialized. In addition, we have excluded
773 * CPU-hotplug operations.
775 * Note that the grace period cannot complete until we finish
776 * the initialization process, as there will be at least one
777 * qsmask bit set in the root node until that time, namely the
778 * one corresponding to this CPU, due to the fact that we have
781 rcu_for_each_node_breadth_first(rsp, rnp) {
782 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
783 rcu_preempt_check_blocked_tasks(rnp);
784 rnp->qsmask = rnp->qsmaskinit;
785 rnp->gpnum = rsp->gpnum;
786 rnp->completed = rsp->completed;
787 if (rnp == rdp->mynode)
788 rcu_start_gp_per_cpu(rsp, rnp, rdp);
789 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
792 rnp = rcu_get_root(rsp);
793 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
794 rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state now OK. */
795 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
796 raw_spin_unlock_irqrestore(&rsp->onofflock, flags);
800 * Report a full set of quiescent states to the specified rcu_state
801 * data structure. This involves cleaning up after the prior grace
802 * period and letting rcu_start_gp() start up the next grace period
803 * if one is needed. Note that the caller must hold rnp->lock, as
804 * required by rcu_start_gp(), which will release it.
806 static void rcu_report_qs_rsp(struct rcu_state *rsp, unsigned long flags)
807 __releases(rcu_get_root(rsp)->lock)
809 WARN_ON_ONCE(!rcu_gp_in_progress(rsp));
810 rsp->completed = rsp->gpnum;
811 rsp->signaled = RCU_GP_IDLE;
812 rcu_start_gp(rsp, flags); /* releases root node's rnp->lock. */
816 * Similar to rcu_report_qs_rdp(), for which it is a helper function.
817 * Allows quiescent states for a group of CPUs to be reported at one go
818 * to the specified rcu_node structure, though all the CPUs in the group
819 * must be represented by the same rcu_node structure (which need not be
820 * a leaf rcu_node structure, though it often will be). That structure's
821 * lock must be held upon entry, and it is released before return.
824 rcu_report_qs_rnp(unsigned long mask, struct rcu_state *rsp,
825 struct rcu_node *rnp, unsigned long flags)
826 __releases(rnp->lock)
828 struct rcu_node *rnp_c;
830 /* Walk up the rcu_node hierarchy. */
832 if (!(rnp->qsmask & mask)) {
834 /* Our bit has already been cleared, so done. */
835 raw_spin_unlock_irqrestore(&rnp->lock, flags);
838 rnp->qsmask &= ~mask;
839 if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) {
841 /* Other bits still set at this level, so done. */
842 raw_spin_unlock_irqrestore(&rnp->lock, flags);
846 if (rnp->parent == NULL) {
848 /* No more levels. Exit loop holding root lock. */
852 raw_spin_unlock_irqrestore(&rnp->lock, flags);
855 raw_spin_lock_irqsave(&rnp->lock, flags);
856 WARN_ON_ONCE(rnp_c->qsmask);
860 * Get here if we are the last CPU to pass through a quiescent
861 * state for this grace period. Invoke rcu_report_qs_rsp()
862 * to clean up and start the next grace period if one is needed.
864 rcu_report_qs_rsp(rsp, flags); /* releases rnp->lock. */
868 * Record a quiescent state for the specified CPU to that CPU's rcu_data
869 * structure. This must be either called from the specified CPU, or
870 * called when the specified CPU is known to be offline (and when it is
871 * also known that no other CPU is concurrently trying to help the offline
872 * CPU). The lastcomp argument is used to make sure we are still in the
873 * grace period of interest. We don't want to end the current grace period
874 * based on quiescent states detected in an earlier grace period!
877 rcu_report_qs_rdp(int cpu, struct rcu_state *rsp, struct rcu_data *rdp, long lastcomp)
881 struct rcu_node *rnp;
884 raw_spin_lock_irqsave(&rnp->lock, flags);
885 if (lastcomp != rnp->completed) {
888 * Someone beat us to it for this grace period, so leave.
889 * The race with GP start is resolved by the fact that we
890 * hold the leaf rcu_node lock, so that the per-CPU bits
891 * cannot yet be initialized -- so we would simply find our
892 * CPU's bit already cleared in rcu_report_qs_rnp() if this
895 rdp->passed_quiesc = 0; /* try again later! */
896 raw_spin_unlock_irqrestore(&rnp->lock, flags);
900 if ((rnp->qsmask & mask) == 0) {
901 raw_spin_unlock_irqrestore(&rnp->lock, flags);
906 * This GP can't end until cpu checks in, so all of our
907 * callbacks can be processed during the next GP.
909 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
911 rcu_report_qs_rnp(mask, rsp, rnp, flags); /* rlses rnp->lock */
916 * Check to see if there is a new grace period of which this CPU
917 * is not yet aware, and if so, set up local rcu_data state for it.
918 * Otherwise, see if this CPU has just passed through its first
919 * quiescent state for this grace period, and record that fact if so.
922 rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp)
924 /* If there is now a new grace period, record and return. */
925 if (check_for_new_grace_period(rsp, rdp))
929 * Does this CPU still need to do its part for current grace period?
930 * If no, return and let the other CPUs do their part as well.
932 if (!rdp->qs_pending)
936 * Was there a quiescent state since the beginning of the grace
937 * period? If no, then exit and wait for the next call.
939 if (!rdp->passed_quiesc)
943 * Tell RCU we are done (but rcu_report_qs_rdp() will be the
946 rcu_report_qs_rdp(rdp->cpu, rsp, rdp, rdp->passed_quiesc_completed);
949 #ifdef CONFIG_HOTPLUG_CPU
952 * Move a dying CPU's RCU callbacks to the ->orphan_cbs_list for the
953 * specified flavor of RCU. The callbacks will be adopted by the next
954 * _rcu_barrier() invocation or by the CPU_DEAD notifier, whichever
955 * comes first. Because this is invoked from the CPU_DYING notifier,
956 * irqs are already disabled.
958 static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp)
961 struct rcu_data *rdp = rsp->rda[smp_processor_id()];
963 if (rdp->nxtlist == NULL)
964 return; /* irqs disabled, so comparison is stable. */
965 raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */
966 *rsp->orphan_cbs_tail = rdp->nxtlist;
967 rsp->orphan_cbs_tail = rdp->nxttail[RCU_NEXT_TAIL];
969 for (i = 0; i < RCU_NEXT_SIZE; i++)
970 rdp->nxttail[i] = &rdp->nxtlist;
971 rsp->orphan_qlen += rdp->qlen;
973 raw_spin_unlock(&rsp->onofflock); /* irqs remain disabled. */
977 * Adopt previously orphaned RCU callbacks.
979 static void rcu_adopt_orphan_cbs(struct rcu_state *rsp)
982 struct rcu_data *rdp;
984 raw_spin_lock_irqsave(&rsp->onofflock, flags);
985 rdp = rsp->rda[smp_processor_id()];
986 if (rsp->orphan_cbs_list == NULL) {
987 raw_spin_unlock_irqrestore(&rsp->onofflock, flags);
990 *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_list;
991 rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_tail;
992 rdp->qlen += rsp->orphan_qlen;
993 rsp->orphan_cbs_list = NULL;
994 rsp->orphan_cbs_tail = &rsp->orphan_cbs_list;
995 rsp->orphan_qlen = 0;
996 raw_spin_unlock_irqrestore(&rsp->onofflock, flags);
1000 * Remove the outgoing CPU from the bitmasks in the rcu_node hierarchy
1001 * and move all callbacks from the outgoing CPU to the current one.
1003 static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp)
1005 unsigned long flags;
1007 int need_report = 0;
1008 struct rcu_data *rdp = rsp->rda[cpu];
1009 struct rcu_node *rnp;
1011 /* Exclude any attempts to start a new grace period. */
1012 raw_spin_lock_irqsave(&rsp->onofflock, flags);
1014 /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */
1015 rnp = rdp->mynode; /* this is the outgoing CPU's rnp. */
1016 mask = rdp->grpmask; /* rnp->grplo is constant. */
1018 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
1019 rnp->qsmaskinit &= ~mask;
1020 if (rnp->qsmaskinit != 0) {
1021 if (rnp != rdp->mynode)
1022 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
1025 if (rnp == rdp->mynode)
1026 need_report = rcu_preempt_offline_tasks(rsp, rnp, rdp);
1028 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
1029 mask = rnp->grpmask;
1031 } while (rnp != NULL);
1034 * We still hold the leaf rcu_node structure lock here, and
1035 * irqs are still disabled. The reason for this subterfuge is
1036 * because invoking rcu_report_unblock_qs_rnp() with ->onofflock
1037 * held leads to deadlock.
1039 raw_spin_unlock(&rsp->onofflock); /* irqs remain disabled. */
1041 if (need_report & RCU_OFL_TASKS_NORM_GP)
1042 rcu_report_unblock_qs_rnp(rnp, flags);
1044 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1045 if (need_report & RCU_OFL_TASKS_EXP_GP)
1046 rcu_report_exp_rnp(rsp, rnp);
1048 rcu_adopt_orphan_cbs(rsp);
1052 * Remove the specified CPU from the RCU hierarchy and move any pending
1053 * callbacks that it might have to the current CPU. This code assumes
1054 * that at least one CPU in the system will remain running at all times.
1055 * Any attempt to offline -all- CPUs is likely to strand RCU callbacks.
1057 static void rcu_offline_cpu(int cpu)
1059 __rcu_offline_cpu(cpu, &rcu_sched_state);
1060 __rcu_offline_cpu(cpu, &rcu_bh_state);
1061 rcu_preempt_offline_cpu(cpu);
1064 #else /* #ifdef CONFIG_HOTPLUG_CPU */
1066 static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp)
1070 static void rcu_adopt_orphan_cbs(struct rcu_state *rsp)
1074 static void rcu_offline_cpu(int cpu)
1078 #endif /* #else #ifdef CONFIG_HOTPLUG_CPU */
1081 * Invoke any RCU callbacks that have made it to the end of their grace
1082 * period. Thottle as specified by rdp->blimit.
1084 static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
1086 unsigned long flags;
1087 struct rcu_head *next, *list, **tail;
1090 /* If no callbacks are ready, just return.*/
1091 if (!cpu_has_callbacks_ready_to_invoke(rdp))
1095 * Extract the list of ready callbacks, disabling to prevent
1096 * races with call_rcu() from interrupt handlers.
1098 local_irq_save(flags);
1099 list = rdp->nxtlist;
1100 rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL];
1101 *rdp->nxttail[RCU_DONE_TAIL] = NULL;
1102 tail = rdp->nxttail[RCU_DONE_TAIL];
1103 for (count = RCU_NEXT_SIZE - 1; count >= 0; count--)
1104 if (rdp->nxttail[count] == rdp->nxttail[RCU_DONE_TAIL])
1105 rdp->nxttail[count] = &rdp->nxtlist;
1106 local_irq_restore(flags);
1108 /* Invoke callbacks. */
1115 if (++count >= rdp->blimit)
1119 local_irq_save(flags);
1121 /* Update count, and requeue any remaining callbacks. */
1124 *tail = rdp->nxtlist;
1125 rdp->nxtlist = list;
1126 for (count = 0; count < RCU_NEXT_SIZE; count++)
1127 if (&rdp->nxtlist == rdp->nxttail[count])
1128 rdp->nxttail[count] = tail;
1133 /* Reinstate batch limit if we have worked down the excess. */
1134 if (rdp->blimit == LONG_MAX && rdp->qlen <= qlowmark)
1135 rdp->blimit = blimit;
1137 /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */
1138 if (rdp->qlen == 0 && rdp->qlen_last_fqs_check != 0) {
1139 rdp->qlen_last_fqs_check = 0;
1140 rdp->n_force_qs_snap = rsp->n_force_qs;
1141 } else if (rdp->qlen < rdp->qlen_last_fqs_check - qhimark)
1142 rdp->qlen_last_fqs_check = rdp->qlen;
1144 local_irq_restore(flags);
1146 /* Re-raise the RCU softirq if there are callbacks remaining. */
1147 if (cpu_has_callbacks_ready_to_invoke(rdp))
1148 raise_softirq(RCU_SOFTIRQ);
1152 * Check to see if this CPU is in a non-context-switch quiescent state
1153 * (user mode or idle loop for rcu, non-softirq execution for rcu_bh).
1154 * Also schedule the RCU softirq handler.
1156 * This function must be called with hardirqs disabled. It is normally
1157 * invoked from the scheduling-clock interrupt. If rcu_pending returns
1158 * false, there is no point in invoking rcu_check_callbacks().
1160 void rcu_check_callbacks(int cpu, int user)
1162 if (!rcu_pending(cpu))
1163 return; /* if nothing for RCU to do. */
1165 (idle_cpu(cpu) && rcu_scheduler_active &&
1166 !in_softirq() && hardirq_count() <= (1 << HARDIRQ_SHIFT))) {
1169 * Get here if this CPU took its interrupt from user
1170 * mode or from the idle loop, and if this is not a
1171 * nested interrupt. In this case, the CPU is in
1172 * a quiescent state, so note it.
1174 * No memory barrier is required here because both
1175 * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local
1176 * variables that other CPUs neither access nor modify,
1177 * at least not while the corresponding CPU is online.
1183 } else if (!in_softirq()) {
1186 * Get here if this CPU did not take its interrupt from
1187 * softirq, in other words, if it is not interrupting
1188 * a rcu_bh read-side critical section. This is an _bh
1189 * critical section, so note it.
1194 rcu_preempt_check_callbacks(cpu);
1195 raise_softirq(RCU_SOFTIRQ);
1201 * Scan the leaf rcu_node structures, processing dyntick state for any that
1202 * have not yet encountered a quiescent state, using the function specified.
1203 * The caller must have suppressed start of new grace periods.
1205 static void force_qs_rnp(struct rcu_state *rsp, int (*f)(struct rcu_data *))
1209 unsigned long flags;
1211 struct rcu_node *rnp;
1213 rcu_for_each_leaf_node(rsp, rnp) {
1215 raw_spin_lock_irqsave(&rnp->lock, flags);
1216 if (!rcu_gp_in_progress(rsp)) {
1217 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1220 if (rnp->qsmask == 0) {
1221 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1226 for (; cpu <= rnp->grphi; cpu++, bit <<= 1) {
1227 if ((rnp->qsmask & bit) != 0 && f(rsp->rda[cpu]))
1232 /* rcu_report_qs_rnp() releases rnp->lock. */
1233 rcu_report_qs_rnp(mask, rsp, rnp, flags);
1236 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1241 * Force quiescent states on reluctant CPUs, and also detect which
1242 * CPUs are in dyntick-idle mode.
1244 static void force_quiescent_state(struct rcu_state *rsp, int relaxed)
1246 unsigned long flags;
1247 struct rcu_node *rnp = rcu_get_root(rsp);
1249 if (!rcu_gp_in_progress(rsp))
1250 return; /* No grace period in progress, nothing to force. */
1251 if (!raw_spin_trylock_irqsave(&rsp->fqslock, flags)) {
1252 rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */
1253 return; /* Someone else is already on the job. */
1255 if (relaxed && ULONG_CMP_GE(rsp->jiffies_force_qs, jiffies))
1256 goto unlock_fqs_ret; /* no emergency and done recently. */
1258 raw_spin_lock(&rnp->lock); /* irqs already disabled */
1259 rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS;
1260 if(!rcu_gp_in_progress(rsp)) {
1261 rsp->n_force_qs_ngp++;
1262 raw_spin_unlock(&rnp->lock); /* irqs remain disabled */
1263 goto unlock_fqs_ret; /* no GP in progress, time updated. */
1265 rsp->fqs_active = 1;
1266 switch (rsp->signaled) {
1270 break; /* grace period idle or initializing, ignore. */
1272 case RCU_SAVE_DYNTICK:
1273 if (RCU_SIGNAL_INIT != RCU_SAVE_DYNTICK)
1274 break; /* So gcc recognizes the dead code. */
1276 raw_spin_unlock(&rnp->lock); /* irqs remain disabled */
1278 /* Record dyntick-idle state. */
1279 force_qs_rnp(rsp, dyntick_save_progress_counter);
1280 raw_spin_lock(&rnp->lock); /* irqs already disabled */
1281 if (rcu_gp_in_progress(rsp))
1282 rsp->signaled = RCU_FORCE_QS;
1287 /* Check dyntick-idle state, send IPI to laggarts. */
1288 raw_spin_unlock(&rnp->lock); /* irqs remain disabled */
1289 force_qs_rnp(rsp, rcu_implicit_dynticks_qs);
1291 /* Leave state in case more forcing is required. */
1293 raw_spin_lock(&rnp->lock); /* irqs already disabled */
1296 rsp->fqs_active = 0;
1297 if (rsp->fqs_need_gp) {
1298 raw_spin_unlock(&rsp->fqslock); /* irqs remain disabled */
1299 rsp->fqs_need_gp = 0;
1300 rcu_start_gp(rsp, flags); /* releases rnp->lock */
1303 raw_spin_unlock(&rnp->lock); /* irqs remain disabled */
1305 raw_spin_unlock_irqrestore(&rsp->fqslock, flags);
1308 #else /* #ifdef CONFIG_SMP */
1310 static void force_quiescent_state(struct rcu_state *rsp, int relaxed)
1315 #endif /* #else #ifdef CONFIG_SMP */
1318 * This does the RCU processing work from softirq context for the
1319 * specified rcu_state and rcu_data structures. This may be called
1320 * only from the CPU to whom the rdp belongs.
1323 __rcu_process_callbacks(struct rcu_state *rsp, struct rcu_data *rdp)
1325 unsigned long flags;
1327 WARN_ON_ONCE(rdp->beenonline == 0);
1330 * If an RCU GP has gone long enough, go check for dyntick
1331 * idle CPUs and, if needed, send resched IPIs.
1333 if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies))
1334 force_quiescent_state(rsp, 1);
1337 * Advance callbacks in response to end of earlier grace
1338 * period that some other CPU ended.
1340 rcu_process_gp_end(rsp, rdp);
1342 /* Update RCU state based on any recent quiescent states. */
1343 rcu_check_quiescent_state(rsp, rdp);
1345 /* Does this CPU require a not-yet-started grace period? */
1346 if (cpu_needs_another_gp(rsp, rdp)) {
1347 raw_spin_lock_irqsave(&rcu_get_root(rsp)->lock, flags);
1348 rcu_start_gp(rsp, flags); /* releases above lock */
1351 /* If there are callbacks ready, invoke them. */
1352 rcu_do_batch(rsp, rdp);
1356 * Do softirq processing for the current CPU.
1358 static void rcu_process_callbacks(struct softirq_action *unused)
1361 * Memory references from any prior RCU read-side critical sections
1362 * executed by the interrupted code must be seen before any RCU
1363 * grace-period manipulations below.
1365 smp_mb(); /* See above block comment. */
1367 __rcu_process_callbacks(&rcu_sched_state,
1368 &__get_cpu_var(rcu_sched_data));
1369 __rcu_process_callbacks(&rcu_bh_state, &__get_cpu_var(rcu_bh_data));
1370 rcu_preempt_process_callbacks();
1373 * Memory references from any later RCU read-side critical sections
1374 * executed by the interrupted code must be seen after any RCU
1375 * grace-period manipulations above.
1377 smp_mb(); /* See above block comment. */
1379 /* If we are last CPU on way to dyntick-idle mode, accelerate it. */
1380 rcu_needs_cpu_flush();
1384 __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu),
1385 struct rcu_state *rsp)
1387 unsigned long flags;
1388 struct rcu_data *rdp;
1393 smp_mb(); /* Ensure RCU update seen before callback registry. */
1396 * Opportunistically note grace-period endings and beginnings.
1397 * Note that we might see a beginning right after we see an
1398 * end, but never vice versa, since this CPU has to pass through
1399 * a quiescent state betweentimes.
1401 local_irq_save(flags);
1402 rdp = rsp->rda[smp_processor_id()];
1403 rcu_process_gp_end(rsp, rdp);
1404 check_for_new_grace_period(rsp, rdp);
1406 /* Add the callback to our list. */
1407 *rdp->nxttail[RCU_NEXT_TAIL] = head;
1408 rdp->nxttail[RCU_NEXT_TAIL] = &head->next;
1410 /* Start a new grace period if one not already started. */
1411 if (!rcu_gp_in_progress(rsp)) {
1412 unsigned long nestflag;
1413 struct rcu_node *rnp_root = rcu_get_root(rsp);
1415 raw_spin_lock_irqsave(&rnp_root->lock, nestflag);
1416 rcu_start_gp(rsp, nestflag); /* releases rnp_root->lock. */
1420 * Force the grace period if too many callbacks or too long waiting.
1421 * Enforce hysteresis, and don't invoke force_quiescent_state()
1422 * if some other CPU has recently done so. Also, don't bother
1423 * invoking force_quiescent_state() if the newly enqueued callback
1424 * is the only one waiting for a grace period to complete.
1426 if (unlikely(++rdp->qlen > rdp->qlen_last_fqs_check + qhimark)) {
1427 rdp->blimit = LONG_MAX;
1428 if (rsp->n_force_qs == rdp->n_force_qs_snap &&
1429 *rdp->nxttail[RCU_DONE_TAIL] != head)
1430 force_quiescent_state(rsp, 0);
1431 rdp->n_force_qs_snap = rsp->n_force_qs;
1432 rdp->qlen_last_fqs_check = rdp->qlen;
1433 } else if (ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies))
1434 force_quiescent_state(rsp, 1);
1435 local_irq_restore(flags);
1439 * Queue an RCU-sched callback for invocation after a grace period.
1441 void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
1443 __call_rcu(head, func, &rcu_sched_state);
1445 EXPORT_SYMBOL_GPL(call_rcu_sched);
1448 * Queue an RCU for invocation after a quicker grace period.
1450 void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
1452 __call_rcu(head, func, &rcu_bh_state);
1454 EXPORT_SYMBOL_GPL(call_rcu_bh);
1457 * synchronize_sched - wait until an rcu-sched grace period has elapsed.
1459 * Control will return to the caller some time after a full rcu-sched
1460 * grace period has elapsed, in other words after all currently executing
1461 * rcu-sched read-side critical sections have completed. These read-side
1462 * critical sections are delimited by rcu_read_lock_sched() and
1463 * rcu_read_unlock_sched(), and may be nested. Note that preempt_disable(),
1464 * local_irq_disable(), and so on may be used in place of
1465 * rcu_read_lock_sched().
1467 * This means that all preempt_disable code sequences, including NMI and
1468 * hardware-interrupt handlers, in progress on entry will have completed
1469 * before this primitive returns. However, this does not guarantee that
1470 * softirq handlers will have completed, since in some kernels, these
1471 * handlers can run in process context, and can block.
1473 * This primitive provides the guarantees made by the (now removed)
1474 * synchronize_kernel() API. In contrast, synchronize_rcu() only
1475 * guarantees that rcu_read_lock() sections will have completed.
1476 * In "classic RCU", these two guarantees happen to be one and
1477 * the same, but can differ in realtime RCU implementations.
1479 void synchronize_sched(void)
1481 struct rcu_synchronize rcu;
1483 if (rcu_blocking_is_gp())
1486 init_completion(&rcu.completion);
1487 /* Will wake me after RCU finished. */
1488 call_rcu_sched(&rcu.head, wakeme_after_rcu);
1490 wait_for_completion(&rcu.completion);
1492 EXPORT_SYMBOL_GPL(synchronize_sched);
1495 * synchronize_rcu_bh - wait until an rcu_bh grace period has elapsed.
1497 * Control will return to the caller some time after a full rcu_bh grace
1498 * period has elapsed, in other words after all currently executing rcu_bh
1499 * read-side critical sections have completed. RCU read-side critical
1500 * sections are delimited by rcu_read_lock_bh() and rcu_read_unlock_bh(),
1501 * and may be nested.
1503 void synchronize_rcu_bh(void)
1505 struct rcu_synchronize rcu;
1507 if (rcu_blocking_is_gp())
1510 init_completion(&rcu.completion);
1511 /* Will wake me after RCU finished. */
1512 call_rcu_bh(&rcu.head, wakeme_after_rcu);
1514 wait_for_completion(&rcu.completion);
1516 EXPORT_SYMBOL_GPL(synchronize_rcu_bh);
1519 * Check to see if there is any immediate RCU-related work to be done
1520 * by the current CPU, for the specified type of RCU, returning 1 if so.
1521 * The checks are in order of increasing expense: checks that can be
1522 * carried out against CPU-local state are performed first. However,
1523 * we must check for CPU stalls first, else we might not get a chance.
1525 static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp)
1527 struct rcu_node *rnp = rdp->mynode;
1529 rdp->n_rcu_pending++;
1531 /* Check for CPU stalls, if enabled. */
1532 check_cpu_stall(rsp, rdp);
1534 /* Is the RCU core waiting for a quiescent state from this CPU? */
1535 if (rdp->qs_pending) {
1538 * If force_quiescent_state() coming soon and this CPU
1539 * needs a quiescent state, and this is either RCU-sched
1540 * or RCU-bh, force a local reschedule.
1542 if (!rdp->preemptable &&
1543 ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs) - 1,
1546 rdp->n_rp_qs_pending++;
1550 /* Does this CPU have callbacks ready to invoke? */
1551 if (cpu_has_callbacks_ready_to_invoke(rdp)) {
1552 rdp->n_rp_cb_ready++;
1556 /* Has RCU gone idle with this CPU needing another grace period? */
1557 if (cpu_needs_another_gp(rsp, rdp)) {
1558 rdp->n_rp_cpu_needs_gp++;
1562 /* Has another RCU grace period completed? */
1563 if (ACCESS_ONCE(rnp->completed) != rdp->completed) { /* outside lock */
1564 rdp->n_rp_gp_completed++;
1568 /* Has a new RCU grace period started? */
1569 if (ACCESS_ONCE(rnp->gpnum) != rdp->gpnum) { /* outside lock */
1570 rdp->n_rp_gp_started++;
1574 /* Has an RCU GP gone long enough to send resched IPIs &c? */
1575 if (rcu_gp_in_progress(rsp) &&
1576 ULONG_CMP_LT(ACCESS_ONCE(rsp->jiffies_force_qs), jiffies)) {
1577 rdp->n_rp_need_fqs++;
1582 rdp->n_rp_need_nothing++;
1587 * Check to see if there is any immediate RCU-related work to be done
1588 * by the current CPU, returning 1 if so. This function is part of the
1589 * RCU implementation; it is -not- an exported member of the RCU API.
1591 static int rcu_pending(int cpu)
1593 return __rcu_pending(&rcu_sched_state, &per_cpu(rcu_sched_data, cpu)) ||
1594 __rcu_pending(&rcu_bh_state, &per_cpu(rcu_bh_data, cpu)) ||
1595 rcu_preempt_pending(cpu);
1599 * Check to see if any future RCU-related work will need to be done
1600 * by the current CPU, even if none need be done immediately, returning
1603 static int rcu_needs_cpu_quick_check(int cpu)
1605 /* RCU callbacks either ready or pending? */
1606 return per_cpu(rcu_sched_data, cpu).nxtlist ||
1607 per_cpu(rcu_bh_data, cpu).nxtlist ||
1608 rcu_preempt_needs_cpu(cpu);
1611 static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL};
1612 static atomic_t rcu_barrier_cpu_count;
1613 static DEFINE_MUTEX(rcu_barrier_mutex);
1614 static struct completion rcu_barrier_completion;
1616 static void rcu_barrier_callback(struct rcu_head *notused)
1618 if (atomic_dec_and_test(&rcu_barrier_cpu_count))
1619 complete(&rcu_barrier_completion);
1623 * Called with preemption disabled, and from cross-cpu IRQ context.
1625 static void rcu_barrier_func(void *type)
1627 int cpu = smp_processor_id();
1628 struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu);
1629 void (*call_rcu_func)(struct rcu_head *head,
1630 void (*func)(struct rcu_head *head));
1632 atomic_inc(&rcu_barrier_cpu_count);
1633 call_rcu_func = type;
1634 call_rcu_func(head, rcu_barrier_callback);
1638 * Orchestrate the specified type of RCU barrier, waiting for all
1639 * RCU callbacks of the specified type to complete.
1641 static void _rcu_barrier(struct rcu_state *rsp,
1642 void (*call_rcu_func)(struct rcu_head *head,
1643 void (*func)(struct rcu_head *head)))
1645 BUG_ON(in_interrupt());
1646 /* Take mutex to serialize concurrent rcu_barrier() requests. */
1647 mutex_lock(&rcu_barrier_mutex);
1648 init_completion(&rcu_barrier_completion);
1650 * Initialize rcu_barrier_cpu_count to 1, then invoke
1651 * rcu_barrier_func() on each CPU, so that each CPU also has
1652 * incremented rcu_barrier_cpu_count. Only then is it safe to
1653 * decrement rcu_barrier_cpu_count -- otherwise the first CPU
1654 * might complete its grace period before all of the other CPUs
1655 * did their increment, causing this function to return too
1658 atomic_set(&rcu_barrier_cpu_count, 1);
1659 preempt_disable(); /* stop CPU_DYING from filling orphan_cbs_list */
1660 rcu_adopt_orphan_cbs(rsp);
1661 on_each_cpu(rcu_barrier_func, (void *)call_rcu_func, 1);
1662 preempt_enable(); /* CPU_DYING can again fill orphan_cbs_list */
1663 if (atomic_dec_and_test(&rcu_barrier_cpu_count))
1664 complete(&rcu_barrier_completion);
1665 wait_for_completion(&rcu_barrier_completion);
1666 mutex_unlock(&rcu_barrier_mutex);
1670 * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete.
1672 void rcu_barrier_bh(void)
1674 _rcu_barrier(&rcu_bh_state, call_rcu_bh);
1676 EXPORT_SYMBOL_GPL(rcu_barrier_bh);
1679 * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks.
1681 void rcu_barrier_sched(void)
1683 _rcu_barrier(&rcu_sched_state, call_rcu_sched);
1685 EXPORT_SYMBOL_GPL(rcu_barrier_sched);
1688 * Do boot-time initialization of a CPU's per-CPU RCU data.
1691 rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp)
1693 unsigned long flags;
1695 struct rcu_data *rdp = rsp->rda[cpu];
1696 struct rcu_node *rnp = rcu_get_root(rsp);
1698 /* Set up local state, ensuring consistent view of global state. */
1699 raw_spin_lock_irqsave(&rnp->lock, flags);
1700 rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo);
1701 rdp->nxtlist = NULL;
1702 for (i = 0; i < RCU_NEXT_SIZE; i++)
1703 rdp->nxttail[i] = &rdp->nxtlist;
1706 rdp->dynticks = &per_cpu(rcu_dynticks, cpu);
1707 #endif /* #ifdef CONFIG_NO_HZ */
1709 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1713 * Initialize a CPU's per-CPU RCU data. Note that only one online or
1714 * offline event can be happening at a given time. Note also that we
1715 * can accept some slop in the rsp->completed access due to the fact
1716 * that this CPU cannot possibly have any RCU callbacks in flight yet.
1718 static void __cpuinit
1719 rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable)
1721 unsigned long flags;
1723 struct rcu_data *rdp = rsp->rda[cpu];
1724 struct rcu_node *rnp = rcu_get_root(rsp);
1726 /* Set up local state, ensuring consistent view of global state. */
1727 raw_spin_lock_irqsave(&rnp->lock, flags);
1728 rdp->passed_quiesc = 0; /* We could be racing with new GP, */
1729 rdp->qs_pending = 1; /* so set up to respond to current GP. */
1730 rdp->beenonline = 1; /* We have now been online. */
1731 rdp->preemptable = preemptable;
1732 rdp->qlen_last_fqs_check = 0;
1733 rdp->n_force_qs_snap = rsp->n_force_qs;
1734 rdp->blimit = blimit;
1735 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
1738 * A new grace period might start here. If so, we won't be part
1739 * of it, but that is OK, as we are currently in a quiescent state.
1742 /* Exclude any attempts to start a new GP on large systems. */
1743 raw_spin_lock(&rsp->onofflock); /* irqs already disabled. */
1745 /* Add CPU to rcu_node bitmasks. */
1747 mask = rdp->grpmask;
1749 /* Exclude any attempts to start a new GP on small systems. */
1750 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
1751 rnp->qsmaskinit |= mask;
1752 mask = rnp->grpmask;
1753 if (rnp == rdp->mynode) {
1754 rdp->gpnum = rnp->completed; /* if GP in progress... */
1755 rdp->completed = rnp->completed;
1756 rdp->passed_quiesc_completed = rnp->completed - 1;
1758 raw_spin_unlock(&rnp->lock); /* irqs already disabled. */
1760 } while (rnp != NULL && !(rnp->qsmaskinit & mask));
1762 raw_spin_unlock_irqrestore(&rsp->onofflock, flags);
1765 static void __cpuinit rcu_online_cpu(int cpu)
1767 rcu_init_percpu_data(cpu, &rcu_sched_state, 0);
1768 rcu_init_percpu_data(cpu, &rcu_bh_state, 0);
1769 rcu_preempt_init_percpu_data(cpu);
1773 * Handle CPU online/offline notification events.
1775 static int __cpuinit rcu_cpu_notify(struct notifier_block *self,
1776 unsigned long action, void *hcpu)
1778 long cpu = (long)hcpu;
1781 case CPU_UP_PREPARE:
1782 case CPU_UP_PREPARE_FROZEN:
1783 rcu_online_cpu(cpu);
1786 case CPU_DYING_FROZEN:
1788 * preempt_disable() in _rcu_barrier() prevents stop_machine(),
1789 * so when "on_each_cpu(rcu_barrier_func, (void *)type, 1);"
1790 * returns, all online cpus have queued rcu_barrier_func().
1791 * The dying CPU clears its cpu_online_mask bit and
1792 * moves all of its RCU callbacks to ->orphan_cbs_list
1793 * in the context of stop_machine(), so subsequent calls
1794 * to _rcu_barrier() will adopt these callbacks and only
1795 * then queue rcu_barrier_func() on all remaining CPUs.
1797 rcu_send_cbs_to_orphanage(&rcu_bh_state);
1798 rcu_send_cbs_to_orphanage(&rcu_sched_state);
1799 rcu_preempt_send_cbs_to_orphanage();
1802 case CPU_DEAD_FROZEN:
1803 case CPU_UP_CANCELED:
1804 case CPU_UP_CANCELED_FROZEN:
1805 rcu_offline_cpu(cpu);
1814 * This function is invoked towards the end of the scheduler's initialization
1815 * process. Before this is called, the idle task might contain
1816 * RCU read-side critical sections (during which time, this idle
1817 * task is booting the system). After this function is called, the
1818 * idle tasks are prohibited from containing RCU read-side critical
1819 * sections. This function also enables RCU lockdep checking.
1821 void rcu_scheduler_starting(void)
1823 WARN_ON(num_online_cpus() != 1);
1824 WARN_ON(nr_context_switches() > 0);
1825 rcu_scheduler_active = 1;
1829 * Compute the per-level fanout, either using the exact fanout specified
1830 * or balancing the tree, depending on CONFIG_RCU_FANOUT_EXACT.
1832 #ifdef CONFIG_RCU_FANOUT_EXACT
1833 static void __init rcu_init_levelspread(struct rcu_state *rsp)
1837 for (i = NUM_RCU_LVLS - 1; i >= 0; i--)
1838 rsp->levelspread[i] = CONFIG_RCU_FANOUT;
1840 #else /* #ifdef CONFIG_RCU_FANOUT_EXACT */
1841 static void __init rcu_init_levelspread(struct rcu_state *rsp)
1848 for (i = NUM_RCU_LVLS - 1; i >= 0; i--) {
1849 ccur = rsp->levelcnt[i];
1850 rsp->levelspread[i] = (cprv + ccur - 1) / ccur;
1854 #endif /* #else #ifdef CONFIG_RCU_FANOUT_EXACT */
1857 * Helper function for rcu_init() that initializes one rcu_state structure.
1859 static void __init rcu_init_one(struct rcu_state *rsp)
1861 static char *buf[] = { "rcu_node_level_0",
1864 "rcu_node_level_3" }; /* Match MAX_RCU_LVLS */
1868 struct rcu_node *rnp;
1870 BUILD_BUG_ON(MAX_RCU_LVLS > ARRAY_SIZE(buf)); /* Fix buf[] init! */
1872 /* Initialize the level-tracking arrays. */
1874 for (i = 1; i < NUM_RCU_LVLS; i++)
1875 rsp->level[i] = rsp->level[i - 1] + rsp->levelcnt[i - 1];
1876 rcu_init_levelspread(rsp);
1878 /* Initialize the elements themselves, starting from the leaves. */
1880 for (i = NUM_RCU_LVLS - 1; i >= 0; i--) {
1881 cpustride *= rsp->levelspread[i];
1882 rnp = rsp->level[i];
1883 for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) {
1884 raw_spin_lock_init(&rnp->lock);
1885 lockdep_set_class_and_name(&rnp->lock,
1886 &rcu_node_class[i], buf[i]);
1889 rnp->qsmaskinit = 0;
1890 rnp->grplo = j * cpustride;
1891 rnp->grphi = (j + 1) * cpustride - 1;
1892 if (rnp->grphi >= NR_CPUS)
1893 rnp->grphi = NR_CPUS - 1;
1899 rnp->grpnum = j % rsp->levelspread[i - 1];
1900 rnp->grpmask = 1UL << rnp->grpnum;
1901 rnp->parent = rsp->level[i - 1] +
1902 j / rsp->levelspread[i - 1];
1905 INIT_LIST_HEAD(&rnp->blocked_tasks[0]);
1906 INIT_LIST_HEAD(&rnp->blocked_tasks[1]);
1907 INIT_LIST_HEAD(&rnp->blocked_tasks[2]);
1908 INIT_LIST_HEAD(&rnp->blocked_tasks[3]);
1912 rnp = rsp->level[NUM_RCU_LVLS - 1];
1913 for_each_possible_cpu(i) {
1916 rsp->rda[i]->mynode = rnp;
1917 rcu_boot_init_percpu_data(i, rsp);
1922 * Helper macro for __rcu_init() and __rcu_init_preempt(). To be used
1923 * nowhere else! Assigns leaf node pointers into each CPU's rcu_data
1926 #define RCU_INIT_FLAVOR(rsp, rcu_data) \
1930 for_each_possible_cpu(i) { \
1931 (rsp)->rda[i] = &per_cpu(rcu_data, i); \
1933 rcu_init_one(rsp); \
1936 void __init rcu_init(void)
1940 rcu_bootup_announce();
1941 RCU_INIT_FLAVOR(&rcu_sched_state, rcu_sched_data);
1942 RCU_INIT_FLAVOR(&rcu_bh_state, rcu_bh_data);
1943 __rcu_init_preempt();
1944 open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
1947 * We don't need protection against CPU-hotplug here because
1948 * this is called early in boot, before either interrupts
1949 * or the scheduler are operational.
1951 cpu_notifier(rcu_cpu_notify, 0);
1952 for_each_online_cpu(cpu)
1953 rcu_cpu_notify(NULL, CPU_UP_PREPARE, (void *)(long)cpu);
1954 check_cpu_stall_init();
1957 #include "rcutree_plugin.h"