2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* linux/kernel/softirq.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1992 Linus Torvalds
|
|
|
|
*
|
2008-01-30 12:30:00 +00:00
|
|
|
* Distribute under GPLv2.
|
|
|
|
*
|
|
|
|
* Rewritten. Old one was good in 2.2, but in 2.3 it was immoral. --ANK (990903)
|
2008-09-24 05:15:57 +00:00
|
|
|
*
|
|
|
|
* Remote softirq infrastructure is by Jens Axboe.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
|
|
|
|
2011-05-23 18:51:41 +00:00
|
|
|
#include <linux/export.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kernel_stat.h>
|
|
|
|
#include <linux/interrupt.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/notifier.h>
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
#include <linux/cpu.h>
|
2007-07-17 11:03:35 +00:00
|
|
|
#include <linux/freezer.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kthread.h>
|
|
|
|
#include <linux/rcupdate.h>
|
2009-01-23 00:01:40 +00:00
|
|
|
#include <linux/ftrace.h>
|
2006-03-22 08:08:16 +00:00
|
|
|
#include <linux/smp.h>
|
2007-02-16 09:28:03 +00:00
|
|
|
#include <linux/tick.h>
|
2009-04-29 11:51:39 +00:00
|
|
|
|
|
|
|
#define CREATE_TRACE_POINTS
|
2009-04-14 23:39:12 +00:00
|
|
|
#include <trace/events/irq.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#include <asm/irq.h>
|
|
|
|
/*
|
|
|
|
- No shared variables, all the data are CPU local.
|
|
|
|
- If a softirq needs serialization, let it serialize itself
|
|
|
|
by its own spinlocks.
|
|
|
|
- Even if softirq is serialized, only local cpu is marked for
|
|
|
|
execution. Hence, we get something sort of weak cpu binding.
|
|
|
|
Though it is still not clear, will it result in better locality
|
|
|
|
or will not.
|
|
|
|
|
|
|
|
Examples:
|
|
|
|
- NET RX softirq. It is multithreaded and does not require
|
|
|
|
any global serialization.
|
|
|
|
- NET TX softirq. It kicks software netdevice queues, hence
|
|
|
|
it is logically serialized per device, but this serialization
|
|
|
|
is invisible to common code.
|
|
|
|
- Tasklets: serialized wrt itself.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __ARCH_IRQ_STAT
|
|
|
|
irq_cpustat_t irq_stat[NR_CPUS] ____cacheline_aligned;
|
|
|
|
EXPORT_SYMBOL(irq_stat);
|
|
|
|
#endif
|
|
|
|
|
2008-09-06 18:04:36 +00:00
|
|
|
static struct softirq_action softirq_vec[NR_SOFTIRQS] __cacheline_aligned_in_smp;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-12-22 01:09:00 +00:00
|
|
|
DEFINE_PER_CPU(struct task_struct *, ksoftirqd);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2009-03-12 18:33:36 +00:00
|
|
|
char *softirq_to_name[NR_SOFTIRQS] = {
|
2009-09-17 09:38:32 +00:00
|
|
|
"HI", "TIMER", "NET_TX", "NET_RX", "BLOCK", "BLOCK_IOPOLL",
|
rcu: Use softirq to address performance regression
Commit a26ac2455ffcf3(rcu: move TREE_RCU from softirq to kthread)
introduced performance regression. In an AIM7 test, this commit degraded
performance by about 40%.
The commit runs rcu callbacks in a kthread instead of softirq. We observed
high rate of context switch which is caused by this. Out test system has
64 CPUs and HZ is 1000, so we saw more than 64k context switch per second
which is caused by RCU's per-CPU kthread. A trace showed that most of
the time the RCU per-CPU kthread doesn't actually handle any callbacks,
but instead just does a very small amount of work handling grace periods.
This means that RCU's per-CPU kthreads are making the scheduler do quite
a bit of work in order to allow a very small amount of RCU-related
processing to be done.
Alex Shi's analysis determined that this slowdown is due to lock
contention within the scheduler. Unfortunately, as Peter Zijlstra points
out, the scheduler's real-time semantics require global action, which
means that this contention is inherent in real-time scheduling. (Yes,
perhaps someone will come up with a workaround -- otherwise, -rt is not
going to do well on large SMP systems -- but this patch will work around
this issue in the meantime. And "the meantime" might well be forever.)
This patch therefore re-introduces softirq processing to RCU, but only
for core RCU work. RCU callbacks are still executed in kthread context,
so that only a small amount of RCU work runs in softirq context in the
common case. This should minimize ksoftirqd execution, allowing us to
skip boosting of ksoftirqd for CONFIG_RCU_BOOST=y kernels.
Signed-off-by: Shaohua Li <shaohua.li@intel.com>
Tested-by: "Alex,Shi" <alex.shi@intel.com>
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
2011-06-14 05:26:25 +00:00
|
|
|
"TASKLET", "SCHED", "HRTIMER", "RCU"
|
2009-03-12 18:33:36 +00:00
|
|
|
};
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* we cannot loop indefinitely here to avoid userspace starvation,
|
|
|
|
* but we also don't want to introduce a worst case 1/HZ latency
|
|
|
|
* to the pending events, so lets the scheduler to balance
|
|
|
|
* the softirq load for us.
|
|
|
|
*/
|
2009-07-20 21:33:49 +00:00
|
|
|
static void wakeup_softirqd(void)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
/* Interrupts are disabled: no need to stop preemption */
|
2010-12-08 15:22:55 +00:00
|
|
|
struct task_struct *tsk = __this_cpu_read(ksoftirqd);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
if (tsk && tsk->state != TASK_RUNNING)
|
|
|
|
wake_up_process(tsk);
|
|
|
|
}
|
|
|
|
|
2010-10-05 00:03:16 +00:00
|
|
|
/*
|
|
|
|
* preempt_count and SOFTIRQ_OFFSET usage:
|
|
|
|
* - preempt_count is changed by SOFTIRQ_OFFSET on entering or leaving
|
|
|
|
* softirq processing.
|
|
|
|
* - preempt_count is changed by SOFTIRQ_DISABLE_OFFSET (= 2 * SOFTIRQ_OFFSET)
|
|
|
|
* on local_bh_disable or local_bh_enable.
|
|
|
|
* This lets us distinguish between whether we are currently processing
|
|
|
|
* softirq and whether we just have bh disabled.
|
|
|
|
*/
|
|
|
|
|
2006-07-03 07:24:42 +00:00
|
|
|
/*
|
|
|
|
* This one is for softirq.c-internal use,
|
|
|
|
* where hardirqs are disabled legitimately:
|
|
|
|
*/
|
2006-07-30 10:04:02 +00:00
|
|
|
#ifdef CONFIG_TRACE_IRQFLAGS
|
2010-10-05 00:03:16 +00:00
|
|
|
static void __local_bh_disable(unsigned long ip, unsigned int cnt)
|
2006-07-03 07:24:42 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
WARN_ON_ONCE(in_irq());
|
|
|
|
|
|
|
|
raw_local_irq_save(flags);
|
2009-01-23 00:01:40 +00:00
|
|
|
/*
|
|
|
|
* The preempt tracer hooks into add_preempt_count and will break
|
|
|
|
* lockdep because it calls back into lockdep after SOFTIRQ_OFFSET
|
|
|
|
* is set and before current->softirq_enabled is cleared.
|
|
|
|
* We must manually increment preempt_count here and manually
|
|
|
|
* call the trace_preempt_off later.
|
|
|
|
*/
|
2010-10-05 00:03:16 +00:00
|
|
|
preempt_count() += cnt;
|
2006-07-03 07:24:42 +00:00
|
|
|
/*
|
|
|
|
* Were softirqs turned off above:
|
|
|
|
*/
|
2010-10-05 00:03:16 +00:00
|
|
|
if (softirq_count() == cnt)
|
2006-07-03 07:24:42 +00:00
|
|
|
trace_softirqs_off(ip);
|
|
|
|
raw_local_irq_restore(flags);
|
2009-01-23 00:01:40 +00:00
|
|
|
|
2010-10-05 00:03:16 +00:00
|
|
|
if (preempt_count() == cnt)
|
2009-01-23 00:01:40 +00:00
|
|
|
trace_preempt_off(CALLER_ADDR0, get_parent_ip(CALLER_ADDR1));
|
2006-07-03 07:24:42 +00:00
|
|
|
}
|
2006-07-30 10:04:02 +00:00
|
|
|
#else /* !CONFIG_TRACE_IRQFLAGS */
|
2010-10-05 00:03:16 +00:00
|
|
|
static inline void __local_bh_disable(unsigned long ip, unsigned int cnt)
|
2006-07-30 10:04:02 +00:00
|
|
|
{
|
2010-10-05 00:03:16 +00:00
|
|
|
add_preempt_count(cnt);
|
2006-07-30 10:04:02 +00:00
|
|
|
barrier();
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_TRACE_IRQFLAGS */
|
2006-07-03 07:24:42 +00:00
|
|
|
|
|
|
|
void local_bh_disable(void)
|
|
|
|
{
|
2010-10-05 00:03:16 +00:00
|
|
|
__local_bh_disable((unsigned long)__builtin_return_address(0),
|
|
|
|
SOFTIRQ_DISABLE_OFFSET);
|
2006-07-03 07:24:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(local_bh_disable);
|
|
|
|
|
2010-10-05 00:03:16 +00:00
|
|
|
static void __local_bh_enable(unsigned int cnt)
|
|
|
|
{
|
|
|
|
WARN_ON_ONCE(in_irq());
|
|
|
|
WARN_ON_ONCE(!irqs_disabled());
|
|
|
|
|
|
|
|
if (softirq_count() == cnt)
|
|
|
|
trace_softirqs_on((unsigned long)__builtin_return_address(0));
|
|
|
|
sub_preempt_count(cnt);
|
|
|
|
}
|
|
|
|
|
2006-07-03 07:24:42 +00:00
|
|
|
/*
|
|
|
|
* Special-case - softirqs can safely be enabled in
|
|
|
|
* cond_resched_softirq(), or by __do_softirq(),
|
|
|
|
* without processing still-pending softirqs:
|
|
|
|
*/
|
|
|
|
void _local_bh_enable(void)
|
|
|
|
{
|
2010-10-05 00:03:16 +00:00
|
|
|
__local_bh_enable(SOFTIRQ_DISABLE_OFFSET);
|
2006-07-03 07:24:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(_local_bh_enable);
|
|
|
|
|
2008-06-18 07:29:37 +00:00
|
|
|
static inline void _local_bh_enable_ip(unsigned long ip)
|
2006-07-03 07:24:42 +00:00
|
|
|
{
|
2008-06-18 07:29:37 +00:00
|
|
|
WARN_ON_ONCE(in_irq() || irqs_disabled());
|
2006-07-30 10:04:02 +00:00
|
|
|
#ifdef CONFIG_TRACE_IRQFLAGS
|
2008-06-18 07:29:37 +00:00
|
|
|
local_irq_disable();
|
2006-07-30 10:04:02 +00:00
|
|
|
#endif
|
2006-07-03 07:24:42 +00:00
|
|
|
/*
|
|
|
|
* Are softirqs going to be turned on now:
|
|
|
|
*/
|
2010-10-05 00:03:16 +00:00
|
|
|
if (softirq_count() == SOFTIRQ_DISABLE_OFFSET)
|
2008-06-18 07:29:37 +00:00
|
|
|
trace_softirqs_on(ip);
|
2006-07-03 07:24:42 +00:00
|
|
|
/*
|
|
|
|
* Keep preemption disabled until we are done with
|
|
|
|
* softirq processing:
|
|
|
|
*/
|
2010-10-05 00:03:16 +00:00
|
|
|
sub_preempt_count(SOFTIRQ_DISABLE_OFFSET - 1);
|
2006-07-03 07:24:42 +00:00
|
|
|
|
|
|
|
if (unlikely(!in_interrupt() && local_softirq_pending()))
|
|
|
|
do_softirq();
|
|
|
|
|
|
|
|
dec_preempt_count();
|
2006-07-30 10:04:02 +00:00
|
|
|
#ifdef CONFIG_TRACE_IRQFLAGS
|
2008-06-18 07:29:37 +00:00
|
|
|
local_irq_enable();
|
2006-07-30 10:04:02 +00:00
|
|
|
#endif
|
2006-07-03 07:24:42 +00:00
|
|
|
preempt_check_resched();
|
|
|
|
}
|
2008-06-18 07:29:37 +00:00
|
|
|
|
|
|
|
void local_bh_enable(void)
|
|
|
|
{
|
|
|
|
_local_bh_enable_ip((unsigned long)__builtin_return_address(0));
|
|
|
|
}
|
2006-07-03 07:24:42 +00:00
|
|
|
EXPORT_SYMBOL(local_bh_enable);
|
|
|
|
|
|
|
|
void local_bh_enable_ip(unsigned long ip)
|
|
|
|
{
|
2008-06-18 07:29:37 +00:00
|
|
|
_local_bh_enable_ip(ip);
|
2006-07-03 07:24:42 +00:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(local_bh_enable_ip);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* We restart softirq processing MAX_SOFTIRQ_RESTART times,
|
|
|
|
* and we fall back to softirqd after that.
|
|
|
|
*
|
|
|
|
* This number has been established via experimentation.
|
|
|
|
* The two things to balance is latency against fairness -
|
|
|
|
* we want to handle softirqs as soon as possible, but they
|
|
|
|
* should not be able to lock up the box.
|
|
|
|
*/
|
|
|
|
#define MAX_SOFTIRQ_RESTART 10
|
|
|
|
|
|
|
|
asmlinkage void __do_softirq(void)
|
|
|
|
{
|
|
|
|
struct softirq_action *h;
|
|
|
|
__u32 pending;
|
|
|
|
int max_restart = MAX_SOFTIRQ_RESTART;
|
|
|
|
int cpu;
|
|
|
|
|
|
|
|
pending = local_softirq_pending();
|
2006-07-03 07:25:40 +00:00
|
|
|
account_system_vtime(current);
|
|
|
|
|
2010-10-05 00:03:16 +00:00
|
|
|
__local_bh_disable((unsigned long)__builtin_return_address(0),
|
|
|
|
SOFTIRQ_OFFSET);
|
2009-03-13 00:30:40 +00:00
|
|
|
lockdep_softirq_enter();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
cpu = smp_processor_id();
|
|
|
|
restart:
|
|
|
|
/* Reset the pending bitmask before enabling irqs */
|
2005-09-12 16:49:24 +00:00
|
|
|
set_softirq_pending(0);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2005-07-30 17:22:49 +00:00
|
|
|
local_irq_enable();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
h = softirq_vec;
|
|
|
|
|
|
|
|
do {
|
|
|
|
if (pending & 1) {
|
2010-10-19 13:00:13 +00:00
|
|
|
unsigned int vec_nr = h - softirq_vec;
|
2008-10-02 08:50:53 +00:00
|
|
|
int prev_count = preempt_count();
|
|
|
|
|
2010-10-19 13:00:13 +00:00
|
|
|
kstat_incr_softirqs_this_cpu(vec_nr);
|
|
|
|
|
|
|
|
trace_softirq_entry(vec_nr);
|
2005-04-16 22:20:36 +00:00
|
|
|
h->action(h);
|
2010-10-19 13:00:13 +00:00
|
|
|
trace_softirq_exit(vec_nr);
|
2008-10-02 08:50:53 +00:00
|
|
|
if (unlikely(prev_count != preempt_count())) {
|
2010-10-19 13:00:13 +00:00
|
|
|
printk(KERN_ERR "huh, entered softirq %u %s %p"
|
2008-10-02 08:50:53 +00:00
|
|
|
"with preempt_count %08x,"
|
2010-10-19 13:00:13 +00:00
|
|
|
" exited with %08x?\n", vec_nr,
|
|
|
|
softirq_to_name[vec_nr], h->action,
|
|
|
|
prev_count, preempt_count());
|
2008-10-02 08:50:53 +00:00
|
|
|
preempt_count() = prev_count;
|
|
|
|
}
|
|
|
|
|
2009-08-22 20:56:46 +00:00
|
|
|
rcu_bh_qs(cpu);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
h++;
|
|
|
|
pending >>= 1;
|
|
|
|
} while (pending);
|
|
|
|
|
2005-07-30 17:22:49 +00:00
|
|
|
local_irq_disable();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
pending = local_softirq_pending();
|
|
|
|
if (pending && --max_restart)
|
|
|
|
goto restart;
|
|
|
|
|
|
|
|
if (pending)
|
|
|
|
wakeup_softirqd();
|
|
|
|
|
2009-03-13 00:30:40 +00:00
|
|
|
lockdep_softirq_exit();
|
2006-07-03 07:25:40 +00:00
|
|
|
|
|
|
|
account_system_vtime(current);
|
2010-10-05 00:03:16 +00:00
|
|
|
__local_bh_enable(SOFTIRQ_OFFSET);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef __ARCH_HAS_DO_SOFTIRQ
|
|
|
|
|
|
|
|
asmlinkage void do_softirq(void)
|
|
|
|
{
|
|
|
|
__u32 pending;
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
if (in_interrupt())
|
|
|
|
return;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
|
|
|
|
pending = local_softirq_pending();
|
|
|
|
|
|
|
|
if (pending)
|
|
|
|
__do_softirq();
|
|
|
|
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2007-02-16 09:27:45 +00:00
|
|
|
/*
|
|
|
|
* Enter an interrupt context.
|
|
|
|
*/
|
|
|
|
void irq_enter(void)
|
|
|
|
{
|
2008-01-30 12:30:04 +00:00
|
|
|
int cpu = smp_processor_id();
|
2008-10-17 07:59:47 +00:00
|
|
|
|
"Tree RCU": scalable classic RCU implementation
This patch fixes a long-standing performance bug in classic RCU that
results in massive internal-to-RCU lock contention on systems with
more than a few hundred CPUs. Although this patch creates a separate
flavor of RCU for ease of review and patch maintenance, it is intended
to replace classic RCU.
This patch still handles stress better than does mainline, so I am still
calling it ready for inclusion. This patch is against the -tip tree.
Nevertheless, experience on an actual 1000+ CPU machine would still be
most welcome.
Most of the changes noted below were found while creating an rcutiny
(which should permit ejecting the current rcuclassic) and while doing
detailed line-by-line documentation.
Updates from v9 (http://lkml.org/lkml/2008/12/2/334):
o Fixes from remainder of line-by-line code walkthrough,
including comment spelling, initialization, undesirable
narrowing due to type conversion, removing redundant memory
barriers, removing redundant local-variable initialization,
and removing redundant local variables.
I do not believe that any of these fixes address the CPU-hotplug
issues that Andi Kleen was seeing, but please do give it a whirl
in case the machine is smarter than I am.
A writeup from the walkthrough may be found at the following
URL, in case you are suffering from terminal insomnia or
masochism:
http://www.kernel.org/pub/linux/kernel/people/paulmck/tmp/rcutree-walkthrough.2008.12.16a.pdf
o Made rcutree tracing use seq_file, as suggested some time
ago by Lai Jiangshan.
o Added a .csv variant of the rcudata debugfs trace file, to allow
people having thousands of CPUs to drop the data into
a spreadsheet. Tested with oocalc and gnumeric. Updated
documentation to suit.
Updates from v8 (http://lkml.org/lkml/2008/11/15/139):
o Fix a theoretical race between grace-period initialization and
force_quiescent_state() that could occur if more than three
jiffies were required to carry out the grace-period
initialization. Which it might, if you had enough CPUs.
o Apply Ingo's printk-standardization patch.
o Substitute local variables for repeated accesses to global
variables.
o Fix comment misspellings and redundant (but harmless) increments
of ->n_rcu_pending (this latter after having explicitly added it).
o Apply checkpatch fixes.
Updates from v7 (http://lkml.org/lkml/2008/10/10/291):
o Fixed a number of problems noted by Gautham Shenoy, including
the cpu-stall-detection bug that he was having difficulty
convincing me was real. ;-)
o Changed cpu-stall detection to wait for ten seconds rather than
three in order to reduce false positive, as suggested by Ingo
Molnar.
o Produced a design document (http://lwn.net/Articles/305782/).
The act of writing this document uncovered a number of both
theoretical and "here and now" bugs as noted below.
o Fix dynticks_nesting accounting confusion, simplify WARN_ON()
condition, fix kerneldoc comments, and add memory barriers
in dynticks interface functions.
o Add more data to tracing.
o Remove unused "rcu_barrier" field from rcu_data structure.
o Count calls to rcu_pending() from scheduling-clock interrupt
to use as a surrogate timebase should jiffies stop counting.
o Fix a theoretical race between force_quiescent_state() and
grace-period initialization. Yes, initialization does have to
go on for some jiffies for this race to occur, but given enough
CPUs...
Updates from v6 (http://lkml.org/lkml/2008/9/23/448):
o Fix a number of checkpatch.pl complaints.
o Apply review comments from Ingo Molnar and Lai Jiangshan
on the stall-detection code.
o Fix several bugs in !CONFIG_SMP builds.
o Fix a misspelled config-parameter name so that RCU now announces
at boot time if stall detection is configured.
o Run tests on numerous combinations of configurations parameters,
which after the fixes above, now build and run correctly.
Updates from v5 (http://lkml.org/lkml/2008/9/15/92, bad subject line):
o Fix a compiler error in the !CONFIG_FANOUT_EXACT case (blew a
changeset some time ago, and finally got around to retesting
this option).
o Fix some tracing bugs in rcupreempt that caused incorrect
totals to be printed.
o I now test with a more brutal random-selection online/offline
script (attached). Probably more brutal than it needs to be
on the people reading it as well, but so it goes.
o A number of optimizations and usability improvements:
o Make rcu_pending() ignore the grace-period timeout when
there is no grace period in progress.
o Make force_quiescent_state() avoid going for a global
lock in the case where there is no grace period in
progress.
o Rearrange struct fields to improve struct layout.
o Make call_rcu() initiate a grace period if RCU was
idle, rather than waiting for the next scheduling
clock interrupt.
o Invoke rcu_irq_enter() and rcu_irq_exit() only when
idle, as suggested by Andi Kleen. I still don't
completely trust this change, and might back it out.
o Make CONFIG_RCU_TRACE be the single config variable
manipulated for all forms of RCU, instead of the prior
confusion.
o Document tracing files and formats for both rcupreempt
and rcutree.
Updates from v4 for those missing v5 given its bad subject line:
o Separated dynticks interface so that NMIs and irqs call separate
functions, greatly simplifying it. In particular, this code
no longer requires a proof of correctness. ;-)
o Separated dynticks state out into its own per-CPU structure,
avoiding the duplicated accounting.
o The case where a dynticks-idle CPU runs an irq handler that
invokes call_rcu() is now correctly handled, forcing that CPU
out of dynticks-idle mode.
o Review comments have been applied (thank you all!!!).
For but one example, fixed the dynticks-ordering issue that
Manfred pointed out, saving me much debugging. ;-)
o Adjusted rcuclassic and rcupreempt to handle dynticks changes.
Attached is an updated patch to Classic RCU that applies a hierarchy,
greatly reducing the contention on the top-level lock for large machines.
This passes 10-hour concurrent rcutorture and online-offline testing on
128-CPU ppc64 without dynticks enabled, and exposes some timekeeping
bugs in presence of dynticks (exciting working on a system where
"sleep 1" hangs until interrupted...), which were fixed in the
2.6.27 kernel. It is getting more reliable than mainline by some
measures, so the next version will be against -tip for inclusion.
See also Manfred Spraul's recent patches (or his earlier work from
2004 at http://marc.info/?l=linux-kernel&m=108546384711797&w=2).
We will converge onto a common patch in the fullness of time, but are
currently exploring different regions of the design space. That said,
I have already gratefully stolen quite a few of Manfred's ideas.
This patch provides CONFIG_RCU_FANOUT, which controls the bushiness
of the RCU hierarchy. Defaults to 32 on 32-bit machines and 64 on
64-bit machines. If CONFIG_NR_CPUS is less than CONFIG_RCU_FANOUT,
there is no hierarchy. By default, the RCU initialization code will
adjust CONFIG_RCU_FANOUT to balance the hierarchy, so strongly NUMA
architectures may choose to set CONFIG_RCU_FANOUT_EXACT to disable
this balancing, allowing the hierarchy to be exactly aligned to the
underlying hardware. Up to two levels of hierarchy are permitted
(in addition to the root node), allowing up to 16,384 CPUs on 32-bit
systems and up to 262,144 CPUs on 64-bit systems. I just know that I
am going to regret saying this, but this seems more than sufficient
for the foreseeable future. (Some architectures might wish to set
CONFIG_RCU_FANOUT=4, which would limit such architectures to 64 CPUs.
If this becomes a real problem, additional levels can be added, but I
doubt that it will make a significant difference on real hardware.)
In the common case, a given CPU will manipulate its private rcu_data
structure and the rcu_node structure that it shares with its immediate
neighbors. This can reduce both lock and memory contention by multiple
orders of magnitude, which should eliminate the need for the strange
manipulations that are reported to be required when running Linux on
very large systems.
Some shortcomings:
o More bugs will probably surface as a result of an ongoing
line-by-line code inspection.
Patches will be provided as required.
o There are probably hangs, rcutorture failures, &c. Seems
quite stable on a 128-CPU machine, but that is kind of small
compared to 4096 CPUs. However, seems to do better than
mainline.
Patches will be provided as required.
o The memory footprint of this version is several KB larger
than rcuclassic.
A separate UP-only rcutiny patch will be provided, which will
reduce the memory footprint significantly, even compared
to the old rcuclassic. One such patch passes light testing,
and has a memory footprint smaller even than rcuclassic.
Initial reaction from various embedded guys was "it is not
worth it", so am putting it aside.
Credits:
o Manfred Spraul for ideas, review comments, and bugs spotted,
as well as some good friendly competition. ;-)
o Josh Triplett, Ingo Molnar, Peter Zijlstra, Mathieu Desnoyers,
Lai Jiangshan, Andi Kleen, Andy Whitcroft, and Andrew Morton
for reviews and comments.
o Thomas Gleixner for much-needed help with some timer issues
(see patches below).
o Jon M. Tollefson, Tim Pepper, Andrew Theurer, Jose R. Santos,
Andy Whitcroft, Darrick Wong, Nishanth Aravamudan, Anton
Blanchard, Dave Kleikamp, and Nathan Lynch for keeping machines
alive despite my heavy abuse^Wtesting.
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-12-18 20:55:32 +00:00
|
|
|
rcu_irq_enter();
|
2008-11-07 10:06:00 +00:00
|
|
|
if (idle_cpu(cpu) && !in_interrupt()) {
|
2010-10-05 00:03:23 +00:00
|
|
|
/*
|
|
|
|
* Prevent raise_softirq from needlessly waking up ksoftirqd
|
|
|
|
* here, as softirq will be serviced on return from interrupt.
|
|
|
|
*/
|
|
|
|
local_bh_disable();
|
2008-10-17 07:59:47 +00:00
|
|
|
tick_check_idle(cpu);
|
2010-10-05 00:03:23 +00:00
|
|
|
_local_bh_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
__irq_enter();
|
2007-02-16 09:27:45 +00:00
|
|
|
}
|
|
|
|
|
2011-02-23 23:52:23 +00:00
|
|
|
static inline void invoke_softirq(void)
|
|
|
|
{
|
2012-03-05 23:07:25 +00:00
|
|
|
if (!force_irqthreads) {
|
|
|
|
#ifdef __ARCH_IRQ_EXIT_IRQS_DISABLED
|
2011-02-23 23:52:23 +00:00
|
|
|
__do_softirq();
|
2005-04-16 22:20:36 +00:00
|
|
|
#else
|
2011-02-23 23:52:23 +00:00
|
|
|
do_softirq();
|
2012-03-05 23:07:25 +00:00
|
|
|
#endif
|
|
|
|
} else {
|
2011-07-19 22:32:00 +00:00
|
|
|
__local_bh_disable((unsigned long)__builtin_return_address(0),
|
|
|
|
SOFTIRQ_OFFSET);
|
2011-02-23 23:52:23 +00:00
|
|
|
wakeup_softirqd();
|
2011-07-19 22:32:00 +00:00
|
|
|
__local_bh_enable(SOFTIRQ_OFFSET);
|
|
|
|
}
|
2011-02-23 23:52:23 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Exit an interrupt context. Process softirqs if needed and possible:
|
|
|
|
*/
|
|
|
|
void irq_exit(void)
|
|
|
|
{
|
|
|
|
account_system_vtime(current);
|
2006-07-03 07:24:42 +00:00
|
|
|
trace_hardirq_exit();
|
2005-04-16 22:20:36 +00:00
|
|
|
sub_preempt_count(IRQ_EXIT_OFFSET);
|
|
|
|
if (!in_interrupt() && local_softirq_pending())
|
|
|
|
invoke_softirq();
|
2007-02-16 09:28:03 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_NO_HZ
|
|
|
|
/* Make sure that timer wheel updates are propagated */
|
"Tree RCU": scalable classic RCU implementation
This patch fixes a long-standing performance bug in classic RCU that
results in massive internal-to-RCU lock contention on systems with
more than a few hundred CPUs. Although this patch creates a separate
flavor of RCU for ease of review and patch maintenance, it is intended
to replace classic RCU.
This patch still handles stress better than does mainline, so I am still
calling it ready for inclusion. This patch is against the -tip tree.
Nevertheless, experience on an actual 1000+ CPU machine would still be
most welcome.
Most of the changes noted below were found while creating an rcutiny
(which should permit ejecting the current rcuclassic) and while doing
detailed line-by-line documentation.
Updates from v9 (http://lkml.org/lkml/2008/12/2/334):
o Fixes from remainder of line-by-line code walkthrough,
including comment spelling, initialization, undesirable
narrowing due to type conversion, removing redundant memory
barriers, removing redundant local-variable initialization,
and removing redundant local variables.
I do not believe that any of these fixes address the CPU-hotplug
issues that Andi Kleen was seeing, but please do give it a whirl
in case the machine is smarter than I am.
A writeup from the walkthrough may be found at the following
URL, in case you are suffering from terminal insomnia or
masochism:
http://www.kernel.org/pub/linux/kernel/people/paulmck/tmp/rcutree-walkthrough.2008.12.16a.pdf
o Made rcutree tracing use seq_file, as suggested some time
ago by Lai Jiangshan.
o Added a .csv variant of the rcudata debugfs trace file, to allow
people having thousands of CPUs to drop the data into
a spreadsheet. Tested with oocalc and gnumeric. Updated
documentation to suit.
Updates from v8 (http://lkml.org/lkml/2008/11/15/139):
o Fix a theoretical race between grace-period initialization and
force_quiescent_state() that could occur if more than three
jiffies were required to carry out the grace-period
initialization. Which it might, if you had enough CPUs.
o Apply Ingo's printk-standardization patch.
o Substitute local variables for repeated accesses to global
variables.
o Fix comment misspellings and redundant (but harmless) increments
of ->n_rcu_pending (this latter after having explicitly added it).
o Apply checkpatch fixes.
Updates from v7 (http://lkml.org/lkml/2008/10/10/291):
o Fixed a number of problems noted by Gautham Shenoy, including
the cpu-stall-detection bug that he was having difficulty
convincing me was real. ;-)
o Changed cpu-stall detection to wait for ten seconds rather than
three in order to reduce false positive, as suggested by Ingo
Molnar.
o Produced a design document (http://lwn.net/Articles/305782/).
The act of writing this document uncovered a number of both
theoretical and "here and now" bugs as noted below.
o Fix dynticks_nesting accounting confusion, simplify WARN_ON()
condition, fix kerneldoc comments, and add memory barriers
in dynticks interface functions.
o Add more data to tracing.
o Remove unused "rcu_barrier" field from rcu_data structure.
o Count calls to rcu_pending() from scheduling-clock interrupt
to use as a surrogate timebase should jiffies stop counting.
o Fix a theoretical race between force_quiescent_state() and
grace-period initialization. Yes, initialization does have to
go on for some jiffies for this race to occur, but given enough
CPUs...
Updates from v6 (http://lkml.org/lkml/2008/9/23/448):
o Fix a number of checkpatch.pl complaints.
o Apply review comments from Ingo Molnar and Lai Jiangshan
on the stall-detection code.
o Fix several bugs in !CONFIG_SMP builds.
o Fix a misspelled config-parameter name so that RCU now announces
at boot time if stall detection is configured.
o Run tests on numerous combinations of configurations parameters,
which after the fixes above, now build and run correctly.
Updates from v5 (http://lkml.org/lkml/2008/9/15/92, bad subject line):
o Fix a compiler error in the !CONFIG_FANOUT_EXACT case (blew a
changeset some time ago, and finally got around to retesting
this option).
o Fix some tracing bugs in rcupreempt that caused incorrect
totals to be printed.
o I now test with a more brutal random-selection online/offline
script (attached). Probably more brutal than it needs to be
on the people reading it as well, but so it goes.
o A number of optimizations and usability improvements:
o Make rcu_pending() ignore the grace-period timeout when
there is no grace period in progress.
o Make force_quiescent_state() avoid going for a global
lock in the case where there is no grace period in
progress.
o Rearrange struct fields to improve struct layout.
o Make call_rcu() initiate a grace period if RCU was
idle, rather than waiting for the next scheduling
clock interrupt.
o Invoke rcu_irq_enter() and rcu_irq_exit() only when
idle, as suggested by Andi Kleen. I still don't
completely trust this change, and might back it out.
o Make CONFIG_RCU_TRACE be the single config variable
manipulated for all forms of RCU, instead of the prior
confusion.
o Document tracing files and formats for both rcupreempt
and rcutree.
Updates from v4 for those missing v5 given its bad subject line:
o Separated dynticks interface so that NMIs and irqs call separate
functions, greatly simplifying it. In particular, this code
no longer requires a proof of correctness. ;-)
o Separated dynticks state out into its own per-CPU structure,
avoiding the duplicated accounting.
o The case where a dynticks-idle CPU runs an irq handler that
invokes call_rcu() is now correctly handled, forcing that CPU
out of dynticks-idle mode.
o Review comments have been applied (thank you all!!!).
For but one example, fixed the dynticks-ordering issue that
Manfred pointed out, saving me much debugging. ;-)
o Adjusted rcuclassic and rcupreempt to handle dynticks changes.
Attached is an updated patch to Classic RCU that applies a hierarchy,
greatly reducing the contention on the top-level lock for large machines.
This passes 10-hour concurrent rcutorture and online-offline testing on
128-CPU ppc64 without dynticks enabled, and exposes some timekeeping
bugs in presence of dynticks (exciting working on a system where
"sleep 1" hangs until interrupted...), which were fixed in the
2.6.27 kernel. It is getting more reliable than mainline by some
measures, so the next version will be against -tip for inclusion.
See also Manfred Spraul's recent patches (or his earlier work from
2004 at http://marc.info/?l=linux-kernel&m=108546384711797&w=2).
We will converge onto a common patch in the fullness of time, but are
currently exploring different regions of the design space. That said,
I have already gratefully stolen quite a few of Manfred's ideas.
This patch provides CONFIG_RCU_FANOUT, which controls the bushiness
of the RCU hierarchy. Defaults to 32 on 32-bit machines and 64 on
64-bit machines. If CONFIG_NR_CPUS is less than CONFIG_RCU_FANOUT,
there is no hierarchy. By default, the RCU initialization code will
adjust CONFIG_RCU_FANOUT to balance the hierarchy, so strongly NUMA
architectures may choose to set CONFIG_RCU_FANOUT_EXACT to disable
this balancing, allowing the hierarchy to be exactly aligned to the
underlying hardware. Up to two levels of hierarchy are permitted
(in addition to the root node), allowing up to 16,384 CPUs on 32-bit
systems and up to 262,144 CPUs on 64-bit systems. I just know that I
am going to regret saying this, but this seems more than sufficient
for the foreseeable future. (Some architectures might wish to set
CONFIG_RCU_FANOUT=4, which would limit such architectures to 64 CPUs.
If this becomes a real problem, additional levels can be added, but I
doubt that it will make a significant difference on real hardware.)
In the common case, a given CPU will manipulate its private rcu_data
structure and the rcu_node structure that it shares with its immediate
neighbors. This can reduce both lock and memory contention by multiple
orders of magnitude, which should eliminate the need for the strange
manipulations that are reported to be required when running Linux on
very large systems.
Some shortcomings:
o More bugs will probably surface as a result of an ongoing
line-by-line code inspection.
Patches will be provided as required.
o There are probably hangs, rcutorture failures, &c. Seems
quite stable on a 128-CPU machine, but that is kind of small
compared to 4096 CPUs. However, seems to do better than
mainline.
Patches will be provided as required.
o The memory footprint of this version is several KB larger
than rcuclassic.
A separate UP-only rcutiny patch will be provided, which will
reduce the memory footprint significantly, even compared
to the old rcuclassic. One such patch passes light testing,
and has a memory footprint smaller even than rcuclassic.
Initial reaction from various embedded guys was "it is not
worth it", so am putting it aside.
Credits:
o Manfred Spraul for ideas, review comments, and bugs spotted,
as well as some good friendly competition. ;-)
o Josh Triplett, Ingo Molnar, Peter Zijlstra, Mathieu Desnoyers,
Lai Jiangshan, Andi Kleen, Andy Whitcroft, and Andrew Morton
for reviews and comments.
o Thomas Gleixner for much-needed help with some timer issues
(see patches below).
o Jon M. Tollefson, Tim Pepper, Andrew Theurer, Jose R. Santos,
Andy Whitcroft, Darrick Wong, Nishanth Aravamudan, Anton
Blanchard, Dave Kleikamp, and Nathan Lynch for keeping machines
alive despite my heavy abuse^Wtesting.
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-12-18 20:55:32 +00:00
|
|
|
if (idle_cpu(smp_processor_id()) && !in_interrupt() && !need_resched())
|
2011-10-07 16:22:06 +00:00
|
|
|
tick_nohz_irq_exit();
|
2007-02-16 09:28:03 +00:00
|
|
|
#endif
|
2011-10-07 23:31:02 +00:00
|
|
|
rcu_irq_exit();
|
2011-03-21 12:32:17 +00:00
|
|
|
sched_preempt_enable_no_resched();
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function must run with irqs disabled!
|
|
|
|
*/
|
2008-02-08 12:19:53 +00:00
|
|
|
inline void raise_softirq_irqoff(unsigned int nr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
__raise_softirq_irqoff(nr);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we're in an interrupt or softirq, we're done
|
|
|
|
* (this also catches softirq-disabled code). We will
|
|
|
|
* actually run the softirq once we return from
|
|
|
|
* the irq or softirq.
|
|
|
|
*
|
|
|
|
* Otherwise we wake up ksoftirqd to make sure we
|
|
|
|
* schedule the softirq soon.
|
|
|
|
*/
|
|
|
|
if (!in_interrupt())
|
|
|
|
wakeup_softirqd();
|
|
|
|
}
|
|
|
|
|
2008-02-08 12:19:53 +00:00
|
|
|
void raise_softirq(unsigned int nr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
raise_softirq_irqoff(nr);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
2012-01-26 01:18:55 +00:00
|
|
|
void __raise_softirq_irqoff(unsigned int nr)
|
|
|
|
{
|
|
|
|
trace_softirq_raise(nr);
|
|
|
|
or_softirq_pending(1UL << nr);
|
|
|
|
}
|
|
|
|
|
Remove argument from open_softirq which is always NULL
As git-grep shows, open_softirq() is always called with the last argument
being NULL
block/blk-core.c: open_softirq(BLOCK_SOFTIRQ, blk_done_softirq, NULL);
kernel/hrtimer.c: open_softirq(HRTIMER_SOFTIRQ, run_hrtimer_softirq, NULL);
kernel/rcuclassic.c: open_softirq(RCU_SOFTIRQ, rcu_process_callbacks, NULL);
kernel/rcupreempt.c: open_softirq(RCU_SOFTIRQ, rcu_process_callbacks, NULL);
kernel/sched.c: open_softirq(SCHED_SOFTIRQ, run_rebalance_domains, NULL);
kernel/softirq.c: open_softirq(TASKLET_SOFTIRQ, tasklet_action, NULL);
kernel/softirq.c: open_softirq(HI_SOFTIRQ, tasklet_hi_action, NULL);
kernel/timer.c: open_softirq(TIMER_SOFTIRQ, run_timer_softirq, NULL);
net/core/dev.c: open_softirq(NET_TX_SOFTIRQ, net_tx_action, NULL);
net/core/dev.c: open_softirq(NET_RX_SOFTIRQ, net_rx_action, NULL);
This observation has already been made by Matthew Wilcox in June 2002
(http://www.cs.helsinki.fi/linux/linux-kernel/2002-25/0687.html)
"I notice that none of the current softirq routines use the data element
passed to them."
and the situation hasn't changed since them. So it appears we can safely
remove that extra argument to save 128 (54) bytes of kernel data (text).
Signed-off-by: Carlos R. Mafra <crmafra@ift.unesp.br>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2008-05-15 14:15:37 +00:00
|
|
|
void open_softirq(int nr, void (*action)(struct softirq_action *))
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
softirq_vec[nr].action = action;
|
|
|
|
}
|
|
|
|
|
2009-07-22 12:18:35 +00:00
|
|
|
/*
|
|
|
|
* Tasklets
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
struct tasklet_head
|
|
|
|
{
|
2008-03-04 23:23:25 +00:00
|
|
|
struct tasklet_struct *head;
|
|
|
|
struct tasklet_struct **tail;
|
2005-04-16 22:20:36 +00:00
|
|
|
};
|
|
|
|
|
2008-06-12 21:21:53 +00:00
|
|
|
static DEFINE_PER_CPU(struct tasklet_head, tasklet_vec);
|
|
|
|
static DEFINE_PER_CPU(struct tasklet_head, tasklet_hi_vec);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-02-08 12:19:53 +00:00
|
|
|
void __tasklet_schedule(struct tasklet_struct *t)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
2008-03-04 23:23:25 +00:00
|
|
|
t->next = NULL;
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_vec.tail) = t;
|
|
|
|
__this_cpu_write(tasklet_vec.tail, &(t->next));
|
2005-04-16 22:20:36 +00:00
|
|
|
raise_softirq_irqoff(TASKLET_SOFTIRQ);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(__tasklet_schedule);
|
|
|
|
|
2008-02-08 12:19:53 +00:00
|
|
|
void __tasklet_hi_schedule(struct tasklet_struct *t)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
2008-03-04 23:23:25 +00:00
|
|
|
t->next = NULL;
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_hi_vec.tail) = t;
|
|
|
|
__this_cpu_write(tasklet_hi_vec.tail, &(t->next));
|
2005-04-16 22:20:36 +00:00
|
|
|
raise_softirq_irqoff(HI_SOFTIRQ);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(__tasklet_hi_schedule);
|
|
|
|
|
2008-05-21 20:53:13 +00:00
|
|
|
void __tasklet_hi_schedule_first(struct tasklet_struct *t)
|
|
|
|
{
|
|
|
|
BUG_ON(!irqs_disabled());
|
|
|
|
|
2010-12-08 15:22:55 +00:00
|
|
|
t->next = __this_cpu_read(tasklet_hi_vec.head);
|
|
|
|
__this_cpu_write(tasklet_hi_vec.head, t);
|
2008-05-21 20:53:13 +00:00
|
|
|
__raise_softirq_irqoff(HI_SOFTIRQ);
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(__tasklet_hi_schedule_first);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static void tasklet_action(struct softirq_action *a)
|
|
|
|
{
|
|
|
|
struct tasklet_struct *list;
|
|
|
|
|
|
|
|
local_irq_disable();
|
2010-12-08 15:22:55 +00:00
|
|
|
list = __this_cpu_read(tasklet_vec.head);
|
|
|
|
__this_cpu_write(tasklet_vec.head, NULL);
|
|
|
|
__this_cpu_write(tasklet_vec.tail, &__get_cpu_var(tasklet_vec).head);
|
2005-04-16 22:20:36 +00:00
|
|
|
local_irq_enable();
|
|
|
|
|
|
|
|
while (list) {
|
|
|
|
struct tasklet_struct *t = list;
|
|
|
|
|
|
|
|
list = list->next;
|
|
|
|
|
|
|
|
if (tasklet_trylock(t)) {
|
|
|
|
if (!atomic_read(&t->count)) {
|
|
|
|
if (!test_and_clear_bit(TASKLET_STATE_SCHED, &t->state))
|
|
|
|
BUG();
|
|
|
|
t->func(t->data);
|
|
|
|
tasklet_unlock(t);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
tasklet_unlock(t);
|
|
|
|
}
|
|
|
|
|
|
|
|
local_irq_disable();
|
2008-03-04 23:23:25 +00:00
|
|
|
t->next = NULL;
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_vec.tail) = t;
|
|
|
|
__this_cpu_write(tasklet_vec.tail, &(t->next));
|
2005-04-16 22:20:36 +00:00
|
|
|
__raise_softirq_irqoff(TASKLET_SOFTIRQ);
|
|
|
|
local_irq_enable();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tasklet_hi_action(struct softirq_action *a)
|
|
|
|
{
|
|
|
|
struct tasklet_struct *list;
|
|
|
|
|
|
|
|
local_irq_disable();
|
2010-12-08 15:22:55 +00:00
|
|
|
list = __this_cpu_read(tasklet_hi_vec.head);
|
|
|
|
__this_cpu_write(tasklet_hi_vec.head, NULL);
|
|
|
|
__this_cpu_write(tasklet_hi_vec.tail, &__get_cpu_var(tasklet_hi_vec).head);
|
2005-04-16 22:20:36 +00:00
|
|
|
local_irq_enable();
|
|
|
|
|
|
|
|
while (list) {
|
|
|
|
struct tasklet_struct *t = list;
|
|
|
|
|
|
|
|
list = list->next;
|
|
|
|
|
|
|
|
if (tasklet_trylock(t)) {
|
|
|
|
if (!atomic_read(&t->count)) {
|
|
|
|
if (!test_and_clear_bit(TASKLET_STATE_SCHED, &t->state))
|
|
|
|
BUG();
|
|
|
|
t->func(t->data);
|
|
|
|
tasklet_unlock(t);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
tasklet_unlock(t);
|
|
|
|
}
|
|
|
|
|
|
|
|
local_irq_disable();
|
2008-03-04 23:23:25 +00:00
|
|
|
t->next = NULL;
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_hi_vec.tail) = t;
|
|
|
|
__this_cpu_write(tasklet_hi_vec.tail, &(t->next));
|
2005-04-16 22:20:36 +00:00
|
|
|
__raise_softirq_irqoff(HI_SOFTIRQ);
|
|
|
|
local_irq_enable();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void tasklet_init(struct tasklet_struct *t,
|
|
|
|
void (*func)(unsigned long), unsigned long data)
|
|
|
|
{
|
|
|
|
t->next = NULL;
|
|
|
|
t->state = 0;
|
|
|
|
atomic_set(&t->count, 0);
|
|
|
|
t->func = func;
|
|
|
|
t->data = data;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(tasklet_init);
|
|
|
|
|
|
|
|
void tasklet_kill(struct tasklet_struct *t)
|
|
|
|
{
|
|
|
|
if (in_interrupt())
|
|
|
|
printk("Attempt to kill tasklet from interrupt\n");
|
|
|
|
|
|
|
|
while (test_and_set_bit(TASKLET_STATE_SCHED, &t->state)) {
|
2009-04-16 23:30:18 +00:00
|
|
|
do {
|
2005-04-16 22:20:36 +00:00
|
|
|
yield();
|
2009-04-16 23:30:18 +00:00
|
|
|
} while (test_bit(TASKLET_STATE_SCHED, &t->state));
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
tasklet_unlock_wait(t);
|
|
|
|
clear_bit(TASKLET_STATE_SCHED, &t->state);
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL(tasklet_kill);
|
|
|
|
|
2009-07-22 12:18:35 +00:00
|
|
|
/*
|
|
|
|
* tasklet_hrtimer
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2010-02-03 17:08:52 +00:00
|
|
|
* The trampoline is called when the hrtimer expires. It schedules a tasklet
|
|
|
|
* to run __tasklet_hrtimer_trampoline() which in turn will call the intended
|
|
|
|
* hrtimer callback, but from softirq context.
|
2009-07-22 12:18:35 +00:00
|
|
|
*/
|
|
|
|
static enum hrtimer_restart __hrtimer_tasklet_trampoline(struct hrtimer *timer)
|
|
|
|
{
|
|
|
|
struct tasklet_hrtimer *ttimer =
|
|
|
|
container_of(timer, struct tasklet_hrtimer, timer);
|
|
|
|
|
2010-02-03 17:08:52 +00:00
|
|
|
tasklet_hi_schedule(&ttimer->tasklet);
|
|
|
|
return HRTIMER_NORESTART;
|
2009-07-22 12:18:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Helper function which calls the hrtimer callback from
|
|
|
|
* tasklet/softirq context
|
|
|
|
*/
|
|
|
|
static void __tasklet_hrtimer_trampoline(unsigned long data)
|
|
|
|
{
|
|
|
|
struct tasklet_hrtimer *ttimer = (void *)data;
|
|
|
|
enum hrtimer_restart restart;
|
|
|
|
|
|
|
|
restart = ttimer->function(&ttimer->timer);
|
|
|
|
if (restart != HRTIMER_NORESTART)
|
|
|
|
hrtimer_restart(&ttimer->timer);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* tasklet_hrtimer_init - Init a tasklet/hrtimer combo for softirq callbacks
|
|
|
|
* @ttimer: tasklet_hrtimer which is initialized
|
2011-03-31 01:57:33 +00:00
|
|
|
* @function: hrtimer callback function which gets called from softirq context
|
2009-07-22 12:18:35 +00:00
|
|
|
* @which_clock: clock id (CLOCK_MONOTONIC/CLOCK_REALTIME)
|
|
|
|
* @mode: hrtimer mode (HRTIMER_MODE_ABS/HRTIMER_MODE_REL)
|
|
|
|
*/
|
|
|
|
void tasklet_hrtimer_init(struct tasklet_hrtimer *ttimer,
|
|
|
|
enum hrtimer_restart (*function)(struct hrtimer *),
|
|
|
|
clockid_t which_clock, enum hrtimer_mode mode)
|
|
|
|
{
|
|
|
|
hrtimer_init(&ttimer->timer, which_clock, mode);
|
|
|
|
ttimer->timer.function = __hrtimer_tasklet_trampoline;
|
|
|
|
tasklet_init(&ttimer->tasklet, __tasklet_hrtimer_trampoline,
|
|
|
|
(unsigned long)ttimer);
|
|
|
|
ttimer->function = function;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tasklet_hrtimer_init);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Remote softirq bits
|
|
|
|
*/
|
|
|
|
|
2008-09-24 05:15:57 +00:00
|
|
|
DEFINE_PER_CPU(struct list_head [NR_SOFTIRQS], softirq_work_list);
|
|
|
|
EXPORT_PER_CPU_SYMBOL(softirq_work_list);
|
|
|
|
|
|
|
|
static void __local_trigger(struct call_single_data *cp, int softirq)
|
|
|
|
{
|
|
|
|
struct list_head *head = &__get_cpu_var(softirq_work_list[softirq]);
|
|
|
|
|
|
|
|
list_add_tail(&cp->list, head);
|
|
|
|
|
|
|
|
/* Trigger the softirq only if the list was previously empty. */
|
|
|
|
if (head->next == &cp->list)
|
|
|
|
raise_softirq_irqoff(softirq);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_USE_GENERIC_SMP_HELPERS
|
|
|
|
static void remote_softirq_receive(void *data)
|
|
|
|
{
|
|
|
|
struct call_single_data *cp = data;
|
|
|
|
unsigned long flags;
|
|
|
|
int softirq;
|
|
|
|
|
|
|
|
softirq = cp->priv;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
__local_trigger(cp, softirq);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __try_remote_softirq(struct call_single_data *cp, int cpu, int softirq)
|
|
|
|
{
|
|
|
|
if (cpu_online(cpu)) {
|
|
|
|
cp->func = remote_softirq_receive;
|
|
|
|
cp->info = cp;
|
|
|
|
cp->flags = 0;
|
|
|
|
cp->priv = softirq;
|
|
|
|
|
2009-02-25 12:59:48 +00:00
|
|
|
__smp_call_function_single(cpu, cp, 0);
|
2008-09-24 05:15:57 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#else /* CONFIG_USE_GENERIC_SMP_HELPERS */
|
|
|
|
static int __try_remote_softirq(struct call_single_data *cp, int cpu, int softirq)
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __send_remote_softirq - try to schedule softirq work on a remote cpu
|
|
|
|
* @cp: private SMP call function data area
|
|
|
|
* @cpu: the remote cpu
|
|
|
|
* @this_cpu: the currently executing cpu
|
|
|
|
* @softirq: the softirq for the work
|
|
|
|
*
|
|
|
|
* Attempt to schedule softirq work on a remote cpu. If this cannot be
|
|
|
|
* done, the work is instead queued up on the local cpu.
|
|
|
|
*
|
|
|
|
* Interrupts must be disabled.
|
|
|
|
*/
|
|
|
|
void __send_remote_softirq(struct call_single_data *cp, int cpu, int this_cpu, int softirq)
|
|
|
|
{
|
|
|
|
if (cpu == this_cpu || __try_remote_softirq(cp, cpu, softirq))
|
|
|
|
__local_trigger(cp, softirq);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__send_remote_softirq);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* send_remote_softirq - try to schedule softirq work on a remote cpu
|
|
|
|
* @cp: private SMP call function data area
|
|
|
|
* @cpu: the remote cpu
|
|
|
|
* @softirq: the softirq for the work
|
|
|
|
*
|
|
|
|
* Like __send_remote_softirq except that disabling interrupts and
|
|
|
|
* computing the current cpu is done for the caller.
|
|
|
|
*/
|
|
|
|
void send_remote_softirq(struct call_single_data *cp, int cpu, int softirq)
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
int this_cpu;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
this_cpu = smp_processor_id();
|
|
|
|
__send_remote_softirq(cp, cpu, this_cpu, softirq);
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(send_remote_softirq);
|
|
|
|
|
|
|
|
static int __cpuinit remote_softirq_cpu_notify(struct notifier_block *self,
|
|
|
|
unsigned long action, void *hcpu)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* If a CPU goes away, splice its entries to the current CPU
|
|
|
|
* and trigger a run of the softirq
|
|
|
|
*/
|
|
|
|
if (action == CPU_DEAD || action == CPU_DEAD_FROZEN) {
|
|
|
|
int cpu = (unsigned long) hcpu;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
local_irq_disable();
|
|
|
|
for (i = 0; i < NR_SOFTIRQS; i++) {
|
|
|
|
struct list_head *head = &per_cpu(softirq_work_list[i], cpu);
|
|
|
|
struct list_head *local_head;
|
|
|
|
|
|
|
|
if (list_empty(head))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
local_head = &__get_cpu_var(softirq_work_list[i]);
|
|
|
|
list_splice_init(head, local_head);
|
|
|
|
raise_softirq_irqoff(i);
|
|
|
|
}
|
|
|
|
local_irq_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
return NOTIFY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct notifier_block __cpuinitdata remote_softirq_cpu_notifier = {
|
|
|
|
.notifier_call = remote_softirq_cpu_notify,
|
|
|
|
};
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
void __init softirq_init(void)
|
|
|
|
{
|
2008-03-04 23:23:25 +00:00
|
|
|
int cpu;
|
|
|
|
|
|
|
|
for_each_possible_cpu(cpu) {
|
2008-09-24 05:15:57 +00:00
|
|
|
int i;
|
|
|
|
|
2008-03-04 23:23:25 +00:00
|
|
|
per_cpu(tasklet_vec, cpu).tail =
|
|
|
|
&per_cpu(tasklet_vec, cpu).head;
|
|
|
|
per_cpu(tasklet_hi_vec, cpu).tail =
|
|
|
|
&per_cpu(tasklet_hi_vec, cpu).head;
|
2008-09-24 05:15:57 +00:00
|
|
|
for (i = 0; i < NR_SOFTIRQS; i++)
|
|
|
|
INIT_LIST_HEAD(&per_cpu(softirq_work_list[i], cpu));
|
2008-03-04 23:23:25 +00:00
|
|
|
}
|
|
|
|
|
2008-09-24 05:15:57 +00:00
|
|
|
register_hotcpu_notifier(&remote_softirq_cpu_notifier);
|
|
|
|
|
Remove argument from open_softirq which is always NULL
As git-grep shows, open_softirq() is always called with the last argument
being NULL
block/blk-core.c: open_softirq(BLOCK_SOFTIRQ, blk_done_softirq, NULL);
kernel/hrtimer.c: open_softirq(HRTIMER_SOFTIRQ, run_hrtimer_softirq, NULL);
kernel/rcuclassic.c: open_softirq(RCU_SOFTIRQ, rcu_process_callbacks, NULL);
kernel/rcupreempt.c: open_softirq(RCU_SOFTIRQ, rcu_process_callbacks, NULL);
kernel/sched.c: open_softirq(SCHED_SOFTIRQ, run_rebalance_domains, NULL);
kernel/softirq.c: open_softirq(TASKLET_SOFTIRQ, tasklet_action, NULL);
kernel/softirq.c: open_softirq(HI_SOFTIRQ, tasklet_hi_action, NULL);
kernel/timer.c: open_softirq(TIMER_SOFTIRQ, run_timer_softirq, NULL);
net/core/dev.c: open_softirq(NET_TX_SOFTIRQ, net_tx_action, NULL);
net/core/dev.c: open_softirq(NET_RX_SOFTIRQ, net_rx_action, NULL);
This observation has already been made by Matthew Wilcox in June 2002
(http://www.cs.helsinki.fi/linux/linux-kernel/2002-25/0687.html)
"I notice that none of the current softirq routines use the data element
passed to them."
and the situation hasn't changed since them. So it appears we can safely
remove that extra argument to save 128 (54) bytes of kernel data (text).
Signed-off-by: Carlos R. Mafra <crmafra@ift.unesp.br>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2008-05-15 14:15:37 +00:00
|
|
|
open_softirq(TASKLET_SOFTIRQ, tasklet_action);
|
|
|
|
open_softirq(HI_SOFTIRQ, tasklet_hi_action);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
2009-10-29 13:34:13 +00:00
|
|
|
static int run_ksoftirqd(void * __bind_cpu)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
|
|
|
|
while (!kthread_should_stop()) {
|
|
|
|
preempt_disable();
|
|
|
|
if (!local_softirq_pending()) {
|
2011-03-21 11:33:18 +00:00
|
|
|
schedule_preempt_disabled();
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
|
|
|
|
while (local_softirq_pending()) {
|
|
|
|
/* Preempt disable stops cpu going offline.
|
|
|
|
If already offline, we'll be on wrong CPU:
|
|
|
|
don't process */
|
|
|
|
if (cpu_is_offline((long)__bind_cpu))
|
|
|
|
goto wait_to_die;
|
2011-02-02 16:10:48 +00:00
|
|
|
local_irq_disable();
|
|
|
|
if (local_softirq_pending())
|
|
|
|
__do_softirq();
|
|
|
|
local_irq_enable();
|
2011-03-21 12:32:17 +00:00
|
|
|
sched_preempt_enable_no_resched();
|
2005-04-16 22:20:36 +00:00
|
|
|
cond_resched();
|
|
|
|
preempt_disable();
|
rcu: refactor RCU's context-switch handling
The addition of preemptible RCU to treercu resulted in a bit of
confusion and inefficiency surrounding the handling of context switches
for RCU-sched and for RCU-preempt. For RCU-sched, a context switch
is a quiescent state, pure and simple, just like it always has been.
For RCU-preempt, a context switch is in no way a quiescent state, but
special handling is required when a task blocks in an RCU read-side
critical section.
However, the callout from the scheduler and the outer loop in ksoftirqd
still calls something named rcu_sched_qs(), whose name is no longer
accurate. Furthermore, when rcu_check_callbacks() notes an RCU-sched
quiescent state, it ends up unnecessarily (though harmlessly, aside
from the performance hit) enqueuing the current task if it happens to
be running in an RCU-preempt read-side critical section. This not only
increases the maximum latency of scheduler_tick(), it also needlessly
increases the overhead of the next outermost rcu_read_unlock() invocation.
This patch addresses this situation by separating the notion of RCU's
context-switch handling from that of RCU-sched's quiescent states.
The context-switch handling is covered by rcu_note_context_switch() in
general and by rcu_preempt_note_context_switch() for preemptible RCU.
This permits rcu_sched_qs() to handle quiescent states and only quiescent
states. It also reduces the maximum latency of scheduler_tick(), though
probably by much less than a microsecond. Finally, it means that tasks
within preemptible-RCU read-side critical sections avoid incurring the
overhead of queuing unless there really is a context switch.
Suggested-by: Lai Jiangshan <laijs@cn.fujitsu.com>
Acked-by: Lai Jiangshan <laijs@cn.fujitsu.com>
Signed-off-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Peter Zijlstra <peterz@infradead.org>
2010-04-02 00:37:01 +00:00
|
|
|
rcu_note_context_switch((long)__bind_cpu);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
preempt_enable();
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
}
|
|
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
wait_to_die:
|
|
|
|
preempt_enable();
|
|
|
|
/* Wait for kthread_stop */
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
while (!kthread_should_stop()) {
|
|
|
|
schedule();
|
|
|
|
set_current_state(TASK_INTERRUPTIBLE);
|
|
|
|
}
|
|
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
/*
|
|
|
|
* tasklet_kill_immediate is called to remove a tasklet which can already be
|
|
|
|
* scheduled for execution on @cpu.
|
|
|
|
*
|
|
|
|
* Unlike tasklet_kill, this function removes the tasklet
|
|
|
|
* _immediately_, even if the tasklet is in TASKLET_STATE_SCHED state.
|
|
|
|
*
|
|
|
|
* When this function is called, @cpu must be in the CPU_DEAD state.
|
|
|
|
*/
|
|
|
|
void tasklet_kill_immediate(struct tasklet_struct *t, unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct tasklet_struct **i;
|
|
|
|
|
|
|
|
BUG_ON(cpu_online(cpu));
|
|
|
|
BUG_ON(test_bit(TASKLET_STATE_RUN, &t->state));
|
|
|
|
|
|
|
|
if (!test_bit(TASKLET_STATE_SCHED, &t->state))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* CPU is dead, so no lock needed. */
|
2008-03-04 23:23:25 +00:00
|
|
|
for (i = &per_cpu(tasklet_vec, cpu).head; *i; i = &(*i)->next) {
|
2005-04-16 22:20:36 +00:00
|
|
|
if (*i == t) {
|
|
|
|
*i = t->next;
|
2008-03-04 23:23:25 +00:00
|
|
|
/* If this was the tail element, move the tail ptr */
|
|
|
|
if (*i == NULL)
|
|
|
|
per_cpu(tasklet_vec, cpu).tail = i;
|
2005-04-16 22:20:36 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
|
|
|
|
static void takeover_tasklets(unsigned int cpu)
|
|
|
|
{
|
|
|
|
/* CPU is dead, so no lock needed. */
|
|
|
|
local_irq_disable();
|
|
|
|
|
|
|
|
/* Find end, append list for that CPU. */
|
2008-05-01 11:34:23 +00:00
|
|
|
if (&per_cpu(tasklet_vec, cpu).head != per_cpu(tasklet_vec, cpu).tail) {
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_vec.tail) = per_cpu(tasklet_vec, cpu).head;
|
|
|
|
this_cpu_write(tasklet_vec.tail, per_cpu(tasklet_vec, cpu).tail);
|
2008-05-01 11:34:23 +00:00
|
|
|
per_cpu(tasklet_vec, cpu).head = NULL;
|
|
|
|
per_cpu(tasklet_vec, cpu).tail = &per_cpu(tasklet_vec, cpu).head;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
raise_softirq_irqoff(TASKLET_SOFTIRQ);
|
|
|
|
|
2008-05-01 11:34:23 +00:00
|
|
|
if (&per_cpu(tasklet_hi_vec, cpu).head != per_cpu(tasklet_hi_vec, cpu).tail) {
|
2010-12-08 15:22:55 +00:00
|
|
|
*__this_cpu_read(tasklet_hi_vec.tail) = per_cpu(tasklet_hi_vec, cpu).head;
|
|
|
|
__this_cpu_write(tasklet_hi_vec.tail, per_cpu(tasklet_hi_vec, cpu).tail);
|
2008-05-01 11:34:23 +00:00
|
|
|
per_cpu(tasklet_hi_vec, cpu).head = NULL;
|
|
|
|
per_cpu(tasklet_hi_vec, cpu).tail = &per_cpu(tasklet_hi_vec, cpu).head;
|
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
raise_softirq_irqoff(HI_SOFTIRQ);
|
|
|
|
|
|
|
|
local_irq_enable();
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_HOTPLUG_CPU */
|
|
|
|
|
2006-07-30 10:03:35 +00:00
|
|
|
static int __cpuinit cpu_callback(struct notifier_block *nfb,
|
2005-04-16 22:20:36 +00:00
|
|
|
unsigned long action,
|
|
|
|
void *hcpu)
|
|
|
|
{
|
|
|
|
int hotcpu = (unsigned long)hcpu;
|
|
|
|
struct task_struct *p;
|
|
|
|
|
|
|
|
switch (action) {
|
|
|
|
case CPU_UP_PREPARE:
|
2007-05-09 09:35:10 +00:00
|
|
|
case CPU_UP_PREPARE_FROZEN:
|
2011-03-22 23:30:45 +00:00
|
|
|
p = kthread_create_on_node(run_ksoftirqd,
|
|
|
|
hcpu,
|
|
|
|
cpu_to_node(hotcpu),
|
|
|
|
"ksoftirqd/%d", hotcpu);
|
2005-04-16 22:20:36 +00:00
|
|
|
if (IS_ERR(p)) {
|
|
|
|
printk("ksoftirqd for %i failed\n", hotcpu);
|
2010-05-26 21:43:32 +00:00
|
|
|
return notifier_from_errno(PTR_ERR(p));
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
|
|
|
kthread_bind(p, hotcpu);
|
|
|
|
per_cpu(ksoftirqd, hotcpu) = p;
|
|
|
|
break;
|
|
|
|
case CPU_ONLINE:
|
2007-05-09 09:35:10 +00:00
|
|
|
case CPU_ONLINE_FROZEN:
|
2005-04-16 22:20:36 +00:00
|
|
|
wake_up_process(per_cpu(ksoftirqd, hotcpu));
|
|
|
|
break;
|
|
|
|
#ifdef CONFIG_HOTPLUG_CPU
|
|
|
|
case CPU_UP_CANCELED:
|
2007-05-09 09:35:10 +00:00
|
|
|
case CPU_UP_CANCELED_FROZEN:
|
2006-06-25 12:49:10 +00:00
|
|
|
if (!per_cpu(ksoftirqd, hotcpu))
|
|
|
|
break;
|
2005-04-16 22:20:36 +00:00
|
|
|
/* Unbind so it can run. Fall thru. */
|
2005-11-07 08:58:38 +00:00
|
|
|
kthread_bind(per_cpu(ksoftirqd, hotcpu),
|
2008-12-31 23:42:23 +00:00
|
|
|
cpumask_any(cpu_online_mask));
|
2005-04-16 22:20:36 +00:00
|
|
|
case CPU_DEAD:
|
2007-07-16 06:39:48 +00:00
|
|
|
case CPU_DEAD_FROZEN: {
|
2011-01-07 12:41:40 +00:00
|
|
|
static const struct sched_param param = {
|
2010-10-20 23:01:12 +00:00
|
|
|
.sched_priority = MAX_RT_PRIO-1
|
|
|
|
};
|
2007-07-16 06:39:48 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
p = per_cpu(ksoftirqd, hotcpu);
|
|
|
|
per_cpu(ksoftirqd, hotcpu) = NULL;
|
2008-06-23 03:55:38 +00:00
|
|
|
sched_setscheduler_nocheck(p, SCHED_FIFO, ¶m);
|
2005-04-16 22:20:36 +00:00
|
|
|
kthread_stop(p);
|
|
|
|
takeover_tasklets(hotcpu);
|
|
|
|
break;
|
2007-07-16 06:39:48 +00:00
|
|
|
}
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* CONFIG_HOTPLUG_CPU */
|
|
|
|
}
|
|
|
|
return NOTIFY_OK;
|
|
|
|
}
|
|
|
|
|
2006-07-30 10:03:35 +00:00
|
|
|
static struct notifier_block __cpuinitdata cpu_nfb = {
|
2005-04-16 22:20:36 +00:00
|
|
|
.notifier_call = cpu_callback
|
|
|
|
};
|
|
|
|
|
2008-07-26 02:45:11 +00:00
|
|
|
static __init int spawn_ksoftirqd(void)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
void *cpu = (void *)(long)smp_processor_id();
|
2006-09-29 09:00:22 +00:00
|
|
|
int err = cpu_callback(&cpu_nfb, CPU_UP_PREPARE, cpu);
|
|
|
|
|
2010-06-04 21:15:04 +00:00
|
|
|
BUG_ON(err != NOTIFY_OK);
|
2005-04-16 22:20:36 +00:00
|
|
|
cpu_callback(&cpu_nfb, CPU_ONLINE, cpu);
|
|
|
|
register_cpu_notifier(&cpu_nfb);
|
|
|
|
return 0;
|
|
|
|
}
|
2008-07-26 02:45:11 +00:00
|
|
|
early_initcall(spawn_ksoftirqd);
|
2006-03-22 08:08:16 +00:00
|
|
|
|
2008-12-29 00:01:13 +00:00
|
|
|
/*
|
|
|
|
* [ These __weak aliases are kept in a separate compilation unit, so that
|
|
|
|
* GCC does not inline them incorrectly. ]
|
|
|
|
*/
|
|
|
|
|
|
|
|
int __init __weak early_irq_init(void)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-09-27 18:55:03 +00:00
|
|
|
#ifdef CONFIG_GENERIC_HARDIRQS
|
2009-01-13 01:39:24 +00:00
|
|
|
int __init __weak arch_probe_nr_irqs(void)
|
|
|
|
{
|
2010-09-27 18:55:03 +00:00
|
|
|
return NR_IRQS_LEGACY;
|
2009-01-13 01:39:24 +00:00
|
|
|
}
|
|
|
|
|
2008-12-29 00:01:13 +00:00
|
|
|
int __init __weak arch_early_irq_init(void)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2010-09-27 18:55:03 +00:00
|
|
|
#endif
|