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>
52 /* Data structures. */
54 static struct lock_class_key rcu_root_class;
56 #define RCU_STATE_INITIALIZER(name) { \
57 .level = { &name.node[0] }, \
59 NUM_RCU_LVL_0, /* root of hierarchy. */ \
62 NUM_RCU_LVL_3, /* == MAX_RCU_LVLS */ \
64 .signaled = RCU_GP_IDLE, \
67 .onofflock = __SPIN_LOCK_UNLOCKED(&name.onofflock), \
68 .orphan_cbs_list = NULL, \
69 .orphan_cbs_tail = &name.orphan_cbs_list, \
71 .fqslock = __SPIN_LOCK_UNLOCKED(&name.fqslock), \
73 .n_force_qs_ngp = 0, \
76 struct rcu_state rcu_sched_state = RCU_STATE_INITIALIZER(rcu_sched_state);
77 DEFINE_PER_CPU(struct rcu_data, rcu_sched_data);
79 struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state);
80 DEFINE_PER_CPU(struct rcu_data, rcu_bh_data);
84 * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s
85 * permit this function to be invoked without holding the root rcu_node
86 * structure's ->lock, but of course results can be subject to change.
88 static int rcu_gp_in_progress(struct rcu_state *rsp)
90 return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum);
94 * Note a quiescent state. Because we do not need to know
95 * how many quiescent states passed, just if there was at least
96 * one since the start of the grace period, this just sets a flag.
98 void rcu_sched_qs(int cpu)
100 struct rcu_data *rdp;
102 rdp = &per_cpu(rcu_sched_data, cpu);
103 rdp->passed_quiesc_completed = rdp->gpnum - 1;
105 rdp->passed_quiesc = 1;
106 rcu_preempt_note_context_switch(cpu);
109 void rcu_bh_qs(int cpu)
111 struct rcu_data *rdp;
113 rdp = &per_cpu(rcu_bh_data, cpu);
114 rdp->passed_quiesc_completed = rdp->gpnum - 1;
116 rdp->passed_quiesc = 1;
120 DEFINE_PER_CPU(struct rcu_dynticks, rcu_dynticks) = {
121 .dynticks_nesting = 1,
124 #endif /* #ifdef CONFIG_NO_HZ */
126 static int blimit = 10; /* Maximum callbacks per softirq. */
127 static int qhimark = 10000; /* If this many pending, ignore blimit. */
128 static int qlowmark = 100; /* Once only this many pending, use blimit. */
130 module_param(blimit, int, 0);
131 module_param(qhimark, int, 0);
132 module_param(qlowmark, int, 0);
134 static void force_quiescent_state(struct rcu_state *rsp, int relaxed);
135 static int rcu_pending(int cpu);
138 * Return the number of RCU-sched batches processed thus far for debug & stats.
140 long rcu_batches_completed_sched(void)
142 return rcu_sched_state.completed;
144 EXPORT_SYMBOL_GPL(rcu_batches_completed_sched);
147 * Return the number of RCU BH batches processed thus far for debug & stats.
149 long rcu_batches_completed_bh(void)
151 return rcu_bh_state.completed;
153 EXPORT_SYMBOL_GPL(rcu_batches_completed_bh);
156 * Does the CPU have callbacks ready to be invoked?
159 cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp)
161 return &rdp->nxtlist != rdp->nxttail[RCU_DONE_TAIL];
165 * Does the current CPU require a yet-as-unscheduled grace period?
168 cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp)
170 return *rdp->nxttail[RCU_DONE_TAIL] && !rcu_gp_in_progress(rsp);
174 * Return the root node of the specified rcu_state structure.
176 static struct rcu_node *rcu_get_root(struct rcu_state *rsp)
178 return &rsp->node[0];
184 * If the specified CPU is offline, tell the caller that it is in
185 * a quiescent state. Otherwise, whack it with a reschedule IPI.
186 * Grace periods can end up waiting on an offline CPU when that
187 * CPU is in the process of coming online -- it will be added to the
188 * rcu_node bitmasks before it actually makes it online. The same thing
189 * can happen while a CPU is in the process of coming online. Because this
190 * race is quite rare, we check for it after detecting that the grace
191 * period has been delayed rather than checking each and every CPU
192 * each and every time we start a new grace period.
194 static int rcu_implicit_offline_qs(struct rcu_data *rdp)
197 * If the CPU is offline, it is in a quiescent state. We can
198 * trust its state not to change because interrupts are disabled.
200 if (cpu_is_offline(rdp->cpu)) {
205 /* If preemptable RCU, no point in sending reschedule IPI. */
206 if (rdp->preemptable)
209 /* The CPU is online, so send it a reschedule IPI. */
210 if (rdp->cpu != smp_processor_id())
211 smp_send_reschedule(rdp->cpu);
218 #endif /* #ifdef CONFIG_SMP */
223 * rcu_enter_nohz - inform RCU that current CPU is entering nohz
225 * Enter nohz mode, in other words, -leave- the mode in which RCU
226 * read-side critical sections can occur. (Though RCU read-side
227 * critical sections can occur in irq handlers in nohz mode, a possibility
228 * handled by rcu_irq_enter() and rcu_irq_exit()).
230 void rcu_enter_nohz(void)
233 struct rcu_dynticks *rdtp;
235 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
236 local_irq_save(flags);
237 rdtp = &__get_cpu_var(rcu_dynticks);
239 rdtp->dynticks_nesting--;
240 WARN_ON_ONCE(rdtp->dynticks & 0x1);
241 local_irq_restore(flags);
245 * rcu_exit_nohz - inform RCU that current CPU is leaving nohz
247 * Exit nohz mode, in other words, -enter- the mode in which RCU
248 * read-side critical sections normally occur.
250 void rcu_exit_nohz(void)
253 struct rcu_dynticks *rdtp;
255 local_irq_save(flags);
256 rdtp = &__get_cpu_var(rcu_dynticks);
258 rdtp->dynticks_nesting++;
259 WARN_ON_ONCE(!(rdtp->dynticks & 0x1));
260 local_irq_restore(flags);
261 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
265 * rcu_nmi_enter - inform RCU of entry to NMI context
267 * If the CPU was idle with dynamic ticks active, and there is no
268 * irq handler running, this updates rdtp->dynticks_nmi to let the
269 * RCU grace-period handling know that the CPU is active.
271 void rcu_nmi_enter(void)
273 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
275 if (rdtp->dynticks & 0x1)
277 rdtp->dynticks_nmi++;
278 WARN_ON_ONCE(!(rdtp->dynticks_nmi & 0x1));
279 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
283 * rcu_nmi_exit - inform RCU of exit from NMI context
285 * If the CPU was idle with dynamic ticks active, and there is no
286 * irq handler running, this updates rdtp->dynticks_nmi to let the
287 * RCU grace-period handling know that the CPU is no longer active.
289 void rcu_nmi_exit(void)
291 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
293 if (rdtp->dynticks & 0x1)
295 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
296 rdtp->dynticks_nmi++;
297 WARN_ON_ONCE(rdtp->dynticks_nmi & 0x1);
301 * rcu_irq_enter - inform RCU of entry to hard irq context
303 * If the CPU was idle with dynamic ticks active, this updates the
304 * rdtp->dynticks to let the RCU handling know that the CPU is active.
306 void rcu_irq_enter(void)
308 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
310 if (rdtp->dynticks_nesting++)
313 WARN_ON_ONCE(!(rdtp->dynticks & 0x1));
314 smp_mb(); /* CPUs seeing ++ must see later RCU read-side crit sects */
318 * rcu_irq_exit - inform RCU of exit from hard irq context
320 * If the CPU was idle with dynamic ticks active, update the rdp->dynticks
321 * to put let the RCU handling be aware that the CPU is going back to idle
324 void rcu_irq_exit(void)
326 struct rcu_dynticks *rdtp = &__get_cpu_var(rcu_dynticks);
328 if (--rdtp->dynticks_nesting)
330 smp_mb(); /* CPUs seeing ++ must see prior RCU read-side crit sects */
332 WARN_ON_ONCE(rdtp->dynticks & 0x1);
334 /* If the interrupt queued a callback, get out of dyntick mode. */
335 if (__get_cpu_var(rcu_sched_data).nxtlist ||
336 __get_cpu_var(rcu_bh_data).nxtlist)
343 * Snapshot the specified CPU's dynticks counter so that we can later
344 * credit them with an implicit quiescent state. Return 1 if this CPU
345 * is in dynticks idle mode, which is an extended quiescent state.
347 static int dyntick_save_progress_counter(struct rcu_data *rdp)
353 snap = rdp->dynticks->dynticks;
354 snap_nmi = rdp->dynticks->dynticks_nmi;
355 smp_mb(); /* Order sampling of snap with end of grace period. */
356 rdp->dynticks_snap = snap;
357 rdp->dynticks_nmi_snap = snap_nmi;
358 ret = ((snap & 0x1) == 0) && ((snap_nmi & 0x1) == 0);
365 * Return true if the specified CPU has passed through a quiescent
366 * state by virtue of being in or having passed through an dynticks
367 * idle state since the last call to dyntick_save_progress_counter()
370 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
377 curr = rdp->dynticks->dynticks;
378 snap = rdp->dynticks_snap;
379 curr_nmi = rdp->dynticks->dynticks_nmi;
380 snap_nmi = rdp->dynticks_nmi_snap;
381 smp_mb(); /* force ordering with cpu entering/leaving dynticks. */
384 * If the CPU passed through or entered a dynticks idle phase with
385 * no active irq/NMI handlers, then we can safely pretend that the CPU
386 * already acknowledged the request to pass through a quiescent
387 * state. Either way, that CPU cannot possibly be in an RCU
388 * read-side critical section that started before the beginning
389 * of the current RCU grace period.
391 if ((curr != snap || (curr & 0x1) == 0) &&
392 (curr_nmi != snap_nmi || (curr_nmi & 0x1) == 0)) {
397 /* Go check for the CPU being offline. */
398 return rcu_implicit_offline_qs(rdp);
401 #endif /* #ifdef CONFIG_SMP */
403 #else /* #ifdef CONFIG_NO_HZ */
407 static int dyntick_save_progress_counter(struct rcu_data *rdp)
412 static int rcu_implicit_dynticks_qs(struct rcu_data *rdp)
414 return rcu_implicit_offline_qs(rdp);
417 #endif /* #ifdef CONFIG_SMP */
419 #endif /* #else #ifdef CONFIG_NO_HZ */
421 #ifdef CONFIG_RCU_CPU_STALL_DETECTOR
423 static void record_gp_stall_check_time(struct rcu_state *rsp)
425 rsp->gp_start = jiffies;
426 rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_CHECK;
429 static void print_other_cpu_stall(struct rcu_state *rsp)
434 struct rcu_node *rnp = rcu_get_root(rsp);
436 /* Only let one CPU complain about others per time interval. */
438 spin_lock_irqsave(&rnp->lock, flags);
439 delta = jiffies - rsp->jiffies_stall;
440 if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) {
441 spin_unlock_irqrestore(&rnp->lock, flags);
444 rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK;
447 * Now rat on any tasks that got kicked up to the root rcu_node
448 * due to CPU offlining.
450 rcu_print_task_stall(rnp);
451 spin_unlock_irqrestore(&rnp->lock, flags);
453 /* OK, time to rat on our buddy... */
455 printk(KERN_ERR "INFO: RCU detected CPU stalls:");
456 rcu_for_each_leaf_node(rsp, rnp) {
457 rcu_print_task_stall(rnp);
458 if (rnp->qsmask == 0)
460 for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++)
461 if (rnp->qsmask & (1UL << cpu))
462 printk(" %d", rnp->grplo + cpu);
464 printk(" (detected by %d, t=%ld jiffies)\n",
465 smp_processor_id(), (long)(jiffies - rsp->gp_start));
466 trigger_all_cpu_backtrace();
468 force_quiescent_state(rsp, 0); /* Kick them all. */
471 static void print_cpu_stall(struct rcu_state *rsp)
474 struct rcu_node *rnp = rcu_get_root(rsp);
476 printk(KERN_ERR "INFO: RCU detected CPU %d stall (t=%lu jiffies)\n",
477 smp_processor_id(), jiffies - rsp->gp_start);
478 trigger_all_cpu_backtrace();
480 spin_lock_irqsave(&rnp->lock, flags);
481 if ((long)(jiffies - rsp->jiffies_stall) >= 0)
483 jiffies + RCU_SECONDS_TILL_STALL_RECHECK;
484 spin_unlock_irqrestore(&rnp->lock, flags);
486 set_need_resched(); /* kick ourselves to get things going. */
489 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
492 struct rcu_node *rnp;
494 delta = jiffies - rsp->jiffies_stall;
496 if ((rnp->qsmask & rdp->grpmask) && delta >= 0) {
498 /* We haven't checked in, so go dump stack. */
499 print_cpu_stall(rsp);
501 } else if (rcu_gp_in_progress(rsp) && delta >= RCU_STALL_RAT_DELAY) {
503 /* They had two time units to dump stack, so complain. */
504 print_other_cpu_stall(rsp);
508 #else /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */
510 static void record_gp_stall_check_time(struct rcu_state *rsp)
514 static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp)
518 #endif /* #else #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */
521 * Update CPU-local rcu_data state to record the newly noticed grace period.
522 * This is used both when we started the grace period and when we notice
523 * that someone else started the grace period. The caller must hold the
524 * ->lock of the leaf rcu_node structure corresponding to the current CPU,
525 * and must have irqs disabled.
527 static void __note_new_gpnum(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
529 if (rdp->gpnum != rnp->gpnum) {
531 rdp->passed_quiesc = 0;
532 rdp->gpnum = rnp->gpnum;
536 static void note_new_gpnum(struct rcu_state *rsp, struct rcu_data *rdp)
539 struct rcu_node *rnp;
541 local_irq_save(flags);
543 if (rdp->gpnum == ACCESS_ONCE(rnp->gpnum) || /* outside lock. */
544 !spin_trylock(&rnp->lock)) { /* irqs already off, retry later. */
545 local_irq_restore(flags);
548 __note_new_gpnum(rsp, rnp, rdp);
549 spin_unlock_irqrestore(&rnp->lock, flags);
553 * Did someone else start a new RCU grace period start since we last
554 * checked? Update local state appropriately if so. Must be called
555 * on the CPU corresponding to rdp.
558 check_for_new_grace_period(struct rcu_state *rsp, struct rcu_data *rdp)
563 local_irq_save(flags);
564 if (rdp->gpnum != rsp->gpnum) {
565 note_new_gpnum(rsp, rdp);
568 local_irq_restore(flags);
573 * Advance this CPU's callbacks, but only if the current grace period
574 * has ended. This may be called only from the CPU to whom the rdp
575 * belongs. In addition, the corresponding leaf rcu_node structure's
576 * ->lock must be held by the caller, with irqs disabled.
579 __rcu_process_gp_end(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
581 /* Did another grace period end? */
582 if (rdp->completed != rnp->completed) {
584 /* Advance callbacks. No harm if list empty. */
585 rdp->nxttail[RCU_DONE_TAIL] = rdp->nxttail[RCU_WAIT_TAIL];
586 rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_READY_TAIL];
587 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
589 /* Remember that we saw this grace-period completion. */
590 rdp->completed = rnp->completed;
595 * Advance this CPU's callbacks, but only if the current grace period
596 * has ended. This may be called only from the CPU to whom the rdp
600 rcu_process_gp_end(struct rcu_state *rsp, struct rcu_data *rdp)
603 struct rcu_node *rnp;
605 local_irq_save(flags);
607 if (rdp->completed == ACCESS_ONCE(rnp->completed) || /* outside lock. */
608 !spin_trylock(&rnp->lock)) { /* irqs already off, retry later. */
609 local_irq_restore(flags);
612 __rcu_process_gp_end(rsp, rnp, rdp);
613 spin_unlock_irqrestore(&rnp->lock, flags);
617 * Do per-CPU grace-period initialization for running CPU. The caller
618 * must hold the lock of the leaf rcu_node structure corresponding to
622 rcu_start_gp_per_cpu(struct rcu_state *rsp, struct rcu_node *rnp, struct rcu_data *rdp)
624 /* Prior grace period ended, so advance callbacks for current CPU. */
625 __rcu_process_gp_end(rsp, rnp, rdp);
628 * Because this CPU just now started the new grace period, we know
629 * that all of its callbacks will be covered by this upcoming grace
630 * period, even the ones that were registered arbitrarily recently.
631 * Therefore, advance all outstanding callbacks to RCU_WAIT_TAIL.
633 * Other CPUs cannot be sure exactly when the grace period started.
634 * Therefore, their recently registered callbacks must pass through
635 * an additional RCU_NEXT_READY stage, so that they will be handled
636 * by the next RCU grace period.
638 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
639 rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
641 /* Set state so that this CPU will detect the next quiescent state. */
642 __note_new_gpnum(rsp, rnp, rdp);
646 * Start a new RCU grace period if warranted, re-initializing the hierarchy
647 * in preparation for detecting the next grace period. The caller must hold
648 * the root node's ->lock, which is released before return. Hard irqs must
652 rcu_start_gp(struct rcu_state *rsp, unsigned long flags)
653 __releases(rcu_get_root(rsp)->lock)
655 struct rcu_data *rdp = rsp->rda[smp_processor_id()];
656 struct rcu_node *rnp = rcu_get_root(rsp);
658 if (!cpu_needs_another_gp(rsp, rdp)) {
659 if (rnp->completed == rsp->completed) {
660 spin_unlock_irqrestore(&rnp->lock, flags);
663 spin_unlock(&rnp->lock); /* irqs remain disabled. */
666 * Propagate new ->completed value to rcu_node structures
667 * so that other CPUs don't have to wait until the start
668 * of the next grace period to process their callbacks.
670 rcu_for_each_node_breadth_first(rsp, rnp) {
671 spin_lock(&rnp->lock); /* irqs already disabled. */
672 rnp->completed = rsp->completed;
673 spin_unlock(&rnp->lock); /* irqs remain disabled. */
675 local_irq_restore(flags);
679 /* Advance to a new grace period and initialize state. */
681 WARN_ON_ONCE(rsp->signaled == RCU_GP_INIT);
682 rsp->signaled = RCU_GP_INIT; /* Hold off force_quiescent_state. */
683 rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS;
684 record_gp_stall_check_time(rsp);
686 /* Special-case the common single-level case. */
687 if (NUM_RCU_NODES == 1) {
688 rcu_preempt_check_blocked_tasks(rnp);
689 rnp->qsmask = rnp->qsmaskinit;
690 rnp->gpnum = rsp->gpnum;
691 rnp->completed = rsp->completed;
692 rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state OK. */
693 rcu_start_gp_per_cpu(rsp, rnp, rdp);
694 spin_unlock_irqrestore(&rnp->lock, flags);
698 spin_unlock(&rnp->lock); /* leave irqs disabled. */
701 /* Exclude any concurrent CPU-hotplug operations. */
702 spin_lock(&rsp->onofflock); /* irqs already disabled. */
705 * Set the quiescent-state-needed bits in all the rcu_node
706 * structures for all currently online CPUs in breadth-first
707 * order, starting from the root rcu_node structure. This
708 * operation relies on the layout of the hierarchy within the
709 * rsp->node[] array. Note that other CPUs will access only
710 * the leaves of the hierarchy, which still indicate that no
711 * grace period is in progress, at least until the corresponding
712 * leaf node has been initialized. In addition, we have excluded
713 * CPU-hotplug operations.
715 * Note that the grace period cannot complete until we finish
716 * the initialization process, as there will be at least one
717 * qsmask bit set in the root node until that time, namely the
718 * one corresponding to this CPU, due to the fact that we have
721 rcu_for_each_node_breadth_first(rsp, rnp) {
722 spin_lock(&rnp->lock); /* irqs already disabled. */
723 rcu_preempt_check_blocked_tasks(rnp);
724 rnp->qsmask = rnp->qsmaskinit;
725 rnp->gpnum = rsp->gpnum;
726 rnp->completed = rsp->completed;
727 if (rnp == rdp->mynode)
728 rcu_start_gp_per_cpu(rsp, rnp, rdp);
729 spin_unlock(&rnp->lock); /* irqs remain disabled. */
732 rnp = rcu_get_root(rsp);
733 spin_lock(&rnp->lock); /* irqs already disabled. */
734 rsp->signaled = RCU_SIGNAL_INIT; /* force_quiescent_state now OK. */
735 spin_unlock(&rnp->lock); /* irqs remain disabled. */
736 spin_unlock_irqrestore(&rsp->onofflock, flags);
740 * Clean up after the prior grace period and let rcu_start_gp() start up
741 * the next grace period if one is needed. Note that the caller must
742 * hold rnp->lock, as required by rcu_start_gp(), which will release it.
744 static void cpu_quiet_msk_finish(struct rcu_state *rsp, unsigned long flags)
745 __releases(rcu_get_root(rsp)->lock)
747 WARN_ON_ONCE(!rcu_gp_in_progress(rsp));
748 rsp->completed = rsp->gpnum;
749 rsp->signaled = RCU_GP_IDLE;
750 rcu_start_gp(rsp, flags); /* releases root node's rnp->lock. */
754 * Similar to cpu_quiet(), for which it is a helper function. Allows
755 * a group of CPUs to be quieted at one go, though all the CPUs in the
756 * group must be represented by the same leaf rcu_node structure.
757 * That structure's lock must be held upon entry, and it is released
761 cpu_quiet_msk(unsigned long mask, struct rcu_state *rsp, struct rcu_node *rnp,
763 __releases(rnp->lock)
765 struct rcu_node *rnp_c;
767 /* Walk up the rcu_node hierarchy. */
769 if (!(rnp->qsmask & mask)) {
771 /* Our bit has already been cleared, so done. */
772 spin_unlock_irqrestore(&rnp->lock, flags);
775 rnp->qsmask &= ~mask;
776 if (rnp->qsmask != 0 || rcu_preempted_readers(rnp)) {
778 /* Other bits still set at this level, so done. */
779 spin_unlock_irqrestore(&rnp->lock, flags);
783 if (rnp->parent == NULL) {
785 /* No more levels. Exit loop holding root lock. */
789 spin_unlock_irqrestore(&rnp->lock, flags);
792 spin_lock_irqsave(&rnp->lock, flags);
793 WARN_ON_ONCE(rnp_c->qsmask);
797 * Get here if we are the last CPU to pass through a quiescent
798 * state for this grace period. Invoke cpu_quiet_msk_finish()
799 * to clean up and start the next grace period if one is needed.
801 cpu_quiet_msk_finish(rsp, flags); /* releases rnp->lock. */
805 * Record a quiescent state for the specified CPU, which must either be
806 * the current CPU. The lastcomp argument is used to make sure we are
807 * still in the grace period of interest. We don't want to end the current
808 * grace period based on quiescent states detected in an earlier grace
812 cpu_quiet(int cpu, struct rcu_state *rsp, struct rcu_data *rdp, long lastcomp)
816 struct rcu_node *rnp;
819 spin_lock_irqsave(&rnp->lock, flags);
820 if (lastcomp != rnp->completed) {
823 * Someone beat us to it for this grace period, so leave.
824 * The race with GP start is resolved by the fact that we
825 * hold the leaf rcu_node lock, so that the per-CPU bits
826 * cannot yet be initialized -- so we would simply find our
827 * CPU's bit already cleared in cpu_quiet_msk() if this race
830 rdp->passed_quiesc = 0; /* try again later! */
831 spin_unlock_irqrestore(&rnp->lock, flags);
835 if ((rnp->qsmask & mask) == 0) {
836 spin_unlock_irqrestore(&rnp->lock, flags);
841 * This GP can't end until cpu checks in, so all of our
842 * callbacks can be processed during the next GP.
844 rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL];
846 cpu_quiet_msk(mask, rsp, rnp, flags); /* releases rnp->lock */
851 * Check to see if there is a new grace period of which this CPU
852 * is not yet aware, and if so, set up local rcu_data state for it.
853 * Otherwise, see if this CPU has just passed through its first
854 * quiescent state for this grace period, and record that fact if so.
857 rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp)
859 /* If there is now a new grace period, record and return. */
860 if (check_for_new_grace_period(rsp, rdp))
864 * Does this CPU still need to do its part for current grace period?
865 * If no, return and let the other CPUs do their part as well.
867 if (!rdp->qs_pending)
871 * Was there a quiescent state since the beginning of the grace
872 * period? If no, then exit and wait for the next call.
874 if (!rdp->passed_quiesc)
877 /* Tell RCU we are done (but cpu_quiet() will be the judge of that). */
878 cpu_quiet(rdp->cpu, rsp, rdp, rdp->passed_quiesc_completed);
881 #ifdef CONFIG_HOTPLUG_CPU
884 * Move a dying CPU's RCU callbacks to the ->orphan_cbs_list for the
885 * specified flavor of RCU. The callbacks will be adopted by the next
886 * _rcu_barrier() invocation or by the CPU_DEAD notifier, whichever
887 * comes first. Because this is invoked from the CPU_DYING notifier,
888 * irqs are already disabled.
890 static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp)
893 struct rcu_data *rdp = rsp->rda[smp_processor_id()];
895 if (rdp->nxtlist == NULL)
896 return; /* irqs disabled, so comparison is stable. */
897 spin_lock(&rsp->onofflock); /* irqs already disabled. */
898 *rsp->orphan_cbs_tail = rdp->nxtlist;
899 rsp->orphan_cbs_tail = rdp->nxttail[RCU_NEXT_TAIL];
901 for (i = 0; i < RCU_NEXT_SIZE; i++)
902 rdp->nxttail[i] = &rdp->nxtlist;
903 rsp->orphan_qlen += rdp->qlen;
905 spin_unlock(&rsp->onofflock); /* irqs remain disabled. */
909 * Adopt previously orphaned RCU callbacks.
911 static void rcu_adopt_orphan_cbs(struct rcu_state *rsp)
914 struct rcu_data *rdp;
916 spin_lock_irqsave(&rsp->onofflock, flags);
917 rdp = rsp->rda[smp_processor_id()];
918 if (rsp->orphan_cbs_list == NULL) {
919 spin_unlock_irqrestore(&rsp->onofflock, flags);
922 *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_list;
923 rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_tail;
924 rdp->qlen += rsp->orphan_qlen;
925 rsp->orphan_cbs_list = NULL;
926 rsp->orphan_cbs_tail = &rsp->orphan_cbs_list;
927 rsp->orphan_qlen = 0;
928 spin_unlock_irqrestore(&rsp->onofflock, flags);
932 * Remove the outgoing CPU from the bitmasks in the rcu_node hierarchy
933 * and move all callbacks from the outgoing CPU to the current one.
935 static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp)
939 struct rcu_data *rdp = rsp->rda[cpu];
940 struct rcu_node *rnp;
942 /* Exclude any attempts to start a new grace period. */
943 spin_lock_irqsave(&rsp->onofflock, flags);
945 /* Remove the outgoing CPU from the masks in the rcu_node hierarchy. */
946 rnp = rdp->mynode; /* this is the outgoing CPU's rnp. */
947 mask = rdp->grpmask; /* rnp->grplo is constant. */
949 spin_lock(&rnp->lock); /* irqs already disabled. */
950 rnp->qsmaskinit &= ~mask;
951 if (rnp->qsmaskinit != 0) {
952 spin_unlock(&rnp->lock); /* irqs remain disabled. */
957 * If there was a task blocking the current grace period,
958 * and if all CPUs have checked in, we need to propagate
959 * the quiescent state up the rcu_node hierarchy. But that
960 * is inconvenient at the moment due to deadlock issues if
961 * this should end the current grace period. So set the
962 * offlined CPU's bit in ->qsmask in order to force the
963 * next force_quiescent_state() invocation to clean up this
964 * mess in a deadlock-free manner.
966 if (rcu_preempt_offline_tasks(rsp, rnp, rdp) && !rnp->qsmask)
970 spin_unlock(&rnp->lock); /* irqs remain disabled. */
972 } while (rnp != NULL);
974 spin_unlock_irqrestore(&rsp->onofflock, flags);
976 rcu_adopt_orphan_cbs(rsp);
980 * Remove the specified CPU from the RCU hierarchy and move any pending
981 * callbacks that it might have to the current CPU. This code assumes
982 * that at least one CPU in the system will remain running at all times.
983 * Any attempt to offline -all- CPUs is likely to strand RCU callbacks.
985 static void rcu_offline_cpu(int cpu)
987 __rcu_offline_cpu(cpu, &rcu_sched_state);
988 __rcu_offline_cpu(cpu, &rcu_bh_state);
989 rcu_preempt_offline_cpu(cpu);
992 #else /* #ifdef CONFIG_HOTPLUG_CPU */
994 static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp)
998 static void rcu_adopt_orphan_cbs(struct rcu_state *rsp)
1002 static void rcu_offline_cpu(int cpu)
1006 #endif /* #else #ifdef CONFIG_HOTPLUG_CPU */
1009 * Invoke any RCU callbacks that have made it to the end of their grace
1010 * period. Thottle as specified by rdp->blimit.
1012 static void rcu_do_batch(struct rcu_state *rsp, struct rcu_data *rdp)
1014 unsigned long flags;
1015 struct rcu_head *next, *list, **tail;
1018 /* If no callbacks are ready, just return.*/
1019 if (!cpu_has_callbacks_ready_to_invoke(rdp))
1023 * Extract the list of ready callbacks, disabling to prevent
1024 * races with call_rcu() from interrupt handlers.
1026 local_irq_save(flags);
1027 list = rdp->nxtlist;
1028 rdp->nxtlist = *rdp->nxttail[RCU_DONE_TAIL];
1029 *rdp->nxttail[RCU_DONE_TAIL] = NULL;
1030 tail = rdp->nxttail[RCU_DONE_TAIL];
1031 for (count = RCU_NEXT_SIZE - 1; count >= 0; count--)
1032 if (rdp->nxttail[count] == rdp->nxttail[RCU_DONE_TAIL])
1033 rdp->nxttail[count] = &rdp->nxtlist;
1034 local_irq_restore(flags);
1036 /* Invoke callbacks. */
1043 if (++count >= rdp->blimit)
1047 local_irq_save(flags);
1049 /* Update count, and requeue any remaining callbacks. */
1052 *tail = rdp->nxtlist;
1053 rdp->nxtlist = list;
1054 for (count = 0; count < RCU_NEXT_SIZE; count++)
1055 if (&rdp->nxtlist == rdp->nxttail[count])
1056 rdp->nxttail[count] = tail;
1061 /* Reinstate batch limit if we have worked down the excess. */
1062 if (rdp->blimit == LONG_MAX && rdp->qlen <= qlowmark)
1063 rdp->blimit = blimit;
1065 /* Reset ->qlen_last_fqs_check trigger if enough CBs have drained. */
1066 if (rdp->qlen == 0 && rdp->qlen_last_fqs_check != 0) {
1067 rdp->qlen_last_fqs_check = 0;
1068 rdp->n_force_qs_snap = rsp->n_force_qs;
1069 } else if (rdp->qlen < rdp->qlen_last_fqs_check - qhimark)
1070 rdp->qlen_last_fqs_check = rdp->qlen;
1072 local_irq_restore(flags);
1074 /* Re-raise the RCU softirq if there are callbacks remaining. */
1075 if (cpu_has_callbacks_ready_to_invoke(rdp))
1076 raise_softirq(RCU_SOFTIRQ);
1080 * Check to see if this CPU is in a non-context-switch quiescent state
1081 * (user mode or idle loop for rcu, non-softirq execution for rcu_bh).
1082 * Also schedule the RCU softirq handler.
1084 * This function must be called with hardirqs disabled. It is normally
1085 * invoked from the scheduling-clock interrupt. If rcu_pending returns
1086 * false, there is no point in invoking rcu_check_callbacks().
1088 void rcu_check_callbacks(int cpu, int user)
1090 if (!rcu_pending(cpu))
1091 return; /* if nothing for RCU to do. */
1093 (idle_cpu(cpu) && rcu_scheduler_active &&
1094 !in_softirq() && hardirq_count() <= (1 << HARDIRQ_SHIFT))) {
1097 * Get here if this CPU took its interrupt from user
1098 * mode or from the idle loop, and if this is not a
1099 * nested interrupt. In this case, the CPU is in
1100 * a quiescent state, so note it.
1102 * No memory barrier is required here because both
1103 * rcu_sched_qs() and rcu_bh_qs() reference only CPU-local
1104 * variables that other CPUs neither access nor modify,
1105 * at least not while the corresponding CPU is online.
1111 } else if (!in_softirq()) {
1114 * Get here if this CPU did not take its interrupt from
1115 * softirq, in other words, if it is not interrupting
1116 * a rcu_bh read-side critical section. This is an _bh
1117 * critical section, so note it.
1122 rcu_preempt_check_callbacks(cpu);
1123 raise_softirq(RCU_SOFTIRQ);
1129 * Scan the leaf rcu_node structures, processing dyntick state for any that
1130 * have not yet encountered a quiescent state, using the function specified.
1131 * Returns 1 if the current grace period ends while scanning (possibly
1132 * because we made it end).
1134 static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp,
1135 int (*f)(struct rcu_data *))
1139 unsigned long flags;
1141 struct rcu_node *rnp;
1143 rcu_for_each_leaf_node(rsp, rnp) {
1145 spin_lock_irqsave(&rnp->lock, flags);
1146 if (rnp->completed != lastcomp) {
1147 spin_unlock_irqrestore(&rnp->lock, flags);
1150 if (rnp->qsmask == 0) {
1151 spin_unlock_irqrestore(&rnp->lock, flags);
1156 for (; cpu <= rnp->grphi; cpu++, bit <<= 1) {
1157 if ((rnp->qsmask & bit) != 0 && f(rsp->rda[cpu]))
1160 if (mask != 0 && rnp->completed == lastcomp) {
1162 /* cpu_quiet_msk() releases rnp->lock. */
1163 cpu_quiet_msk(mask, rsp, rnp, flags);
1166 spin_unlock_irqrestore(&rnp->lock, flags);
1172 * Force quiescent states on reluctant CPUs, and also detect which
1173 * CPUs are in dyntick-idle mode.
1175 static void force_quiescent_state(struct rcu_state *rsp, int relaxed)
1177 unsigned long flags;
1179 struct rcu_node *rnp = rcu_get_root(rsp);
1183 if (!rcu_gp_in_progress(rsp))
1184 return; /* No grace period in progress, nothing to force. */
1185 if (!spin_trylock_irqsave(&rsp->fqslock, flags)) {
1186 rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */
1187 return; /* Someone else is already on the job. */
1190 (long)(rsp->jiffies_force_qs - jiffies) >= 0)
1191 goto unlock_ret; /* no emergency and done recently. */
1193 spin_lock(&rnp->lock);
1194 lastcomp = rsp->gpnum - 1;
1195 signaled = rsp->signaled;
1196 rsp->jiffies_force_qs = jiffies + RCU_JIFFIES_TILL_FORCE_QS;
1197 if(!rcu_gp_in_progress(rsp)) {
1198 rsp->n_force_qs_ngp++;
1199 spin_unlock(&rnp->lock);
1200 goto unlock_ret; /* no GP in progress, time updated. */
1202 spin_unlock(&rnp->lock);
1207 break; /* grace period idle or initializing, ignore. */
1209 case RCU_SAVE_DYNTICK:
1211 if (RCU_SIGNAL_INIT != RCU_SAVE_DYNTICK)
1212 break; /* So gcc recognizes the dead code. */
1214 /* Record dyntick-idle state. */
1215 if (rcu_process_dyntick(rsp, lastcomp,
1216 dyntick_save_progress_counter))
1218 /* fall into next case. */
1220 case RCU_SAVE_COMPLETED:
1222 /* Update state, record completion counter. */
1224 spin_lock(&rnp->lock);
1225 if (lastcomp + 1 == rsp->gpnum &&
1226 lastcomp == rsp->completed &&
1227 rsp->signaled == signaled) {
1228 rsp->signaled = RCU_FORCE_QS;
1229 rsp->completed_fqs = lastcomp;
1230 forcenow = signaled == RCU_SAVE_COMPLETED;
1232 spin_unlock(&rnp->lock);
1235 /* fall into next case. */
1239 /* Check dyntick-idle state, send IPI to laggarts. */
1240 if (rcu_process_dyntick(rsp, rsp->completed_fqs,
1241 rcu_implicit_dynticks_qs))
1244 /* Leave state in case more forcing is required. */
1249 spin_unlock_irqrestore(&rsp->fqslock, flags);
1252 #else /* #ifdef CONFIG_SMP */
1254 static void force_quiescent_state(struct rcu_state *rsp, int relaxed)
1259 #endif /* #else #ifdef CONFIG_SMP */
1262 * This does the RCU processing work from softirq context for the
1263 * specified rcu_state and rcu_data structures. This may be called
1264 * only from the CPU to whom the rdp belongs.
1267 __rcu_process_callbacks(struct rcu_state *rsp, struct rcu_data *rdp)
1269 unsigned long flags;
1271 WARN_ON_ONCE(rdp->beenonline == 0);
1274 * If an RCU GP has gone long enough, go check for dyntick
1275 * idle CPUs and, if needed, send resched IPIs.
1277 if ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)
1278 force_quiescent_state(rsp, 1);
1281 * Advance callbacks in response to end of earlier grace
1282 * period that some other CPU ended.
1284 rcu_process_gp_end(rsp, rdp);
1286 /* Update RCU state based on any recent quiescent states. */
1287 rcu_check_quiescent_state(rsp, rdp);
1289 /* Does this CPU require a not-yet-started grace period? */
1290 if (cpu_needs_another_gp(rsp, rdp)) {
1291 spin_lock_irqsave(&rcu_get_root(rsp)->lock, flags);
1292 rcu_start_gp(rsp, flags); /* releases above lock */
1295 /* If there are callbacks ready, invoke them. */
1296 rcu_do_batch(rsp, rdp);
1300 * Do softirq processing for the current CPU.
1302 static void rcu_process_callbacks(struct softirq_action *unused)
1305 * Memory references from any prior RCU read-side critical sections
1306 * executed by the interrupted code must be seen before any RCU
1307 * grace-period manipulations below.
1309 smp_mb(); /* See above block comment. */
1311 __rcu_process_callbacks(&rcu_sched_state,
1312 &__get_cpu_var(rcu_sched_data));
1313 __rcu_process_callbacks(&rcu_bh_state, &__get_cpu_var(rcu_bh_data));
1314 rcu_preempt_process_callbacks();
1317 * Memory references from any later RCU read-side critical sections
1318 * executed by the interrupted code must be seen after any RCU
1319 * grace-period manipulations above.
1321 smp_mb(); /* See above block comment. */
1325 __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu),
1326 struct rcu_state *rsp)
1328 unsigned long flags;
1329 struct rcu_data *rdp;
1334 smp_mb(); /* Ensure RCU update seen before callback registry. */
1337 * Opportunistically note grace-period endings and beginnings.
1338 * Note that we might see a beginning right after we see an
1339 * end, but never vice versa, since this CPU has to pass through
1340 * a quiescent state betweentimes.
1342 local_irq_save(flags);
1343 rdp = rsp->rda[smp_processor_id()];
1344 rcu_process_gp_end(rsp, rdp);
1345 check_for_new_grace_period(rsp, rdp);
1347 /* Add the callback to our list. */
1348 *rdp->nxttail[RCU_NEXT_TAIL] = head;
1349 rdp->nxttail[RCU_NEXT_TAIL] = &head->next;
1351 /* Start a new grace period if one not already started. */
1352 if (!rcu_gp_in_progress(rsp)) {
1353 unsigned long nestflag;
1354 struct rcu_node *rnp_root = rcu_get_root(rsp);
1356 spin_lock_irqsave(&rnp_root->lock, nestflag);
1357 rcu_start_gp(rsp, nestflag); /* releases rnp_root->lock. */
1361 * Force the grace period if too many callbacks or too long waiting.
1362 * Enforce hysteresis, and don't invoke force_quiescent_state()
1363 * if some other CPU has recently done so. Also, don't bother
1364 * invoking force_quiescent_state() if the newly enqueued callback
1365 * is the only one waiting for a grace period to complete.
1367 if (unlikely(++rdp->qlen > rdp->qlen_last_fqs_check + qhimark)) {
1368 rdp->blimit = LONG_MAX;
1369 if (rsp->n_force_qs == rdp->n_force_qs_snap &&
1370 *rdp->nxttail[RCU_DONE_TAIL] != head)
1371 force_quiescent_state(rsp, 0);
1372 rdp->n_force_qs_snap = rsp->n_force_qs;
1373 rdp->qlen_last_fqs_check = rdp->qlen;
1374 } else if ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)
1375 force_quiescent_state(rsp, 1);
1376 local_irq_restore(flags);
1380 * Queue an RCU-sched callback for invocation after a grace period.
1382 void call_rcu_sched(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
1384 __call_rcu(head, func, &rcu_sched_state);
1386 EXPORT_SYMBOL_GPL(call_rcu_sched);
1389 * Queue an RCU for invocation after a quicker grace period.
1391 void call_rcu_bh(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
1393 __call_rcu(head, func, &rcu_bh_state);
1395 EXPORT_SYMBOL_GPL(call_rcu_bh);
1398 * Check to see if there is any immediate RCU-related work to be done
1399 * by the current CPU, for the specified type of RCU, returning 1 if so.
1400 * The checks are in order of increasing expense: checks that can be
1401 * carried out against CPU-local state are performed first. However,
1402 * we must check for CPU stalls first, else we might not get a chance.
1404 static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp)
1406 struct rcu_node *rnp = rdp->mynode;
1408 rdp->n_rcu_pending++;
1410 /* Check for CPU stalls, if enabled. */
1411 check_cpu_stall(rsp, rdp);
1413 /* Is the RCU core waiting for a quiescent state from this CPU? */
1414 if (rdp->qs_pending) {
1415 rdp->n_rp_qs_pending++;
1419 /* Does this CPU have callbacks ready to invoke? */
1420 if (cpu_has_callbacks_ready_to_invoke(rdp)) {
1421 rdp->n_rp_cb_ready++;
1425 /* Has RCU gone idle with this CPU needing another grace period? */
1426 if (cpu_needs_another_gp(rsp, rdp)) {
1427 rdp->n_rp_cpu_needs_gp++;
1431 /* Has another RCU grace period completed? */
1432 if (ACCESS_ONCE(rnp->completed) != rdp->completed) { /* outside lock */
1433 rdp->n_rp_gp_completed++;
1437 /* Has a new RCU grace period started? */
1438 if (ACCESS_ONCE(rnp->gpnum) != rdp->gpnum) { /* outside lock */
1439 rdp->n_rp_gp_started++;
1443 /* Has an RCU GP gone long enough to send resched IPIs &c? */
1444 if (rcu_gp_in_progress(rsp) &&
1445 ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)) {
1446 rdp->n_rp_need_fqs++;
1451 rdp->n_rp_need_nothing++;
1456 * Check to see if there is any immediate RCU-related work to be done
1457 * by the current CPU, returning 1 if so. This function is part of the
1458 * RCU implementation; it is -not- an exported member of the RCU API.
1460 static int rcu_pending(int cpu)
1462 return __rcu_pending(&rcu_sched_state, &per_cpu(rcu_sched_data, cpu)) ||
1463 __rcu_pending(&rcu_bh_state, &per_cpu(rcu_bh_data, cpu)) ||
1464 rcu_preempt_pending(cpu);
1468 * Check to see if any future RCU-related work will need to be done
1469 * by the current CPU, even if none need be done immediately, returning
1470 * 1 if so. This function is part of the RCU implementation; it is -not-
1471 * an exported member of the RCU API.
1473 int rcu_needs_cpu(int cpu)
1475 /* RCU callbacks either ready or pending? */
1476 return per_cpu(rcu_sched_data, cpu).nxtlist ||
1477 per_cpu(rcu_bh_data, cpu).nxtlist ||
1478 rcu_preempt_needs_cpu(cpu);
1481 static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL};
1482 static atomic_t rcu_barrier_cpu_count;
1483 static DEFINE_MUTEX(rcu_barrier_mutex);
1484 static struct completion rcu_barrier_completion;
1486 static void rcu_barrier_callback(struct rcu_head *notused)
1488 if (atomic_dec_and_test(&rcu_barrier_cpu_count))
1489 complete(&rcu_barrier_completion);
1493 * Called with preemption disabled, and from cross-cpu IRQ context.
1495 static void rcu_barrier_func(void *type)
1497 int cpu = smp_processor_id();
1498 struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu);
1499 void (*call_rcu_func)(struct rcu_head *head,
1500 void (*func)(struct rcu_head *head));
1502 atomic_inc(&rcu_barrier_cpu_count);
1503 call_rcu_func = type;
1504 call_rcu_func(head, rcu_barrier_callback);
1508 * Orchestrate the specified type of RCU barrier, waiting for all
1509 * RCU callbacks of the specified type to complete.
1511 static void _rcu_barrier(struct rcu_state *rsp,
1512 void (*call_rcu_func)(struct rcu_head *head,
1513 void (*func)(struct rcu_head *head)))
1515 BUG_ON(in_interrupt());
1516 /* Take mutex to serialize concurrent rcu_barrier() requests. */
1517 mutex_lock(&rcu_barrier_mutex);
1518 init_completion(&rcu_barrier_completion);
1520 * Initialize rcu_barrier_cpu_count to 1, then invoke
1521 * rcu_barrier_func() on each CPU, so that each CPU also has
1522 * incremented rcu_barrier_cpu_count. Only then is it safe to
1523 * decrement rcu_barrier_cpu_count -- otherwise the first CPU
1524 * might complete its grace period before all of the other CPUs
1525 * did their increment, causing this function to return too
1528 atomic_set(&rcu_barrier_cpu_count, 1);
1529 preempt_disable(); /* stop CPU_DYING from filling orphan_cbs_list */
1530 rcu_adopt_orphan_cbs(rsp);
1531 on_each_cpu(rcu_barrier_func, (void *)call_rcu_func, 1);
1532 preempt_enable(); /* CPU_DYING can again fill orphan_cbs_list */
1533 if (atomic_dec_and_test(&rcu_barrier_cpu_count))
1534 complete(&rcu_barrier_completion);
1535 wait_for_completion(&rcu_barrier_completion);
1536 mutex_unlock(&rcu_barrier_mutex);
1540 * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete.
1542 void rcu_barrier_bh(void)
1544 _rcu_barrier(&rcu_bh_state, call_rcu_bh);
1546 EXPORT_SYMBOL_GPL(rcu_barrier_bh);
1549 * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks.
1551 void rcu_barrier_sched(void)
1553 _rcu_barrier(&rcu_sched_state, call_rcu_sched);
1555 EXPORT_SYMBOL_GPL(rcu_barrier_sched);
1558 * Do boot-time initialization of a CPU's per-CPU RCU data.
1561 rcu_boot_init_percpu_data(int cpu, struct rcu_state *rsp)
1563 unsigned long flags;
1565 struct rcu_data *rdp = rsp->rda[cpu];
1566 struct rcu_node *rnp = rcu_get_root(rsp);
1568 /* Set up local state, ensuring consistent view of global state. */
1569 spin_lock_irqsave(&rnp->lock, flags);
1570 rdp->grpmask = 1UL << (cpu - rdp->mynode->grplo);
1571 rdp->nxtlist = NULL;
1572 for (i = 0; i < RCU_NEXT_SIZE; i++)
1573 rdp->nxttail[i] = &rdp->nxtlist;
1576 rdp->dynticks = &per_cpu(rcu_dynticks, cpu);
1577 #endif /* #ifdef CONFIG_NO_HZ */
1579 spin_unlock_irqrestore(&rnp->lock, flags);
1583 * Initialize a CPU's per-CPU RCU data. Note that only one online or
1584 * offline event can be happening at a given time. Note also that we
1585 * can accept some slop in the rsp->completed access due to the fact
1586 * that this CPU cannot possibly have any RCU callbacks in flight yet.
1588 static void __cpuinit
1589 rcu_init_percpu_data(int cpu, struct rcu_state *rsp, int preemptable)
1591 unsigned long flags;
1593 struct rcu_data *rdp = rsp->rda[cpu];
1594 struct rcu_node *rnp = rcu_get_root(rsp);
1596 /* Set up local state, ensuring consistent view of global state. */
1597 spin_lock_irqsave(&rnp->lock, flags);
1598 rdp->passed_quiesc = 0; /* We could be racing with new GP, */
1599 rdp->qs_pending = 1; /* so set up to respond to current GP. */
1600 rdp->beenonline = 1; /* We have now been online. */
1601 rdp->preemptable = preemptable;
1602 rdp->qlen_last_fqs_check = 0;
1603 rdp->n_force_qs_snap = rsp->n_force_qs;
1604 rdp->blimit = blimit;
1605 spin_unlock(&rnp->lock); /* irqs remain disabled. */
1608 * A new grace period might start here. If so, we won't be part
1609 * of it, but that is OK, as we are currently in a quiescent state.
1612 /* Exclude any attempts to start a new GP on large systems. */
1613 spin_lock(&rsp->onofflock); /* irqs already disabled. */
1615 /* Add CPU to rcu_node bitmasks. */
1617 mask = rdp->grpmask;
1619 /* Exclude any attempts to start a new GP on small systems. */
1620 spin_lock(&rnp->lock); /* irqs already disabled. */
1621 rnp->qsmaskinit |= mask;
1622 mask = rnp->grpmask;
1623 if (rnp == rdp->mynode) {
1624 rdp->gpnum = rnp->completed; /* if GP in progress... */
1625 rdp->completed = rnp->completed;
1626 rdp->passed_quiesc_completed = rnp->completed - 1;
1628 spin_unlock(&rnp->lock); /* irqs already disabled. */
1630 } while (rnp != NULL && !(rnp->qsmaskinit & mask));
1632 spin_unlock_irqrestore(&rsp->onofflock, flags);
1635 static void __cpuinit rcu_online_cpu(int cpu)
1637 rcu_init_percpu_data(cpu, &rcu_sched_state, 0);
1638 rcu_init_percpu_data(cpu, &rcu_bh_state, 0);
1639 rcu_preempt_init_percpu_data(cpu);
1643 * Handle CPU online/offline notification events.
1645 int __cpuinit rcu_cpu_notify(struct notifier_block *self,
1646 unsigned long action, void *hcpu)
1648 long cpu = (long)hcpu;
1651 case CPU_UP_PREPARE:
1652 case CPU_UP_PREPARE_FROZEN:
1653 rcu_online_cpu(cpu);
1656 case CPU_DYING_FROZEN:
1658 * preempt_disable() in _rcu_barrier() prevents stop_machine(),
1659 * so when "on_each_cpu(rcu_barrier_func, (void *)type, 1);"
1660 * returns, all online cpus have queued rcu_barrier_func().
1661 * The dying CPU clears its cpu_online_mask bit and
1662 * moves all of its RCU callbacks to ->orphan_cbs_list
1663 * in the context of stop_machine(), so subsequent calls
1664 * to _rcu_barrier() will adopt these callbacks and only
1665 * then queue rcu_barrier_func() on all remaining CPUs.
1667 rcu_send_cbs_to_orphanage(&rcu_bh_state);
1668 rcu_send_cbs_to_orphanage(&rcu_sched_state);
1669 rcu_preempt_send_cbs_to_orphanage();
1672 case CPU_DEAD_FROZEN:
1673 case CPU_UP_CANCELED:
1674 case CPU_UP_CANCELED_FROZEN:
1675 rcu_offline_cpu(cpu);
1684 * Compute the per-level fanout, either using the exact fanout specified
1685 * or balancing the tree, depending on CONFIG_RCU_FANOUT_EXACT.
1687 #ifdef CONFIG_RCU_FANOUT_EXACT
1688 static void __init rcu_init_levelspread(struct rcu_state *rsp)
1692 for (i = NUM_RCU_LVLS - 1; i >= 0; i--)
1693 rsp->levelspread[i] = CONFIG_RCU_FANOUT;
1695 #else /* #ifdef CONFIG_RCU_FANOUT_EXACT */
1696 static void __init rcu_init_levelspread(struct rcu_state *rsp)
1703 for (i = NUM_RCU_LVLS - 1; i >= 0; i--) {
1704 ccur = rsp->levelcnt[i];
1705 rsp->levelspread[i] = (cprv + ccur - 1) / ccur;
1709 #endif /* #else #ifdef CONFIG_RCU_FANOUT_EXACT */
1712 * Helper function for rcu_init() that initializes one rcu_state structure.
1714 static void __init rcu_init_one(struct rcu_state *rsp)
1719 struct rcu_node *rnp;
1721 /* Initialize the level-tracking arrays. */
1723 for (i = 1; i < NUM_RCU_LVLS; i++)
1724 rsp->level[i] = rsp->level[i - 1] + rsp->levelcnt[i - 1];
1725 rcu_init_levelspread(rsp);
1727 /* Initialize the elements themselves, starting from the leaves. */
1729 for (i = NUM_RCU_LVLS - 1; i >= 0; i--) {
1730 cpustride *= rsp->levelspread[i];
1731 rnp = rsp->level[i];
1732 for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) {
1733 spin_lock_init(&rnp->lock);
1736 rnp->qsmaskinit = 0;
1737 rnp->grplo = j * cpustride;
1738 rnp->grphi = (j + 1) * cpustride - 1;
1739 if (rnp->grphi >= NR_CPUS)
1740 rnp->grphi = NR_CPUS - 1;
1746 rnp->grpnum = j % rsp->levelspread[i - 1];
1747 rnp->grpmask = 1UL << rnp->grpnum;
1748 rnp->parent = rsp->level[i - 1] +
1749 j / rsp->levelspread[i - 1];
1752 INIT_LIST_HEAD(&rnp->blocked_tasks[0]);
1753 INIT_LIST_HEAD(&rnp->blocked_tasks[1]);
1756 lockdep_set_class(&rcu_get_root(rsp)->lock, &rcu_root_class);
1760 * Helper macro for __rcu_init() and __rcu_init_preempt(). To be used
1761 * nowhere else! Assigns leaf node pointers into each CPU's rcu_data
1764 #define RCU_INIT_FLAVOR(rsp, rcu_data) \
1768 struct rcu_node *rnp; \
1770 rcu_init_one(rsp); \
1771 rnp = (rsp)->level[NUM_RCU_LVLS - 1]; \
1773 for_each_possible_cpu(i) { \
1774 if (i > rnp[j].grphi) \
1776 per_cpu(rcu_data, i).mynode = &rnp[j]; \
1777 (rsp)->rda[i] = &per_cpu(rcu_data, i); \
1778 rcu_boot_init_percpu_data(i, rsp); \
1782 void __init __rcu_init(void)
1784 rcu_bootup_announce();
1785 #ifdef CONFIG_RCU_CPU_STALL_DETECTOR
1786 printk(KERN_INFO "RCU-based detection of stalled CPUs is enabled.\n");
1787 #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */
1788 RCU_INIT_FLAVOR(&rcu_sched_state, rcu_sched_data);
1789 RCU_INIT_FLAVOR(&rcu_bh_state, rcu_bh_data);
1790 __rcu_init_preempt();
1791 open_softirq(RCU_SOFTIRQ, rcu_process_callbacks);
1794 #include "rcutree_plugin.h"