2 * Read-Copy Update mechanism for mutual exclusion (tree-based version)
3 * Internal non-public definitions that provide either classic
4 * or preemptible semantics.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20 * Copyright Red Hat, 2009
21 * Copyright IBM Corporation, 2009
23 * Author: Ingo Molnar <mingo@elte.hu>
24 * Paul E. McKenney <paulmck@linux.vnet.ibm.com>
27 #include <linux/delay.h>
28 #include <linux/stop_machine.h>
30 #define RCU_KTHREAD_PRIO 1
32 #ifdef CONFIG_RCU_BOOST
33 #define RCU_BOOST_PRIO CONFIG_RCU_BOOST_PRIO
35 #define RCU_BOOST_PRIO RCU_KTHREAD_PRIO
39 * Check the RCU kernel configuration parameters and print informative
40 * messages about anything out of the ordinary. If you like #ifdef, you
41 * will love this function.
43 static void __init rcu_bootup_announce_oddness(void)
45 #ifdef CONFIG_RCU_TRACE
46 printk(KERN_INFO "\tRCU debugfs-based tracing is enabled.\n");
48 #if (defined(CONFIG_64BIT) && CONFIG_RCU_FANOUT != 64) || (!defined(CONFIG_64BIT) && CONFIG_RCU_FANOUT != 32)
49 printk(KERN_INFO "\tCONFIG_RCU_FANOUT set to non-default value of %d\n",
52 #ifdef CONFIG_RCU_FANOUT_EXACT
53 printk(KERN_INFO "\tHierarchical RCU autobalancing is disabled.\n");
55 #ifdef CONFIG_RCU_FAST_NO_HZ
57 "\tRCU dyntick-idle grace-period acceleration is enabled.\n");
59 #ifdef CONFIG_PROVE_RCU
60 printk(KERN_INFO "\tRCU lockdep checking is enabled.\n");
62 #ifdef CONFIG_RCU_TORTURE_TEST_RUNNABLE
63 printk(KERN_INFO "\tRCU torture testing starts during boot.\n");
65 #if defined(CONFIG_TREE_PREEMPT_RCU) && !defined(CONFIG_RCU_CPU_STALL_VERBOSE)
66 printk(KERN_INFO "\tVerbose stalled-CPUs detection is disabled.\n");
68 #if NUM_RCU_LVL_4 != 0
69 printk(KERN_INFO "\tExperimental four-level hierarchy is enabled.\n");
73 #ifdef CONFIG_TREE_PREEMPT_RCU
75 struct rcu_state rcu_preempt_state = RCU_STATE_INITIALIZER(rcu_preempt);
76 DEFINE_PER_CPU(struct rcu_data, rcu_preempt_data);
77 static struct rcu_state *rcu_state = &rcu_preempt_state;
79 static void rcu_read_unlock_special(struct task_struct *t);
80 static int rcu_preempted_readers_exp(struct rcu_node *rnp);
83 * Tell them what RCU they are running.
85 static void __init rcu_bootup_announce(void)
87 printk(KERN_INFO "Preemptible hierarchical RCU implementation.\n");
88 rcu_bootup_announce_oddness();
92 * Return the number of RCU-preempt batches processed thus far
93 * for debug and statistics.
95 long rcu_batches_completed_preempt(void)
97 return rcu_preempt_state.completed;
99 EXPORT_SYMBOL_GPL(rcu_batches_completed_preempt);
102 * Return the number of RCU batches processed thus far for debug & stats.
104 long rcu_batches_completed(void)
106 return rcu_batches_completed_preempt();
108 EXPORT_SYMBOL_GPL(rcu_batches_completed);
111 * Force a quiescent state for preemptible RCU.
113 void rcu_force_quiescent_state(void)
115 force_quiescent_state(&rcu_preempt_state, 0);
117 EXPORT_SYMBOL_GPL(rcu_force_quiescent_state);
120 * Record a preemptible-RCU quiescent state for the specified CPU. Note
121 * that this just means that the task currently running on the CPU is
122 * not in a quiescent state. There might be any number of tasks blocked
123 * while in an RCU read-side critical section.
125 * Unlike the other rcu_*_qs() functions, callers to this function
126 * must disable irqs in order to protect the assignment to
127 * ->rcu_read_unlock_special.
129 static void rcu_preempt_qs(int cpu)
131 struct rcu_data *rdp = &per_cpu(rcu_preempt_data, cpu);
133 rdp->passed_quiesce_gpnum = rdp->gpnum;
135 if (rdp->passed_quiesce == 0)
136 trace_rcu_grace_period("rcu_preempt", rdp->gpnum, "cpuqs");
137 rdp->passed_quiesce = 1;
138 current->rcu_read_unlock_special &= ~RCU_READ_UNLOCK_NEED_QS;
142 * We have entered the scheduler, and the current task might soon be
143 * context-switched away from. If this task is in an RCU read-side
144 * critical section, we will no longer be able to rely on the CPU to
145 * record that fact, so we enqueue the task on the blkd_tasks list.
146 * The task will dequeue itself when it exits the outermost enclosing
147 * RCU read-side critical section. Therefore, the current grace period
148 * cannot be permitted to complete until the blkd_tasks list entries
149 * predating the current grace period drain, in other words, until
150 * rnp->gp_tasks becomes NULL.
152 * Caller must disable preemption.
154 static void rcu_preempt_note_context_switch(int cpu)
156 struct task_struct *t = current;
158 struct rcu_data *rdp;
159 struct rcu_node *rnp;
161 if (t->rcu_read_lock_nesting > 0 &&
162 (t->rcu_read_unlock_special & RCU_READ_UNLOCK_BLOCKED) == 0) {
164 /* Possibly blocking in an RCU read-side critical section. */
165 rdp = per_cpu_ptr(rcu_preempt_state.rda, cpu);
167 raw_spin_lock_irqsave(&rnp->lock, flags);
168 t->rcu_read_unlock_special |= RCU_READ_UNLOCK_BLOCKED;
169 t->rcu_blocked_node = rnp;
172 * If this CPU has already checked in, then this task
173 * will hold up the next grace period rather than the
174 * current grace period. Queue the task accordingly.
175 * If the task is queued for the current grace period
176 * (i.e., this CPU has not yet passed through a quiescent
177 * state for the current grace period), then as long
178 * as that task remains queued, the current grace period
179 * cannot end. Note that there is some uncertainty as
180 * to exactly when the current grace period started.
181 * We take a conservative approach, which can result
182 * in unnecessarily waiting on tasks that started very
183 * slightly after the current grace period began. C'est
186 * But first, note that the current CPU must still be
189 WARN_ON_ONCE((rdp->grpmask & rnp->qsmaskinit) == 0);
190 WARN_ON_ONCE(!list_empty(&t->rcu_node_entry));
191 if ((rnp->qsmask & rdp->grpmask) && rnp->gp_tasks != NULL) {
192 list_add(&t->rcu_node_entry, rnp->gp_tasks->prev);
193 rnp->gp_tasks = &t->rcu_node_entry;
194 #ifdef CONFIG_RCU_BOOST
195 if (rnp->boost_tasks != NULL)
196 rnp->boost_tasks = rnp->gp_tasks;
197 #endif /* #ifdef CONFIG_RCU_BOOST */
199 list_add(&t->rcu_node_entry, &rnp->blkd_tasks);
200 if (rnp->qsmask & rdp->grpmask)
201 rnp->gp_tasks = &t->rcu_node_entry;
203 trace_rcu_preempt_task(rdp->rsp->name,
205 (rnp->qsmask & rdp->grpmask)
208 raw_spin_unlock_irqrestore(&rnp->lock, flags);
209 } else if (t->rcu_read_lock_nesting < 0 &&
210 t->rcu_read_unlock_special) {
213 * Complete exit from RCU read-side critical section on
214 * behalf of preempted instance of __rcu_read_unlock().
216 rcu_read_unlock_special(t);
220 * Either we were not in an RCU read-side critical section to
221 * begin with, or we have now recorded that critical section
222 * globally. Either way, we can now note a quiescent state
223 * for this CPU. Again, if we were in an RCU read-side critical
224 * section, and if that critical section was blocking the current
225 * grace period, then the fact that the task has been enqueued
226 * means that we continue to block the current grace period.
228 local_irq_save(flags);
230 local_irq_restore(flags);
234 * Tree-preemptible RCU implementation for rcu_read_lock().
235 * Just increment ->rcu_read_lock_nesting, shared state will be updated
238 void __rcu_read_lock(void)
240 current->rcu_read_lock_nesting++;
241 barrier(); /* needed if we ever invoke rcu_read_lock in rcutree.c */
243 EXPORT_SYMBOL_GPL(__rcu_read_lock);
246 * Check for preempted RCU readers blocking the current grace period
247 * for the specified rcu_node structure. If the caller needs a reliable
248 * answer, it must hold the rcu_node's ->lock.
250 static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp)
252 return rnp->gp_tasks != NULL;
256 * Record a quiescent state for all tasks that were previously queued
257 * on the specified rcu_node structure and that were blocking the current
258 * RCU grace period. The caller must hold the specified rnp->lock with
259 * irqs disabled, and this lock is released upon return, but irqs remain
262 static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags)
263 __releases(rnp->lock)
266 struct rcu_node *rnp_p;
268 if (rnp->qsmask != 0 || rcu_preempt_blocked_readers_cgp(rnp)) {
269 raw_spin_unlock_irqrestore(&rnp->lock, flags);
270 return; /* Still need more quiescent states! */
276 * Either there is only one rcu_node in the tree,
277 * or tasks were kicked up to root rcu_node due to
278 * CPUs going offline.
280 rcu_report_qs_rsp(&rcu_preempt_state, flags);
284 /* Report up the rest of the hierarchy. */
286 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
287 raw_spin_lock(&rnp_p->lock); /* irqs already disabled. */
288 rcu_report_qs_rnp(mask, &rcu_preempt_state, rnp_p, flags);
292 * Advance a ->blkd_tasks-list pointer to the next entry, instead
293 * returning NULL if at the end of the list.
295 static struct list_head *rcu_next_node_entry(struct task_struct *t,
296 struct rcu_node *rnp)
298 struct list_head *np;
300 np = t->rcu_node_entry.next;
301 if (np == &rnp->blkd_tasks)
307 * Handle special cases during rcu_read_unlock(), such as needing to
308 * notify RCU core processing or task having blocked during the RCU
309 * read-side critical section.
311 static noinline void rcu_read_unlock_special(struct task_struct *t)
317 struct list_head *np;
318 #ifdef CONFIG_RCU_BOOST
319 struct rt_mutex *rbmp = NULL;
320 #endif /* #ifdef CONFIG_RCU_BOOST */
321 struct rcu_node *rnp;
324 /* NMI handlers cannot block and cannot safely manipulate state. */
328 local_irq_save(flags);
331 * If RCU core is waiting for this CPU to exit critical section,
332 * let it know that we have done so.
334 special = t->rcu_read_unlock_special;
335 if (special & RCU_READ_UNLOCK_NEED_QS) {
336 rcu_preempt_qs(smp_processor_id());
339 /* Hardware IRQ handlers cannot block. */
340 if (in_irq() || in_serving_softirq()) {
341 local_irq_restore(flags);
345 /* Clean up if blocked during RCU read-side critical section. */
346 if (special & RCU_READ_UNLOCK_BLOCKED) {
347 t->rcu_read_unlock_special &= ~RCU_READ_UNLOCK_BLOCKED;
350 * Remove this task from the list it blocked on. The
351 * task can migrate while we acquire the lock, but at
352 * most one time. So at most two passes through loop.
355 rnp = t->rcu_blocked_node;
356 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
357 if (rnp == t->rcu_blocked_node)
359 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
361 empty = !rcu_preempt_blocked_readers_cgp(rnp);
362 empty_exp = !rcu_preempted_readers_exp(rnp);
363 smp_mb(); /* ensure expedited fastpath sees end of RCU c-s. */
364 np = rcu_next_node_entry(t, rnp);
365 list_del_init(&t->rcu_node_entry);
366 t->rcu_blocked_node = NULL;
367 trace_rcu_unlock_preempted_task("rcu_preempt",
369 if (&t->rcu_node_entry == rnp->gp_tasks)
371 if (&t->rcu_node_entry == rnp->exp_tasks)
373 #ifdef CONFIG_RCU_BOOST
374 if (&t->rcu_node_entry == rnp->boost_tasks)
375 rnp->boost_tasks = np;
376 /* Snapshot/clear ->rcu_boost_mutex with rcu_node lock held. */
377 if (t->rcu_boost_mutex) {
378 rbmp = t->rcu_boost_mutex;
379 t->rcu_boost_mutex = NULL;
381 #endif /* #ifdef CONFIG_RCU_BOOST */
384 * If this was the last task on the current list, and if
385 * we aren't waiting on any CPUs, report the quiescent state.
386 * Note that rcu_report_unblock_qs_rnp() releases rnp->lock,
387 * so we must take a snapshot of the expedited state.
389 empty_exp_now = !rcu_preempted_readers_exp(rnp);
390 if (!empty && !rcu_preempt_blocked_readers_cgp(rnp)) {
391 trace_rcu_quiescent_state_report("preempt_rcu",
398 rcu_report_unblock_qs_rnp(rnp, flags);
400 raw_spin_unlock_irqrestore(&rnp->lock, flags);
402 #ifdef CONFIG_RCU_BOOST
403 /* Unboost if we were boosted. */
405 rt_mutex_unlock(rbmp);
406 #endif /* #ifdef CONFIG_RCU_BOOST */
409 * If this was the last task on the expedited lists,
410 * then we need to report up the rcu_node hierarchy.
412 if (!empty_exp && empty_exp_now)
413 rcu_report_exp_rnp(&rcu_preempt_state, rnp);
415 local_irq_restore(flags);
420 * Tree-preemptible RCU implementation for rcu_read_unlock().
421 * Decrement ->rcu_read_lock_nesting. If the result is zero (outermost
422 * rcu_read_unlock()) and ->rcu_read_unlock_special is non-zero, then
423 * invoke rcu_read_unlock_special() to clean up after a context switch
424 * in an RCU read-side critical section and other special cases.
426 void __rcu_read_unlock(void)
428 struct task_struct *t = current;
430 if (t->rcu_read_lock_nesting != 1)
431 --t->rcu_read_lock_nesting;
433 barrier(); /* critical section before exit code. */
434 t->rcu_read_lock_nesting = INT_MIN;
435 barrier(); /* assign before ->rcu_read_unlock_special load */
436 if (unlikely(ACCESS_ONCE(t->rcu_read_unlock_special)))
437 rcu_read_unlock_special(t);
438 barrier(); /* ->rcu_read_unlock_special load before assign */
439 t->rcu_read_lock_nesting = 0;
441 #ifdef CONFIG_PROVE_LOCKING
443 int rrln = ACCESS_ONCE(t->rcu_read_lock_nesting);
445 WARN_ON_ONCE(rrln < 0 && rrln > INT_MIN / 2);
447 #endif /* #ifdef CONFIG_PROVE_LOCKING */
449 EXPORT_SYMBOL_GPL(__rcu_read_unlock);
451 #ifdef CONFIG_RCU_CPU_STALL_VERBOSE
454 * Dump detailed information for all tasks blocking the current RCU
455 * grace period on the specified rcu_node structure.
457 static void rcu_print_detail_task_stall_rnp(struct rcu_node *rnp)
460 struct task_struct *t;
462 if (!rcu_preempt_blocked_readers_cgp(rnp))
464 raw_spin_lock_irqsave(&rnp->lock, flags);
465 t = list_entry(rnp->gp_tasks,
466 struct task_struct, rcu_node_entry);
467 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry)
469 raw_spin_unlock_irqrestore(&rnp->lock, flags);
473 * Dump detailed information for all tasks blocking the current RCU
476 static void rcu_print_detail_task_stall(struct rcu_state *rsp)
478 struct rcu_node *rnp = rcu_get_root(rsp);
480 rcu_print_detail_task_stall_rnp(rnp);
481 rcu_for_each_leaf_node(rsp, rnp)
482 rcu_print_detail_task_stall_rnp(rnp);
485 #else /* #ifdef CONFIG_RCU_CPU_STALL_VERBOSE */
487 static void rcu_print_detail_task_stall(struct rcu_state *rsp)
491 #endif /* #else #ifdef CONFIG_RCU_CPU_STALL_VERBOSE */
494 * Scan the current list of tasks blocked within RCU read-side critical
495 * sections, printing out the tid of each.
497 static int rcu_print_task_stall(struct rcu_node *rnp)
499 struct task_struct *t;
502 if (!rcu_preempt_blocked_readers_cgp(rnp))
504 t = list_entry(rnp->gp_tasks,
505 struct task_struct, rcu_node_entry);
506 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {
507 printk(" P%d", t->pid);
514 * Suppress preemptible RCU's CPU stall warnings by pushing the
515 * time of the next stall-warning message comfortably far into the
518 static void rcu_preempt_stall_reset(void)
520 rcu_preempt_state.jiffies_stall = jiffies + ULONG_MAX / 2;
524 * Check that the list of blocked tasks for the newly completed grace
525 * period is in fact empty. It is a serious bug to complete a grace
526 * period that still has RCU readers blocked! This function must be
527 * invoked -before- updating this rnp's ->gpnum, and the rnp's ->lock
528 * must be held by the caller.
530 * Also, if there are blocked tasks on the list, they automatically
531 * block the newly created grace period, so set up ->gp_tasks accordingly.
533 static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp)
535 WARN_ON_ONCE(rcu_preempt_blocked_readers_cgp(rnp));
536 if (!list_empty(&rnp->blkd_tasks))
537 rnp->gp_tasks = rnp->blkd_tasks.next;
538 WARN_ON_ONCE(rnp->qsmask);
541 #ifdef CONFIG_HOTPLUG_CPU
544 * Handle tasklist migration for case in which all CPUs covered by the
545 * specified rcu_node have gone offline. Move them up to the root
546 * rcu_node. The reason for not just moving them to the immediate
547 * parent is to remove the need for rcu_read_unlock_special() to
548 * make more than two attempts to acquire the target rcu_node's lock.
549 * Returns true if there were tasks blocking the current RCU grace
552 * Returns 1 if there was previously a task blocking the current grace
553 * period on the specified rcu_node structure.
555 * The caller must hold rnp->lock with irqs disabled.
557 static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
558 struct rcu_node *rnp,
559 struct rcu_data *rdp)
561 struct list_head *lp;
562 struct list_head *lp_root;
564 struct rcu_node *rnp_root = rcu_get_root(rsp);
565 struct task_struct *t;
567 if (rnp == rnp_root) {
568 WARN_ONCE(1, "Last CPU thought to be offlined?");
569 return 0; /* Shouldn't happen: at least one CPU online. */
572 /* If we are on an internal node, complain bitterly. */
573 WARN_ON_ONCE(rnp != rdp->mynode);
576 * Move tasks up to root rcu_node. Don't try to get fancy for
577 * this corner-case operation -- just put this node's tasks
578 * at the head of the root node's list, and update the root node's
579 * ->gp_tasks and ->exp_tasks pointers to those of this node's,
580 * if non-NULL. This might result in waiting for more tasks than
581 * absolutely necessary, but this is a good performance/complexity
584 if (rcu_preempt_blocked_readers_cgp(rnp))
585 retval |= RCU_OFL_TASKS_NORM_GP;
586 if (rcu_preempted_readers_exp(rnp))
587 retval |= RCU_OFL_TASKS_EXP_GP;
588 lp = &rnp->blkd_tasks;
589 lp_root = &rnp_root->blkd_tasks;
590 while (!list_empty(lp)) {
591 t = list_entry(lp->next, typeof(*t), rcu_node_entry);
592 raw_spin_lock(&rnp_root->lock); /* irqs already disabled */
593 list_del(&t->rcu_node_entry);
594 t->rcu_blocked_node = rnp_root;
595 list_add(&t->rcu_node_entry, lp_root);
596 if (&t->rcu_node_entry == rnp->gp_tasks)
597 rnp_root->gp_tasks = rnp->gp_tasks;
598 if (&t->rcu_node_entry == rnp->exp_tasks)
599 rnp_root->exp_tasks = rnp->exp_tasks;
600 #ifdef CONFIG_RCU_BOOST
601 if (&t->rcu_node_entry == rnp->boost_tasks)
602 rnp_root->boost_tasks = rnp->boost_tasks;
603 #endif /* #ifdef CONFIG_RCU_BOOST */
604 raw_spin_unlock(&rnp_root->lock); /* irqs still disabled */
607 #ifdef CONFIG_RCU_BOOST
608 /* In case root is being boosted and leaf is not. */
609 raw_spin_lock(&rnp_root->lock); /* irqs already disabled */
610 if (rnp_root->boost_tasks != NULL &&
611 rnp_root->boost_tasks != rnp_root->gp_tasks)
612 rnp_root->boost_tasks = rnp_root->gp_tasks;
613 raw_spin_unlock(&rnp_root->lock); /* irqs still disabled */
614 #endif /* #ifdef CONFIG_RCU_BOOST */
616 rnp->gp_tasks = NULL;
617 rnp->exp_tasks = NULL;
622 * Do CPU-offline processing for preemptible RCU.
624 static void rcu_preempt_offline_cpu(int cpu)
626 __rcu_offline_cpu(cpu, &rcu_preempt_state);
629 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
632 * Check for a quiescent state from the current CPU. When a task blocks,
633 * the task is recorded in the corresponding CPU's rcu_node structure,
634 * which is checked elsewhere.
636 * Caller must disable hard irqs.
638 static void rcu_preempt_check_callbacks(int cpu)
640 struct task_struct *t = current;
642 if (t->rcu_read_lock_nesting == 0) {
646 if (t->rcu_read_lock_nesting > 0 &&
647 per_cpu(rcu_preempt_data, cpu).qs_pending)
648 t->rcu_read_unlock_special |= RCU_READ_UNLOCK_NEED_QS;
652 * Process callbacks for preemptible RCU.
654 static void rcu_preempt_process_callbacks(void)
656 __rcu_process_callbacks(&rcu_preempt_state,
657 &__get_cpu_var(rcu_preempt_data));
660 #ifdef CONFIG_RCU_BOOST
662 static void rcu_preempt_do_callbacks(void)
664 rcu_do_batch(&rcu_preempt_state, &__get_cpu_var(rcu_preempt_data));
667 #endif /* #ifdef CONFIG_RCU_BOOST */
670 * Queue a preemptible-RCU callback for invocation after a grace period.
672 void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu))
674 __call_rcu(head, func, &rcu_preempt_state);
676 EXPORT_SYMBOL_GPL(call_rcu);
679 * synchronize_rcu - wait until a grace period has elapsed.
681 * Control will return to the caller some time after a full grace
682 * period has elapsed, in other words after all currently executing RCU
683 * read-side critical sections have completed. Note, however, that
684 * upon return from synchronize_rcu(), the caller might well be executing
685 * concurrently with new RCU read-side critical sections that began while
686 * synchronize_rcu() was waiting. RCU read-side critical sections are
687 * delimited by rcu_read_lock() and rcu_read_unlock(), and may be nested.
689 void synchronize_rcu(void)
691 if (!rcu_scheduler_active)
693 wait_rcu_gp(call_rcu);
695 EXPORT_SYMBOL_GPL(synchronize_rcu);
697 static DECLARE_WAIT_QUEUE_HEAD(sync_rcu_preempt_exp_wq);
698 static long sync_rcu_preempt_exp_count;
699 static DEFINE_MUTEX(sync_rcu_preempt_exp_mutex);
702 * Return non-zero if there are any tasks in RCU read-side critical
703 * sections blocking the current preemptible-RCU expedited grace period.
704 * If there is no preemptible-RCU expedited grace period currently in
705 * progress, returns zero unconditionally.
707 static int rcu_preempted_readers_exp(struct rcu_node *rnp)
709 return rnp->exp_tasks != NULL;
713 * return non-zero if there is no RCU expedited grace period in progress
714 * for the specified rcu_node structure, in other words, if all CPUs and
715 * tasks covered by the specified rcu_node structure have done their bit
716 * for the current expedited grace period. Works only for preemptible
717 * RCU -- other RCU implementation use other means.
719 * Caller must hold sync_rcu_preempt_exp_mutex.
721 static int sync_rcu_preempt_exp_done(struct rcu_node *rnp)
723 return !rcu_preempted_readers_exp(rnp) &&
724 ACCESS_ONCE(rnp->expmask) == 0;
728 * Report the exit from RCU read-side critical section for the last task
729 * that queued itself during or before the current expedited preemptible-RCU
730 * grace period. This event is reported either to the rcu_node structure on
731 * which the task was queued or to one of that rcu_node structure's ancestors,
732 * recursively up the tree. (Calm down, calm down, we do the recursion
735 * Caller must hold sync_rcu_preempt_exp_mutex.
737 static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp)
742 raw_spin_lock_irqsave(&rnp->lock, flags);
744 if (!sync_rcu_preempt_exp_done(rnp)) {
745 raw_spin_unlock_irqrestore(&rnp->lock, flags);
748 if (rnp->parent == NULL) {
749 raw_spin_unlock_irqrestore(&rnp->lock, flags);
750 wake_up(&sync_rcu_preempt_exp_wq);
754 raw_spin_unlock(&rnp->lock); /* irqs remain disabled */
756 raw_spin_lock(&rnp->lock); /* irqs already disabled */
757 rnp->expmask &= ~mask;
762 * Snapshot the tasks blocking the newly started preemptible-RCU expedited
763 * grace period for the specified rcu_node structure. If there are no such
764 * tasks, report it up the rcu_node hierarchy.
766 * Caller must hold sync_rcu_preempt_exp_mutex and rsp->onofflock.
769 sync_rcu_preempt_exp_init(struct rcu_state *rsp, struct rcu_node *rnp)
774 raw_spin_lock_irqsave(&rnp->lock, flags);
775 if (list_empty(&rnp->blkd_tasks))
776 raw_spin_unlock_irqrestore(&rnp->lock, flags);
778 rnp->exp_tasks = rnp->blkd_tasks.next;
779 rcu_initiate_boost(rnp, flags); /* releases rnp->lock */
783 rcu_report_exp_rnp(rsp, rnp);
787 * Wait for an rcu-preempt grace period, but expedite it. The basic idea
788 * is to invoke synchronize_sched_expedited() to push all the tasks to
789 * the ->blkd_tasks lists and wait for this list to drain.
791 void synchronize_rcu_expedited(void)
794 struct rcu_node *rnp;
795 struct rcu_state *rsp = &rcu_preempt_state;
799 smp_mb(); /* Caller's modifications seen first by other CPUs. */
800 snap = ACCESS_ONCE(sync_rcu_preempt_exp_count) + 1;
801 smp_mb(); /* Above access cannot bleed into critical section. */
804 * Acquire lock, falling back to synchronize_rcu() if too many
805 * lock-acquisition failures. Of course, if someone does the
806 * expedited grace period for us, just leave.
808 while (!mutex_trylock(&sync_rcu_preempt_exp_mutex)) {
810 udelay(trycount * num_online_cpus());
815 if ((ACCESS_ONCE(sync_rcu_preempt_exp_count) - snap) > 0)
816 goto mb_ret; /* Others did our work for us. */
818 if ((ACCESS_ONCE(sync_rcu_preempt_exp_count) - snap) > 0)
819 goto unlock_mb_ret; /* Others did our work for us. */
821 /* force all RCU readers onto ->blkd_tasks lists. */
822 synchronize_sched_expedited();
824 raw_spin_lock_irqsave(&rsp->onofflock, flags);
826 /* Initialize ->expmask for all non-leaf rcu_node structures. */
827 rcu_for_each_nonleaf_node_breadth_first(rsp, rnp) {
828 raw_spin_lock(&rnp->lock); /* irqs already disabled. */
829 rnp->expmask = rnp->qsmaskinit;
830 raw_spin_unlock(&rnp->lock); /* irqs remain disabled. */
833 /* Snapshot current state of ->blkd_tasks lists. */
834 rcu_for_each_leaf_node(rsp, rnp)
835 sync_rcu_preempt_exp_init(rsp, rnp);
836 if (NUM_RCU_NODES > 1)
837 sync_rcu_preempt_exp_init(rsp, rcu_get_root(rsp));
839 raw_spin_unlock_irqrestore(&rsp->onofflock, flags);
841 /* Wait for snapshotted ->blkd_tasks lists to drain. */
842 rnp = rcu_get_root(rsp);
843 wait_event(sync_rcu_preempt_exp_wq,
844 sync_rcu_preempt_exp_done(rnp));
846 /* Clean up and exit. */
847 smp_mb(); /* ensure expedited GP seen before counter increment. */
848 ACCESS_ONCE(sync_rcu_preempt_exp_count)++;
850 mutex_unlock(&sync_rcu_preempt_exp_mutex);
852 smp_mb(); /* ensure subsequent action seen after grace period. */
854 EXPORT_SYMBOL_GPL(synchronize_rcu_expedited);
857 * Check to see if there is any immediate preemptible-RCU-related work
860 static int rcu_preempt_pending(int cpu)
862 return __rcu_pending(&rcu_preempt_state,
863 &per_cpu(rcu_preempt_data, cpu));
867 * Does preemptible RCU need the CPU to stay out of dynticks mode?
869 static int rcu_preempt_needs_cpu(int cpu)
871 return !!per_cpu(rcu_preempt_data, cpu).nxtlist;
875 * rcu_barrier - Wait until all in-flight call_rcu() callbacks complete.
877 void rcu_barrier(void)
879 _rcu_barrier(&rcu_preempt_state, call_rcu);
881 EXPORT_SYMBOL_GPL(rcu_barrier);
884 * Initialize preemptible RCU's per-CPU data.
886 static void __cpuinit rcu_preempt_init_percpu_data(int cpu)
888 rcu_init_percpu_data(cpu, &rcu_preempt_state, 1);
892 * Move preemptible RCU's callbacks from dying CPU to other online CPU.
894 static void rcu_preempt_send_cbs_to_online(void)
896 rcu_send_cbs_to_online(&rcu_preempt_state);
900 * Initialize preemptible RCU's state structures.
902 static void __init __rcu_init_preempt(void)
904 rcu_init_one(&rcu_preempt_state, &rcu_preempt_data);
908 * Check for a task exiting while in a preemptible-RCU read-side
909 * critical section, clean up if so. No need to issue warnings,
910 * as debug_check_no_locks_held() already does this if lockdep
915 struct task_struct *t = current;
917 if (t->rcu_read_lock_nesting == 0)
919 t->rcu_read_lock_nesting = 1;
923 #else /* #ifdef CONFIG_TREE_PREEMPT_RCU */
925 static struct rcu_state *rcu_state = &rcu_sched_state;
928 * Tell them what RCU they are running.
930 static void __init rcu_bootup_announce(void)
932 printk(KERN_INFO "Hierarchical RCU implementation.\n");
933 rcu_bootup_announce_oddness();
937 * Return the number of RCU batches processed thus far for debug & stats.
939 long rcu_batches_completed(void)
941 return rcu_batches_completed_sched();
943 EXPORT_SYMBOL_GPL(rcu_batches_completed);
946 * Force a quiescent state for RCU, which, because there is no preemptible
947 * RCU, becomes the same as rcu-sched.
949 void rcu_force_quiescent_state(void)
951 rcu_sched_force_quiescent_state();
953 EXPORT_SYMBOL_GPL(rcu_force_quiescent_state);
956 * Because preemptible RCU does not exist, we never have to check for
957 * CPUs being in quiescent states.
959 static void rcu_preempt_note_context_switch(int cpu)
964 * Because preemptible RCU does not exist, there are never any preempted
967 static int rcu_preempt_blocked_readers_cgp(struct rcu_node *rnp)
972 #ifdef CONFIG_HOTPLUG_CPU
974 /* Because preemptible RCU does not exist, no quieting of tasks. */
975 static void rcu_report_unblock_qs_rnp(struct rcu_node *rnp, unsigned long flags)
977 raw_spin_unlock_irqrestore(&rnp->lock, flags);
980 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
983 * Because preemptible RCU does not exist, we never have to check for
984 * tasks blocked within RCU read-side critical sections.
986 static void rcu_print_detail_task_stall(struct rcu_state *rsp)
991 * Because preemptible RCU does not exist, we never have to check for
992 * tasks blocked within RCU read-side critical sections.
994 static int rcu_print_task_stall(struct rcu_node *rnp)
1000 * Because preemptible RCU does not exist, there is no need to suppress
1001 * its CPU stall warnings.
1003 static void rcu_preempt_stall_reset(void)
1008 * Because there is no preemptible RCU, there can be no readers blocked,
1009 * so there is no need to check for blocked tasks. So check only for
1010 * bogus qsmask values.
1012 static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp)
1014 WARN_ON_ONCE(rnp->qsmask);
1017 #ifdef CONFIG_HOTPLUG_CPU
1020 * Because preemptible RCU does not exist, it never needs to migrate
1021 * tasks that were blocked within RCU read-side critical sections, and
1022 * such non-existent tasks cannot possibly have been blocking the current
1025 static int rcu_preempt_offline_tasks(struct rcu_state *rsp,
1026 struct rcu_node *rnp,
1027 struct rcu_data *rdp)
1033 * Because preemptible RCU does not exist, it never needs CPU-offline
1036 static void rcu_preempt_offline_cpu(int cpu)
1040 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
1043 * Because preemptible RCU does not exist, it never has any callbacks
1046 static void rcu_preempt_check_callbacks(int cpu)
1051 * Because preemptible RCU does not exist, it never has any callbacks
1054 static void rcu_preempt_process_callbacks(void)
1059 * Wait for an rcu-preempt grace period, but make it happen quickly.
1060 * But because preemptible RCU does not exist, map to rcu-sched.
1062 void synchronize_rcu_expedited(void)
1064 synchronize_sched_expedited();
1066 EXPORT_SYMBOL_GPL(synchronize_rcu_expedited);
1068 #ifdef CONFIG_HOTPLUG_CPU
1071 * Because preemptible RCU does not exist, there is never any need to
1072 * report on tasks preempted in RCU read-side critical sections during
1073 * expedited RCU grace periods.
1075 static void rcu_report_exp_rnp(struct rcu_state *rsp, struct rcu_node *rnp)
1080 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
1083 * Because preemptible RCU does not exist, it never has any work to do.
1085 static int rcu_preempt_pending(int cpu)
1091 * Because preemptible RCU does not exist, it never needs any CPU.
1093 static int rcu_preempt_needs_cpu(int cpu)
1099 * Because preemptible RCU does not exist, rcu_barrier() is just
1100 * another name for rcu_barrier_sched().
1102 void rcu_barrier(void)
1104 rcu_barrier_sched();
1106 EXPORT_SYMBOL_GPL(rcu_barrier);
1109 * Because preemptible RCU does not exist, there is no per-CPU
1110 * data to initialize.
1112 static void __cpuinit rcu_preempt_init_percpu_data(int cpu)
1117 * Because there is no preemptible RCU, there are no callbacks to move.
1119 static void rcu_preempt_send_cbs_to_online(void)
1124 * Because preemptible RCU does not exist, it need not be initialized.
1126 static void __init __rcu_init_preempt(void)
1130 #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */
1132 #ifdef CONFIG_RCU_BOOST
1134 #include "rtmutex_common.h"
1136 #ifdef CONFIG_RCU_TRACE
1138 static void rcu_initiate_boost_trace(struct rcu_node *rnp)
1140 if (list_empty(&rnp->blkd_tasks))
1141 rnp->n_balk_blkd_tasks++;
1142 else if (rnp->exp_tasks == NULL && rnp->gp_tasks == NULL)
1143 rnp->n_balk_exp_gp_tasks++;
1144 else if (rnp->gp_tasks != NULL && rnp->boost_tasks != NULL)
1145 rnp->n_balk_boost_tasks++;
1146 else if (rnp->gp_tasks != NULL && rnp->qsmask != 0)
1147 rnp->n_balk_notblocked++;
1148 else if (rnp->gp_tasks != NULL &&
1149 ULONG_CMP_LT(jiffies, rnp->boost_time))
1150 rnp->n_balk_notyet++;
1155 #else /* #ifdef CONFIG_RCU_TRACE */
1157 static void rcu_initiate_boost_trace(struct rcu_node *rnp)
1161 #endif /* #else #ifdef CONFIG_RCU_TRACE */
1163 static struct lock_class_key rcu_boost_class;
1166 * Carry out RCU priority boosting on the task indicated by ->exp_tasks
1167 * or ->boost_tasks, advancing the pointer to the next task in the
1168 * ->blkd_tasks list.
1170 * Note that irqs must be enabled: boosting the task can block.
1171 * Returns 1 if there are more tasks needing to be boosted.
1173 static int rcu_boost(struct rcu_node *rnp)
1175 unsigned long flags;
1176 struct rt_mutex mtx;
1177 struct task_struct *t;
1178 struct list_head *tb;
1180 if (rnp->exp_tasks == NULL && rnp->boost_tasks == NULL)
1181 return 0; /* Nothing left to boost. */
1183 raw_spin_lock_irqsave(&rnp->lock, flags);
1186 * Recheck under the lock: all tasks in need of boosting
1187 * might exit their RCU read-side critical sections on their own.
1189 if (rnp->exp_tasks == NULL && rnp->boost_tasks == NULL) {
1190 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1195 * Preferentially boost tasks blocking expedited grace periods.
1196 * This cannot starve the normal grace periods because a second
1197 * expedited grace period must boost all blocked tasks, including
1198 * those blocking the pre-existing normal grace period.
1200 if (rnp->exp_tasks != NULL) {
1201 tb = rnp->exp_tasks;
1202 rnp->n_exp_boosts++;
1204 tb = rnp->boost_tasks;
1205 rnp->n_normal_boosts++;
1207 rnp->n_tasks_boosted++;
1210 * We boost task t by manufacturing an rt_mutex that appears to
1211 * be held by task t. We leave a pointer to that rt_mutex where
1212 * task t can find it, and task t will release the mutex when it
1213 * exits its outermost RCU read-side critical section. Then
1214 * simply acquiring this artificial rt_mutex will boost task
1215 * t's priority. (Thanks to tglx for suggesting this approach!)
1217 * Note that task t must acquire rnp->lock to remove itself from
1218 * the ->blkd_tasks list, which it will do from exit() if from
1219 * nowhere else. We therefore are guaranteed that task t will
1220 * stay around at least until we drop rnp->lock. Note that
1221 * rnp->lock also resolves races between our priority boosting
1222 * and task t's exiting its outermost RCU read-side critical
1225 t = container_of(tb, struct task_struct, rcu_node_entry);
1226 rt_mutex_init_proxy_locked(&mtx, t);
1227 /* Avoid lockdep false positives. This rt_mutex is its own thing. */
1228 lockdep_set_class_and_name(&mtx.wait_lock, &rcu_boost_class,
1230 t->rcu_boost_mutex = &mtx;
1231 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1232 rt_mutex_lock(&mtx); /* Side effect: boosts task t's priority. */
1233 rt_mutex_unlock(&mtx); /* Keep lockdep happy. */
1235 return rnp->exp_tasks != NULL || rnp->boost_tasks != NULL;
1239 * Timer handler to initiate waking up of boost kthreads that
1240 * have yielded the CPU due to excessive numbers of tasks to
1241 * boost. We wake up the per-rcu_node kthread, which in turn
1242 * will wake up the booster kthread.
1244 static void rcu_boost_kthread_timer(unsigned long arg)
1246 invoke_rcu_node_kthread((struct rcu_node *)arg);
1250 * Priority-boosting kthread. One per leaf rcu_node and one for the
1253 static int rcu_boost_kthread(void *arg)
1255 struct rcu_node *rnp = (struct rcu_node *)arg;
1259 trace_rcu_utilization("Start boost kthread@init");
1261 rnp->boost_kthread_status = RCU_KTHREAD_WAITING;
1262 trace_rcu_utilization("End boost kthread@rcu_wait");
1263 rcu_wait(rnp->boost_tasks || rnp->exp_tasks);
1264 trace_rcu_utilization("Start boost kthread@rcu_wait");
1265 rnp->boost_kthread_status = RCU_KTHREAD_RUNNING;
1266 more2boost = rcu_boost(rnp);
1272 trace_rcu_utilization("End boost kthread@rcu_yield");
1273 rcu_yield(rcu_boost_kthread_timer, (unsigned long)rnp);
1274 trace_rcu_utilization("Start boost kthread@rcu_yield");
1279 trace_rcu_utilization("End boost kthread@notreached");
1284 * Check to see if it is time to start boosting RCU readers that are
1285 * blocking the current grace period, and, if so, tell the per-rcu_node
1286 * kthread to start boosting them. If there is an expedited grace
1287 * period in progress, it is always time to boost.
1289 * The caller must hold rnp->lock, which this function releases,
1290 * but irqs remain disabled. The ->boost_kthread_task is immortal,
1291 * so we don't need to worry about it going away.
1293 static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags)
1295 struct task_struct *t;
1297 if (!rcu_preempt_blocked_readers_cgp(rnp) && rnp->exp_tasks == NULL) {
1298 rnp->n_balk_exp_gp_tasks++;
1299 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1302 if (rnp->exp_tasks != NULL ||
1303 (rnp->gp_tasks != NULL &&
1304 rnp->boost_tasks == NULL &&
1306 ULONG_CMP_GE(jiffies, rnp->boost_time))) {
1307 if (rnp->exp_tasks == NULL)
1308 rnp->boost_tasks = rnp->gp_tasks;
1309 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1310 t = rnp->boost_kthread_task;
1314 rcu_initiate_boost_trace(rnp);
1315 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1320 * Wake up the per-CPU kthread to invoke RCU callbacks.
1322 static void invoke_rcu_callbacks_kthread(void)
1324 unsigned long flags;
1326 local_irq_save(flags);
1327 __this_cpu_write(rcu_cpu_has_work, 1);
1328 if (__this_cpu_read(rcu_cpu_kthread_task) != NULL &&
1329 current != __this_cpu_read(rcu_cpu_kthread_task))
1330 wake_up_process(__this_cpu_read(rcu_cpu_kthread_task));
1331 local_irq_restore(flags);
1335 * Set the affinity of the boost kthread. The CPU-hotplug locks are
1336 * held, so no one should be messing with the existence of the boost
1339 static void rcu_boost_kthread_setaffinity(struct rcu_node *rnp,
1342 struct task_struct *t;
1344 t = rnp->boost_kthread_task;
1346 set_cpus_allowed_ptr(rnp->boost_kthread_task, cm);
1349 #define RCU_BOOST_DELAY_JIFFIES DIV_ROUND_UP(CONFIG_RCU_BOOST_DELAY * HZ, 1000)
1352 * Do priority-boost accounting for the start of a new grace period.
1354 static void rcu_preempt_boost_start_gp(struct rcu_node *rnp)
1356 rnp->boost_time = jiffies + RCU_BOOST_DELAY_JIFFIES;
1360 * Create an RCU-boost kthread for the specified node if one does not
1361 * already exist. We only create this kthread for preemptible RCU.
1362 * Returns zero if all is well, a negated errno otherwise.
1364 static int __cpuinit rcu_spawn_one_boost_kthread(struct rcu_state *rsp,
1365 struct rcu_node *rnp,
1368 unsigned long flags;
1369 struct sched_param sp;
1370 struct task_struct *t;
1372 if (&rcu_preempt_state != rsp)
1375 if (rnp->boost_kthread_task != NULL)
1377 t = kthread_create(rcu_boost_kthread, (void *)rnp,
1378 "rcub/%d", rnp_index);
1381 raw_spin_lock_irqsave(&rnp->lock, flags);
1382 rnp->boost_kthread_task = t;
1383 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1384 sp.sched_priority = RCU_BOOST_PRIO;
1385 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
1386 wake_up_process(t); /* get to TASK_INTERRUPTIBLE quickly. */
1390 #ifdef CONFIG_HOTPLUG_CPU
1393 * Stop the RCU's per-CPU kthread when its CPU goes offline,.
1395 static void rcu_stop_cpu_kthread(int cpu)
1397 struct task_struct *t;
1399 /* Stop the CPU's kthread. */
1400 t = per_cpu(rcu_cpu_kthread_task, cpu);
1402 per_cpu(rcu_cpu_kthread_task, cpu) = NULL;
1407 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
1409 static void rcu_kthread_do_work(void)
1411 rcu_do_batch(&rcu_sched_state, &__get_cpu_var(rcu_sched_data));
1412 rcu_do_batch(&rcu_bh_state, &__get_cpu_var(rcu_bh_data));
1413 rcu_preempt_do_callbacks();
1417 * Wake up the specified per-rcu_node-structure kthread.
1418 * Because the per-rcu_node kthreads are immortal, we don't need
1419 * to do anything to keep them alive.
1421 static void invoke_rcu_node_kthread(struct rcu_node *rnp)
1423 struct task_struct *t;
1425 t = rnp->node_kthread_task;
1431 * Set the specified CPU's kthread to run RT or not, as specified by
1432 * the to_rt argument. The CPU-hotplug locks are held, so the task
1433 * is not going away.
1435 static void rcu_cpu_kthread_setrt(int cpu, int to_rt)
1438 struct sched_param sp;
1439 struct task_struct *t;
1441 t = per_cpu(rcu_cpu_kthread_task, cpu);
1445 policy = SCHED_FIFO;
1446 sp.sched_priority = RCU_KTHREAD_PRIO;
1448 policy = SCHED_NORMAL;
1449 sp.sched_priority = 0;
1451 sched_setscheduler_nocheck(t, policy, &sp);
1455 * Timer handler to initiate the waking up of per-CPU kthreads that
1456 * have yielded the CPU due to excess numbers of RCU callbacks.
1457 * We wake up the per-rcu_node kthread, which in turn will wake up
1458 * the booster kthread.
1460 static void rcu_cpu_kthread_timer(unsigned long arg)
1462 struct rcu_data *rdp = per_cpu_ptr(rcu_state->rda, arg);
1463 struct rcu_node *rnp = rdp->mynode;
1465 atomic_or(rdp->grpmask, &rnp->wakemask);
1466 invoke_rcu_node_kthread(rnp);
1470 * Drop to non-real-time priority and yield, but only after posting a
1471 * timer that will cause us to regain our real-time priority if we
1472 * remain preempted. Either way, we restore our real-time priority
1475 static void rcu_yield(void (*f)(unsigned long), unsigned long arg)
1477 struct sched_param sp;
1478 struct timer_list yield_timer;
1479 int prio = current->rt_priority;
1481 setup_timer_on_stack(&yield_timer, f, arg);
1482 mod_timer(&yield_timer, jiffies + 2);
1483 sp.sched_priority = 0;
1484 sched_setscheduler_nocheck(current, SCHED_NORMAL, &sp);
1485 set_user_nice(current, 19);
1487 set_user_nice(current, 0);
1488 sp.sched_priority = prio;
1489 sched_setscheduler_nocheck(current, SCHED_FIFO, &sp);
1490 del_timer(&yield_timer);
1494 * Handle cases where the rcu_cpu_kthread() ends up on the wrong CPU.
1495 * This can happen while the corresponding CPU is either coming online
1496 * or going offline. We cannot wait until the CPU is fully online
1497 * before starting the kthread, because the various notifier functions
1498 * can wait for RCU grace periods. So we park rcu_cpu_kthread() until
1499 * the corresponding CPU is online.
1501 * Return 1 if the kthread needs to stop, 0 otherwise.
1503 * Caller must disable bh. This function can momentarily enable it.
1505 static int rcu_cpu_kthread_should_stop(int cpu)
1507 while (cpu_is_offline(cpu) ||
1508 !cpumask_equal(¤t->cpus_allowed, cpumask_of(cpu)) ||
1509 smp_processor_id() != cpu) {
1510 if (kthread_should_stop())
1512 per_cpu(rcu_cpu_kthread_status, cpu) = RCU_KTHREAD_OFFCPU;
1513 per_cpu(rcu_cpu_kthread_cpu, cpu) = raw_smp_processor_id();
1515 schedule_timeout_uninterruptible(1);
1516 if (!cpumask_equal(¤t->cpus_allowed, cpumask_of(cpu)))
1517 set_cpus_allowed_ptr(current, cpumask_of(cpu));
1520 per_cpu(rcu_cpu_kthread_cpu, cpu) = cpu;
1525 * Per-CPU kernel thread that invokes RCU callbacks. This replaces the
1526 * RCU softirq used in flavors and configurations of RCU that do not
1527 * support RCU priority boosting.
1529 static int rcu_cpu_kthread(void *arg)
1531 int cpu = (int)(long)arg;
1532 unsigned long flags;
1534 unsigned int *statusp = &per_cpu(rcu_cpu_kthread_status, cpu);
1536 char *workp = &per_cpu(rcu_cpu_has_work, cpu);
1538 trace_rcu_utilization("Start CPU kthread@init");
1540 *statusp = RCU_KTHREAD_WAITING;
1541 trace_rcu_utilization("End CPU kthread@rcu_wait");
1542 rcu_wait(*workp != 0 || kthread_should_stop());
1543 trace_rcu_utilization("Start CPU kthread@rcu_wait");
1545 if (rcu_cpu_kthread_should_stop(cpu)) {
1549 *statusp = RCU_KTHREAD_RUNNING;
1550 per_cpu(rcu_cpu_kthread_loops, cpu)++;
1551 local_irq_save(flags);
1554 local_irq_restore(flags);
1556 rcu_kthread_do_work();
1563 *statusp = RCU_KTHREAD_YIELDING;
1564 trace_rcu_utilization("End CPU kthread@rcu_yield");
1565 rcu_yield(rcu_cpu_kthread_timer, (unsigned long)cpu);
1566 trace_rcu_utilization("Start CPU kthread@rcu_yield");
1570 *statusp = RCU_KTHREAD_STOPPED;
1571 trace_rcu_utilization("End CPU kthread@term");
1576 * Spawn a per-CPU kthread, setting up affinity and priority.
1577 * Because the CPU hotplug lock is held, no other CPU will be attempting
1578 * to manipulate rcu_cpu_kthread_task. There might be another CPU
1579 * attempting to access it during boot, but the locking in kthread_bind()
1580 * will enforce sufficient ordering.
1582 * Please note that we cannot simply refuse to wake up the per-CPU
1583 * kthread because kthreads are created in TASK_UNINTERRUPTIBLE state,
1584 * which can result in softlockup complaints if the task ends up being
1585 * idle for more than a couple of minutes.
1587 * However, please note also that we cannot bind the per-CPU kthread to its
1588 * CPU until that CPU is fully online. We also cannot wait until the
1589 * CPU is fully online before we create its per-CPU kthread, as this would
1590 * deadlock the system when CPU notifiers tried waiting for grace
1591 * periods. So we bind the per-CPU kthread to its CPU only if the CPU
1592 * is online. If its CPU is not yet fully online, then the code in
1593 * rcu_cpu_kthread() will wait until it is fully online, and then do
1596 static int __cpuinit rcu_spawn_one_cpu_kthread(int cpu)
1598 struct sched_param sp;
1599 struct task_struct *t;
1601 if (!rcu_scheduler_fully_active ||
1602 per_cpu(rcu_cpu_kthread_task, cpu) != NULL)
1604 t = kthread_create_on_node(rcu_cpu_kthread,
1610 if (cpu_online(cpu))
1611 kthread_bind(t, cpu);
1612 per_cpu(rcu_cpu_kthread_cpu, cpu) = cpu;
1613 WARN_ON_ONCE(per_cpu(rcu_cpu_kthread_task, cpu) != NULL);
1614 sp.sched_priority = RCU_KTHREAD_PRIO;
1615 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
1616 per_cpu(rcu_cpu_kthread_task, cpu) = t;
1617 wake_up_process(t); /* Get to TASK_INTERRUPTIBLE quickly. */
1622 * Per-rcu_node kthread, which is in charge of waking up the per-CPU
1623 * kthreads when needed. We ignore requests to wake up kthreads
1624 * for offline CPUs, which is OK because force_quiescent_state()
1625 * takes care of this case.
1627 static int rcu_node_kthread(void *arg)
1630 unsigned long flags;
1632 struct rcu_node *rnp = (struct rcu_node *)arg;
1633 struct sched_param sp;
1634 struct task_struct *t;
1637 rnp->node_kthread_status = RCU_KTHREAD_WAITING;
1638 rcu_wait(atomic_read(&rnp->wakemask) != 0);
1639 rnp->node_kthread_status = RCU_KTHREAD_RUNNING;
1640 raw_spin_lock_irqsave(&rnp->lock, flags);
1641 mask = atomic_xchg(&rnp->wakemask, 0);
1642 rcu_initiate_boost(rnp, flags); /* releases rnp->lock. */
1643 for (cpu = rnp->grplo; cpu <= rnp->grphi; cpu++, mask >>= 1) {
1644 if ((mask & 0x1) == 0)
1647 t = per_cpu(rcu_cpu_kthread_task, cpu);
1648 if (!cpu_online(cpu) || t == NULL) {
1652 per_cpu(rcu_cpu_has_work, cpu) = 1;
1653 sp.sched_priority = RCU_KTHREAD_PRIO;
1654 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
1659 rnp->node_kthread_status = RCU_KTHREAD_STOPPED;
1664 * Set the per-rcu_node kthread's affinity to cover all CPUs that are
1665 * served by the rcu_node in question. The CPU hotplug lock is still
1666 * held, so the value of rnp->qsmaskinit will be stable.
1668 * We don't include outgoingcpu in the affinity set, use -1 if there is
1669 * no outgoing CPU. If there are no CPUs left in the affinity set,
1670 * this function allows the kthread to execute on any CPU.
1672 static void rcu_node_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu)
1676 unsigned long mask = rnp->qsmaskinit;
1678 if (rnp->node_kthread_task == NULL)
1680 if (!alloc_cpumask_var(&cm, GFP_KERNEL))
1683 for (cpu = rnp->grplo; cpu <= rnp->grphi; cpu++, mask >>= 1)
1684 if ((mask & 0x1) && cpu != outgoingcpu)
1685 cpumask_set_cpu(cpu, cm);
1686 if (cpumask_weight(cm) == 0) {
1688 for (cpu = rnp->grplo; cpu <= rnp->grphi; cpu++)
1689 cpumask_clear_cpu(cpu, cm);
1690 WARN_ON_ONCE(cpumask_weight(cm) == 0);
1692 set_cpus_allowed_ptr(rnp->node_kthread_task, cm);
1693 rcu_boost_kthread_setaffinity(rnp, cm);
1694 free_cpumask_var(cm);
1698 * Spawn a per-rcu_node kthread, setting priority and affinity.
1699 * Called during boot before online/offline can happen, or, if
1700 * during runtime, with the main CPU-hotplug locks held. So only
1701 * one of these can be executing at a time.
1703 static int __cpuinit rcu_spawn_one_node_kthread(struct rcu_state *rsp,
1704 struct rcu_node *rnp)
1706 unsigned long flags;
1707 int rnp_index = rnp - &rsp->node[0];
1708 struct sched_param sp;
1709 struct task_struct *t;
1711 if (!rcu_scheduler_fully_active ||
1712 rnp->qsmaskinit == 0)
1714 if (rnp->node_kthread_task == NULL) {
1715 t = kthread_create(rcu_node_kthread, (void *)rnp,
1716 "rcun/%d", rnp_index);
1719 raw_spin_lock_irqsave(&rnp->lock, flags);
1720 rnp->node_kthread_task = t;
1721 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1722 sp.sched_priority = 99;
1723 sched_setscheduler_nocheck(t, SCHED_FIFO, &sp);
1724 wake_up_process(t); /* get to TASK_INTERRUPTIBLE quickly. */
1726 return rcu_spawn_one_boost_kthread(rsp, rnp, rnp_index);
1730 * Spawn all kthreads -- called as soon as the scheduler is running.
1732 static int __init rcu_spawn_kthreads(void)
1735 struct rcu_node *rnp;
1737 rcu_scheduler_fully_active = 1;
1738 for_each_possible_cpu(cpu) {
1739 per_cpu(rcu_cpu_has_work, cpu) = 0;
1740 if (cpu_online(cpu))
1741 (void)rcu_spawn_one_cpu_kthread(cpu);
1743 rnp = rcu_get_root(rcu_state);
1744 (void)rcu_spawn_one_node_kthread(rcu_state, rnp);
1745 if (NUM_RCU_NODES > 1) {
1746 rcu_for_each_leaf_node(rcu_state, rnp)
1747 (void)rcu_spawn_one_node_kthread(rcu_state, rnp);
1751 early_initcall(rcu_spawn_kthreads);
1753 static void __cpuinit rcu_prepare_kthreads(int cpu)
1755 struct rcu_data *rdp = per_cpu_ptr(rcu_state->rda, cpu);
1756 struct rcu_node *rnp = rdp->mynode;
1758 /* Fire up the incoming CPU's kthread and leaf rcu_node kthread. */
1759 if (rcu_scheduler_fully_active) {
1760 (void)rcu_spawn_one_cpu_kthread(cpu);
1761 if (rnp->node_kthread_task == NULL)
1762 (void)rcu_spawn_one_node_kthread(rcu_state, rnp);
1766 #else /* #ifdef CONFIG_RCU_BOOST */
1768 static void rcu_initiate_boost(struct rcu_node *rnp, unsigned long flags)
1770 raw_spin_unlock_irqrestore(&rnp->lock, flags);
1773 static void invoke_rcu_callbacks_kthread(void)
1778 static void rcu_preempt_boost_start_gp(struct rcu_node *rnp)
1782 #ifdef CONFIG_HOTPLUG_CPU
1784 static void rcu_stop_cpu_kthread(int cpu)
1788 #endif /* #ifdef CONFIG_HOTPLUG_CPU */
1790 static void rcu_node_kthread_setaffinity(struct rcu_node *rnp, int outgoingcpu)
1794 static void rcu_cpu_kthread_setrt(int cpu, int to_rt)
1798 static int __init rcu_scheduler_really_started(void)
1800 rcu_scheduler_fully_active = 1;
1803 early_initcall(rcu_scheduler_really_started);
1805 static void __cpuinit rcu_prepare_kthreads(int cpu)
1809 #endif /* #else #ifdef CONFIG_RCU_BOOST */
1813 void synchronize_sched_expedited(void)
1817 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
1819 #else /* #ifndef CONFIG_SMP */
1821 static atomic_t sync_sched_expedited_started = ATOMIC_INIT(0);
1822 static atomic_t sync_sched_expedited_done = ATOMIC_INIT(0);
1824 static int synchronize_sched_expedited_cpu_stop(void *data)
1827 * There must be a full memory barrier on each affected CPU
1828 * between the time that try_stop_cpus() is called and the
1829 * time that it returns.
1831 * In the current initial implementation of cpu_stop, the
1832 * above condition is already met when the control reaches
1833 * this point and the following smp_mb() is not strictly
1834 * necessary. Do smp_mb() anyway for documentation and
1835 * robustness against future implementation changes.
1837 smp_mb(); /* See above comment block. */
1842 * Wait for an rcu-sched grace period to elapse, but use "big hammer"
1843 * approach to force grace period to end quickly. This consumes
1844 * significant time on all CPUs, and is thus not recommended for
1845 * any sort of common-case code.
1847 * Note that it is illegal to call this function while holding any
1848 * lock that is acquired by a CPU-hotplug notifier. Failing to
1849 * observe this restriction will result in deadlock.
1851 * This implementation can be thought of as an application of ticket
1852 * locking to RCU, with sync_sched_expedited_started and
1853 * sync_sched_expedited_done taking on the roles of the halves
1854 * of the ticket-lock word. Each task atomically increments
1855 * sync_sched_expedited_started upon entry, snapshotting the old value,
1856 * then attempts to stop all the CPUs. If this succeeds, then each
1857 * CPU will have executed a context switch, resulting in an RCU-sched
1858 * grace period. We are then done, so we use atomic_cmpxchg() to
1859 * update sync_sched_expedited_done to match our snapshot -- but
1860 * only if someone else has not already advanced past our snapshot.
1862 * On the other hand, if try_stop_cpus() fails, we check the value
1863 * of sync_sched_expedited_done. If it has advanced past our
1864 * initial snapshot, then someone else must have forced a grace period
1865 * some time after we took our snapshot. In this case, our work is
1866 * done for us, and we can simply return. Otherwise, we try again,
1867 * but keep our initial snapshot for purposes of checking for someone
1868 * doing our work for us.
1870 * If we fail too many times in a row, we fall back to synchronize_sched().
1872 void synchronize_sched_expedited(void)
1874 int firstsnap, s, snap, trycount = 0;
1876 /* Note that atomic_inc_return() implies full memory barrier. */
1877 firstsnap = snap = atomic_inc_return(&sync_sched_expedited_started);
1881 * Each pass through the following loop attempts to force a
1882 * context switch on each CPU.
1884 while (try_stop_cpus(cpu_online_mask,
1885 synchronize_sched_expedited_cpu_stop,
1889 /* No joy, try again later. Or just synchronize_sched(). */
1890 if (trycount++ < 10)
1891 udelay(trycount * num_online_cpus());
1893 synchronize_sched();
1897 /* Check to see if someone else did our work for us. */
1898 s = atomic_read(&sync_sched_expedited_done);
1899 if (UINT_CMP_GE((unsigned)s, (unsigned)firstsnap)) {
1900 smp_mb(); /* ensure test happens before caller kfree */
1905 * Refetching sync_sched_expedited_started allows later
1906 * callers to piggyback on our grace period. We subtract
1907 * 1 to get the same token that the last incrementer got.
1908 * We retry after they started, so our grace period works
1909 * for them, and they started after our first try, so their
1910 * grace period works for us.
1913 snap = atomic_read(&sync_sched_expedited_started);
1914 smp_mb(); /* ensure read is before try_stop_cpus(). */
1918 * Everyone up to our most recent fetch is covered by our grace
1919 * period. Update the counter, but only if our work is still
1920 * relevant -- which it won't be if someone who started later
1921 * than we did beat us to the punch.
1924 s = atomic_read(&sync_sched_expedited_done);
1925 if (UINT_CMP_GE((unsigned)s, (unsigned)snap)) {
1926 smp_mb(); /* ensure test happens before caller kfree */
1929 } while (atomic_cmpxchg(&sync_sched_expedited_done, s, snap) != s);
1933 EXPORT_SYMBOL_GPL(synchronize_sched_expedited);
1935 #endif /* #else #ifndef CONFIG_SMP */
1937 #if !defined(CONFIG_RCU_FAST_NO_HZ)
1940 * Check to see if any future RCU-related work will need to be done
1941 * by the current CPU, even if none need be done immediately, returning
1942 * 1 if so. This function is part of the RCU implementation; it is -not-
1943 * an exported member of the RCU API.
1945 * Because we have preemptible RCU, just check whether this CPU needs
1946 * any flavor of RCU. Do not chew up lots of CPU cycles with preemption
1947 * disabled in a most-likely vain attempt to cause RCU not to need this CPU.
1949 int rcu_needs_cpu(int cpu)
1951 return rcu_needs_cpu_quick_check(cpu);
1954 #else /* #if !defined(CONFIG_RCU_FAST_NO_HZ) */
1956 #define RCU_NEEDS_CPU_FLUSHES 5
1957 static DEFINE_PER_CPU(int, rcu_dyntick_drain);
1958 static DEFINE_PER_CPU(unsigned long, rcu_dyntick_holdoff);
1961 * Check to see if any future RCU-related work will need to be done
1962 * by the current CPU, even if none need be done immediately, returning
1963 * 1 if so. This function is part of the RCU implementation; it is -not-
1964 * an exported member of the RCU API.
1966 * Because we are not supporting preemptible RCU, attempt to accelerate
1967 * any current grace periods so that RCU no longer needs this CPU, but
1968 * only if all other CPUs are already in dynticks-idle mode. This will
1969 * allow the CPU cores to be powered down immediately, as opposed to after
1970 * waiting many milliseconds for grace periods to elapse.
1972 * Because it is not legal to invoke rcu_process_callbacks() with irqs
1973 * disabled, we do one pass of force_quiescent_state(), then do a
1974 * invoke_rcu_core() to cause rcu_process_callbacks() to be invoked
1975 * later. The per-cpu rcu_dyntick_drain variable controls the sequencing.
1977 int rcu_needs_cpu(int cpu)
1983 /* Check for being in the holdoff period. */
1984 if (per_cpu(rcu_dyntick_holdoff, cpu) == jiffies)
1985 return rcu_needs_cpu_quick_check(cpu);
1987 /* Don't bother unless we are the last non-dyntick-idle CPU. */
1988 for_each_online_cpu(thatcpu) {
1991 snap = atomic_add_return(0, &per_cpu(rcu_dynticks,
1993 smp_mb(); /* Order sampling of snap with end of grace period. */
1994 if ((snap & 0x1) != 0) {
1995 per_cpu(rcu_dyntick_drain, cpu) = 0;
1996 per_cpu(rcu_dyntick_holdoff, cpu) = jiffies - 1;
1997 return rcu_needs_cpu_quick_check(cpu);
2001 /* Check and update the rcu_dyntick_drain sequencing. */
2002 if (per_cpu(rcu_dyntick_drain, cpu) <= 0) {
2003 /* First time through, initialize the counter. */
2004 per_cpu(rcu_dyntick_drain, cpu) = RCU_NEEDS_CPU_FLUSHES;
2005 } else if (--per_cpu(rcu_dyntick_drain, cpu) <= 0) {
2006 /* We have hit the limit, so time to give up. */
2007 per_cpu(rcu_dyntick_holdoff, cpu) = jiffies;
2008 return rcu_needs_cpu_quick_check(cpu);
2011 /* Do one step pushing remaining RCU callbacks through. */
2012 if (per_cpu(rcu_sched_data, cpu).nxtlist) {
2014 force_quiescent_state(&rcu_sched_state, 0);
2015 c = c || per_cpu(rcu_sched_data, cpu).nxtlist;
2017 if (per_cpu(rcu_bh_data, cpu).nxtlist) {
2019 force_quiescent_state(&rcu_bh_state, 0);
2020 c = c || per_cpu(rcu_bh_data, cpu).nxtlist;
2023 /* If RCU callbacks are still pending, RCU still needs this CPU. */
2029 #endif /* #else #if !defined(CONFIG_RCU_FAST_NO_HZ) */