License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 08:07:57 -06:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* linux/kernel/irq/spurious.c
|
|
|
|
*
|
|
|
|
* Copyright (C) 1992, 1998-2004 Linus Torvalds, Ingo Molnar
|
|
|
|
*
|
|
|
|
* This file contains spurious interrupt handling.
|
|
|
|
*/
|
|
|
|
|
2008-02-14 08:36:51 -07:00
|
|
|
#include <linux/jiffies.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/irq.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <linux/interrupt.h>
|
2008-01-30 05:32:48 -07:00
|
|
|
#include <linux/moduleparam.h>
|
2008-07-10 15:48:54 -06:00
|
|
|
#include <linux/timer.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2010-10-01 07:17:14 -06:00
|
|
|
#include "internals.h"
|
|
|
|
|
2006-06-23 03:05:32 -06:00
|
|
|
static int irqfixup __read_mostly;
|
2005-06-28 21:45:18 -06:00
|
|
|
|
2008-07-10 15:48:54 -06:00
|
|
|
#define POLL_SPURIOUS_IRQ_INTERVAL (HZ/10)
|
2017-08-28 12:28:21 -06:00
|
|
|
static void poll_spurious_irqs(struct timer_list *unused);
|
2017-10-04 17:27:04 -06:00
|
|
|
static DEFINE_TIMER(poll_spurious_irq_timer, poll_spurious_irqs);
|
2011-02-07 06:31:37 -07:00
|
|
|
static int irq_poll_cpu;
|
|
|
|
static atomic_t irq_poll_active;
|
2008-07-10 15:48:54 -06:00
|
|
|
|
2011-02-07 02:34:30 -07:00
|
|
|
/*
|
|
|
|
* We wait here for a poller to finish.
|
|
|
|
*
|
|
|
|
* If the poll runs on this CPU, then we yell loudly and return
|
|
|
|
* false. That will leave the interrupt line disabled in the worst
|
|
|
|
* case, but it should never happen.
|
|
|
|
*
|
|
|
|
* We wait until the poller is done and then recheck disabled and
|
|
|
|
* action (about to be disabled). Only if it's still active, we return
|
|
|
|
* true and let the handler run.
|
|
|
|
*/
|
|
|
|
bool irq_wait_for_poll(struct irq_desc *desc)
|
|
|
|
{
|
|
|
|
if (WARN_ONCE(irq_poll_cpu == smp_processor_id(),
|
|
|
|
"irq poll in progress on cpu %d for irq %d\n",
|
|
|
|
smp_processor_id(), desc->irq_data.irq))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
do {
|
|
|
|
raw_spin_unlock(&desc->lock);
|
2011-03-28 06:10:52 -06:00
|
|
|
while (irqd_irq_inprogress(&desc->irq_data))
|
2011-02-07 02:34:30 -07:00
|
|
|
cpu_relax();
|
|
|
|
raw_spin_lock(&desc->lock);
|
2011-03-28 12:28:56 -06:00
|
|
|
} while (irqd_irq_inprogress(&desc->irq_data));
|
2011-02-07 02:34:30 -07:00
|
|
|
/* Might have been disabled in meantime */
|
2011-03-28 06:10:52 -06:00
|
|
|
return !irqd_irq_disabled(&desc->irq_data) && desc->action;
|
2011-02-07 02:34:30 -07:00
|
|
|
#else
|
|
|
|
return false;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2011-02-06 17:29:15 -07:00
|
|
|
|
2005-06-28 21:45:18 -06:00
|
|
|
/*
|
|
|
|
* Recovery handler for misrouted interrupts.
|
|
|
|
*/
|
2015-06-23 12:07:35 -06:00
|
|
|
static int try_one_irq(struct irq_desc *desc, bool force)
|
2005-06-28 21:45:18 -06:00
|
|
|
{
|
2011-02-06 17:29:15 -07:00
|
|
|
irqreturn_t ret = IRQ_NONE;
|
2008-07-10 15:48:54 -06:00
|
|
|
struct irqaction *action;
|
2005-06-28 21:45:18 -06:00
|
|
|
|
2009-11-17 08:46:45 -07:00
|
|
|
raw_spin_lock(&desc->lock);
|
2011-02-07 01:52:27 -07:00
|
|
|
|
2013-11-06 04:30:07 -07:00
|
|
|
/*
|
|
|
|
* PER_CPU, nested thread interrupts and interrupts explicitely
|
|
|
|
* marked polled are excluded from polling.
|
|
|
|
*/
|
|
|
|
if (irq_settings_is_per_cpu(desc) ||
|
|
|
|
irq_settings_is_nested_thread(desc) ||
|
|
|
|
irq_settings_is_polled(desc))
|
2011-02-07 01:52:27 -07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Do not poll disabled interrupts unless the spurious
|
|
|
|
* disabled poller asks explicitely.
|
|
|
|
*/
|
2011-03-28 06:10:52 -06:00
|
|
|
if (irqd_irq_disabled(&desc->irq_data) && !force)
|
2011-02-07 01:52:27 -07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* All handlers must agree on IRQF_SHARED, so we test just the
|
2012-11-23 02:08:44 -07:00
|
|
|
* first.
|
2011-02-07 01:52:27 -07:00
|
|
|
*/
|
|
|
|
action = desc->action;
|
|
|
|
if (!action || !(action->flags & IRQF_SHARED) ||
|
2012-11-23 02:08:44 -07:00
|
|
|
(action->flags & __IRQF_TIMER))
|
2011-02-07 01:52:27 -07:00
|
|
|
goto out;
|
|
|
|
|
2008-07-10 15:48:54 -06:00
|
|
|
/* Already running on another processor */
|
2011-03-28 06:10:52 -06:00
|
|
|
if (irqd_irq_inprogress(&desc->irq_data)) {
|
2008-07-10 15:48:54 -06:00
|
|
|
/*
|
|
|
|
* Already running: If it is shared get the other
|
|
|
|
* CPU to go looking for our mystery interrupt too
|
|
|
|
*/
|
2011-02-08 04:17:57 -07:00
|
|
|
desc->istate |= IRQS_PENDING;
|
2011-02-07 01:10:39 -07:00
|
|
|
goto out;
|
2011-02-07 01:52:27 -07:00
|
|
|
}
|
2011-02-07 01:10:39 -07:00
|
|
|
|
2011-02-06 17:29:15 -07:00
|
|
|
/* Mark it poll in progress */
|
2011-02-07 12:55:35 -07:00
|
|
|
desc->istate |= IRQS_POLL_INPROGRESS;
|
2011-02-07 01:10:39 -07:00
|
|
|
do {
|
2011-02-06 17:29:15 -07:00
|
|
|
if (handle_irq_event(desc) == IRQ_HANDLED)
|
|
|
|
ret = IRQ_HANDLED;
|
2012-11-23 02:08:44 -07:00
|
|
|
/* Make sure that there is still a valid action */
|
2011-02-07 01:10:39 -07:00
|
|
|
action = desc->action;
|
2011-02-08 04:17:57 -07:00
|
|
|
} while ((desc->istate & IRQS_PENDING) && action);
|
2011-02-07 12:55:35 -07:00
|
|
|
desc->istate &= ~IRQS_POLL_INPROGRESS;
|
2011-02-07 01:10:39 -07:00
|
|
|
out:
|
|
|
|
raw_spin_unlock(&desc->lock);
|
2011-02-06 17:29:15 -07:00
|
|
|
return ret == IRQ_HANDLED;
|
2008-07-10 15:48:54 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static int misrouted_irq(int irq)
|
|
|
|
{
|
2008-09-15 02:53:50 -06:00
|
|
|
struct irq_desc *desc;
|
2008-10-16 01:55:00 -06:00
|
|
|
int i, ok = 0;
|
2008-07-10 15:48:54 -06:00
|
|
|
|
2011-11-01 13:29:44 -06:00
|
|
|
if (atomic_inc_return(&irq_poll_active) != 1)
|
2011-02-07 06:31:37 -07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
irq_poll_cpu = smp_processor_id();
|
|
|
|
|
2008-09-15 02:53:50 -06:00
|
|
|
for_each_irq_desc(i, desc) {
|
|
|
|
if (!i)
|
|
|
|
continue;
|
2008-07-10 15:48:54 -06:00
|
|
|
|
|
|
|
if (i == irq) /* Already tried */
|
|
|
|
continue;
|
|
|
|
|
2015-06-23 12:07:35 -06:00
|
|
|
if (try_one_irq(desc, false))
|
2008-07-10 15:48:54 -06:00
|
|
|
ok = 1;
|
2005-06-28 21:45:18 -06:00
|
|
|
}
|
2011-02-07 06:31:37 -07:00
|
|
|
out:
|
|
|
|
atomic_dec(&irq_poll_active);
|
2005-06-28 21:45:18 -06:00
|
|
|
/* So the caller can adjust the irq error counts */
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2017-08-28 12:28:21 -06:00
|
|
|
static void poll_spurious_irqs(struct timer_list *unused)
|
2008-07-10 15:48:54 -06:00
|
|
|
{
|
2008-09-15 02:53:50 -06:00
|
|
|
struct irq_desc *desc;
|
2008-10-16 01:55:00 -06:00
|
|
|
int i;
|
2008-09-15 02:53:50 -06:00
|
|
|
|
2011-02-07 06:31:37 -07:00
|
|
|
if (atomic_inc_return(&irq_poll_active) != 1)
|
|
|
|
goto out;
|
|
|
|
irq_poll_cpu = smp_processor_id();
|
|
|
|
|
2008-09-15 02:53:50 -06:00
|
|
|
for_each_irq_desc(i, desc) {
|
2011-02-07 12:40:54 -07:00
|
|
|
unsigned int state;
|
2008-07-10 15:48:54 -06:00
|
|
|
|
2008-09-15 02:53:50 -06:00
|
|
|
if (!i)
|
|
|
|
continue;
|
|
|
|
|
2008-07-10 15:48:54 -06:00
|
|
|
/* Racy but it doesn't matter */
|
2011-02-07 12:40:54 -07:00
|
|
|
state = desc->istate;
|
2008-07-10 15:48:54 -06:00
|
|
|
barrier();
|
2011-02-07 12:40:54 -07:00
|
|
|
if (!(state & IRQS_SPURIOUS_DISABLED))
|
2008-07-10 15:48:54 -06:00
|
|
|
continue;
|
|
|
|
|
2009-11-06 20:16:13 -07:00
|
|
|
local_irq_disable();
|
2015-06-23 12:07:35 -06:00
|
|
|
try_one_irq(desc, true);
|
2009-11-06 20:16:13 -07:00
|
|
|
local_irq_enable();
|
2008-07-10 15:48:54 -06:00
|
|
|
}
|
2011-02-07 06:31:37 -07:00
|
|
|
out:
|
|
|
|
atomic_dec(&irq_poll_active);
|
2008-10-16 01:55:00 -06:00
|
|
|
mod_timer(&poll_spurious_irq_timer,
|
|
|
|
jiffies + POLL_SPURIOUS_IRQ_INTERVAL);
|
2008-07-10 15:48:54 -06:00
|
|
|
}
|
|
|
|
|
2011-05-31 00:56:11 -06:00
|
|
|
static inline int bad_action_ret(irqreturn_t action_ret)
|
|
|
|
{
|
2017-02-15 21:24:09 -07:00
|
|
|
unsigned int r = action_ret;
|
|
|
|
|
|
|
|
if (likely(r <= (IRQ_HANDLED | IRQ_WAKE_THREAD)))
|
2011-05-31 00:56:11 -06:00
|
|
|
return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* If 99,900 of the previous 100,000 interrupts have not been handled
|
|
|
|
* then assume that the IRQ is stuck in some manner. Drop a diagnostic
|
|
|
|
* and try to turn the IRQ off.
|
|
|
|
*
|
|
|
|
* (The other 100-of-100,000 interrupts may have been a correctly
|
|
|
|
* functioning device sharing an IRQ with the failing one)
|
|
|
|
*/
|
2015-06-23 12:02:43 -06:00
|
|
|
static void __report_bad_irq(struct irq_desc *desc, irqreturn_t action_ret)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2015-06-23 12:02:43 -06:00
|
|
|
unsigned int irq = irq_desc_get_irq(desc);
|
2005-04-16 16:20:36 -06:00
|
|
|
struct irqaction *action;
|
2011-02-07 01:05:05 -07:00
|
|
|
unsigned long flags;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2011-05-31 00:56:11 -06:00
|
|
|
if (bad_action_ret(action_ret)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
printk(KERN_ERR "irq event %d: bogus return value %x\n",
|
|
|
|
irq, action_ret);
|
|
|
|
} else {
|
2005-06-28 21:45:18 -06:00
|
|
|
printk(KERN_ERR "irq %d: nobody cared (try booting with "
|
|
|
|
"the \"irqpoll\" option)\n", irq);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
dump_stack();
|
|
|
|
printk(KERN_ERR "handlers:\n");
|
2006-06-29 03:24:40 -06:00
|
|
|
|
2011-02-07 01:05:05 -07:00
|
|
|
/*
|
|
|
|
* We need to take desc->lock here. note_interrupt() is called
|
|
|
|
* w/o desc->lock held, but IRQ_PROGRESS set. We might race
|
|
|
|
* with something else removing an action. It's ok to take
|
|
|
|
* desc->lock here. See synchronize_irq().
|
|
|
|
*/
|
|
|
|
raw_spin_lock_irqsave(&desc->lock, flags);
|
2016-01-14 02:54:13 -07:00
|
|
|
for_each_action_of_desc(desc, action) {
|
2011-05-31 00:56:10 -06:00
|
|
|
printk(KERN_ERR "[<%p>] %pf", action->handler, action->handler);
|
|
|
|
if (action->thread_fn)
|
|
|
|
printk(KERN_CONT " threaded [<%p>] %pf",
|
|
|
|
action->thread_fn, action->thread_fn);
|
|
|
|
printk(KERN_CONT "\n");
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2011-02-07 01:05:05 -07:00
|
|
|
raw_spin_unlock_irqrestore(&desc->lock, flags);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2015-06-23 12:02:43 -06:00
|
|
|
static void report_bad_irq(struct irq_desc *desc, irqreturn_t action_ret)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
static int count = 100;
|
|
|
|
|
|
|
|
if (count > 0) {
|
|
|
|
count--;
|
2015-06-23 12:02:43 -06:00
|
|
|
__report_bad_irq(desc, action_ret);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-10-16 01:55:00 -06:00
|
|
|
static inline int
|
|
|
|
try_misrouted_irq(unsigned int irq, struct irq_desc *desc,
|
|
|
|
irqreturn_t action_ret)
|
2007-05-24 09:37:14 -06:00
|
|
|
{
|
|
|
|
struct irqaction *action;
|
|
|
|
|
|
|
|
if (!irqfixup)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* We didn't actually handle the IRQ - see if it was misrouted? */
|
|
|
|
if (action_ret == IRQ_NONE)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* But for 'irqfixup == 2' we also do it for handled interrupts if
|
|
|
|
* they are marked as IRQF_IRQPOLL (or for irq zero, which is the
|
|
|
|
* traditional PC timer interrupt.. Legacy)
|
|
|
|
*/
|
|
|
|
if (irqfixup < 2)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (!irq)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since we don't get the descriptor lock, "action" can
|
|
|
|
* change under us. We don't really care, but we don't
|
|
|
|
* want to follow a NULL pointer. So tell the compiler to
|
|
|
|
* just load it once by using a barrier.
|
|
|
|
*/
|
|
|
|
action = desc->action;
|
|
|
|
barrier();
|
|
|
|
return action && (action->flags & IRQF_IRQPOLL);
|
|
|
|
}
|
|
|
|
|
2013-03-07 06:53:45 -07:00
|
|
|
#define SPURIOUS_DEFERRED 0x80000000
|
|
|
|
|
2015-06-03 22:13:28 -06:00
|
|
|
void note_interrupt(struct irq_desc *desc, irqreturn_t action_ret)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2015-06-03 22:13:28 -06:00
|
|
|
unsigned int irq;
|
|
|
|
|
2013-11-06 04:30:07 -07:00
|
|
|
if (desc->istate & IRQS_POLL_INPROGRESS ||
|
|
|
|
irq_settings_is_polled(desc))
|
2011-02-07 02:34:30 -07:00
|
|
|
return;
|
|
|
|
|
2011-05-31 00:56:11 -06:00
|
|
|
if (bad_action_ret(action_ret)) {
|
2015-06-23 12:02:43 -06:00
|
|
|
report_bad_irq(desc, action_ret);
|
2011-05-31 00:56:11 -06:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-03-07 06:53:45 -07:00
|
|
|
/*
|
|
|
|
* We cannot call note_interrupt from the threaded handler
|
|
|
|
* because we need to look at the compound of all handlers
|
|
|
|
* (primary and threaded). Aside of that in the threaded
|
|
|
|
* shared case we have no serialization against an incoming
|
|
|
|
* hardware interrupt while we are dealing with a threaded
|
|
|
|
* result.
|
|
|
|
*
|
|
|
|
* So in case a thread is woken, we just note the fact and
|
|
|
|
* defer the analysis to the next hardware interrupt.
|
|
|
|
*
|
|
|
|
* The threaded handlers store whether they sucessfully
|
|
|
|
* handled an interrupt and we check whether that number
|
|
|
|
* changed versus the last invocation.
|
|
|
|
*
|
|
|
|
* We could handle all interrupts with the delayed by one
|
|
|
|
* mechanism, but for the non forced threaded case we'd just
|
|
|
|
* add pointless overhead to the straight hardirq interrupts
|
|
|
|
* for the sake of a few lines less code.
|
|
|
|
*/
|
|
|
|
if (action_ret & IRQ_WAKE_THREAD) {
|
|
|
|
/*
|
|
|
|
* There is a thread woken. Check whether one of the
|
|
|
|
* shared primary handlers returned IRQ_HANDLED. If
|
|
|
|
* not we defer the spurious detection to the next
|
|
|
|
* interrupt.
|
|
|
|
*/
|
|
|
|
if (action_ret == IRQ_WAKE_THREAD) {
|
|
|
|
int handled;
|
|
|
|
/*
|
|
|
|
* We use bit 31 of thread_handled_last to
|
|
|
|
* denote the deferred spurious detection
|
|
|
|
* active. No locking necessary as
|
|
|
|
* thread_handled_last is only accessed here
|
|
|
|
* and we have the guarantee that hard
|
|
|
|
* interrupts are not reentrant.
|
|
|
|
*/
|
|
|
|
if (!(desc->threads_handled_last & SPURIOUS_DEFERRED)) {
|
|
|
|
desc->threads_handled_last |= SPURIOUS_DEFERRED;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Check whether one of the threaded handlers
|
|
|
|
* returned IRQ_HANDLED since the last
|
|
|
|
* interrupt happened.
|
|
|
|
*
|
|
|
|
* For simplicity we just set bit 31, as it is
|
|
|
|
* set in threads_handled_last as well. So we
|
|
|
|
* avoid extra masking. And we really do not
|
|
|
|
* care about the high bits of the handled
|
|
|
|
* count. We just care about the count being
|
|
|
|
* different than the one we saw before.
|
|
|
|
*/
|
|
|
|
handled = atomic_read(&desc->threads_handled);
|
|
|
|
handled |= SPURIOUS_DEFERRED;
|
|
|
|
if (handled != desc->threads_handled_last) {
|
|
|
|
action_ret = IRQ_HANDLED;
|
|
|
|
/*
|
|
|
|
* Note: We keep the SPURIOUS_DEFERRED
|
|
|
|
* bit set. We are handling the
|
|
|
|
* previous invocation right now.
|
|
|
|
* Keep it for the current one, so the
|
|
|
|
* next hardware interrupt will
|
|
|
|
* account for it.
|
|
|
|
*/
|
|
|
|
desc->threads_handled_last = handled;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* None of the threaded handlers felt
|
|
|
|
* responsible for the last interrupt
|
|
|
|
*
|
|
|
|
* We keep the SPURIOUS_DEFERRED bit
|
|
|
|
* set in threads_handled_last as we
|
|
|
|
* need to account for the current
|
|
|
|
* interrupt as well.
|
|
|
|
*/
|
|
|
|
action_ret = IRQ_NONE;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* One of the primary handlers returned
|
|
|
|
* IRQ_HANDLED. So we don't care about the
|
|
|
|
* threaded handlers on the same line. Clear
|
|
|
|
* the deferred detection bit.
|
|
|
|
*
|
|
|
|
* In theory we could/should check whether the
|
|
|
|
* deferred bit is set and take the result of
|
|
|
|
* the previous run into account here as
|
|
|
|
* well. But it's really not worth the
|
|
|
|
* trouble. If every other interrupt is
|
|
|
|
* handled we never trigger the spurious
|
|
|
|
* detector. And if this is just the one out
|
|
|
|
* of 100k unhandled ones which is handled
|
|
|
|
* then we merily delay the spurious detection
|
|
|
|
* by one hard interrupt. Not a real problem.
|
|
|
|
*/
|
|
|
|
desc->threads_handled_last &= ~SPURIOUS_DEFERRED;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-31 00:56:11 -06:00
|
|
|
if (unlikely(action_ret == IRQ_NONE)) {
|
2007-07-16 00:40:55 -06:00
|
|
|
/*
|
|
|
|
* If we are seeing only the odd spurious IRQ caused by
|
|
|
|
* bus asynchronicity then don't eventually trigger an error,
|
2009-10-28 13:11:04 -06:00
|
|
|
* otherwise the counter becomes a doomsday timer for otherwise
|
2007-07-16 00:40:55 -06:00
|
|
|
* working systems
|
|
|
|
*/
|
2008-02-14 08:36:51 -07:00
|
|
|
if (time_after(jiffies, desc->last_unhandled + HZ/10))
|
2007-07-16 00:40:55 -06:00
|
|
|
desc->irqs_unhandled = 1;
|
|
|
|
else
|
|
|
|
desc->irqs_unhandled++;
|
|
|
|
desc->last_unhandled = jiffies;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2015-06-03 22:13:28 -06:00
|
|
|
irq = irq_desc_get_irq(desc);
|
2007-05-24 09:37:14 -06:00
|
|
|
if (unlikely(try_misrouted_irq(irq, desc, action_ret))) {
|
|
|
|
int ok = misrouted_irq(irq);
|
|
|
|
if (action_ret == IRQ_NONE)
|
|
|
|
desc->irqs_unhandled -= ok;
|
2005-06-28 21:45:18 -06:00
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
desc->irq_count++;
|
2006-06-23 03:05:32 -06:00
|
|
|
if (likely(desc->irq_count < 100000))
|
2005-04-16 16:20:36 -06:00
|
|
|
return;
|
|
|
|
|
|
|
|
desc->irq_count = 0;
|
2006-06-23 03:05:32 -06:00
|
|
|
if (unlikely(desc->irqs_unhandled > 99900)) {
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* The interrupt is stuck
|
|
|
|
*/
|
2015-06-23 12:02:43 -06:00
|
|
|
__report_bad_irq(desc, action_ret);
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Now kill the IRQ
|
|
|
|
*/
|
|
|
|
printk(KERN_EMERG "Disabling IRQ #%d\n", irq);
|
2011-02-07 12:40:54 -07:00
|
|
|
desc->istate |= IRQS_SPURIOUS_DISABLED;
|
2008-04-28 09:01:56 -06:00
|
|
|
desc->depth++;
|
2011-02-03 04:27:44 -07:00
|
|
|
irq_disable(desc);
|
2008-07-10 15:48:54 -06:00
|
|
|
|
2008-10-16 01:55:00 -06:00
|
|
|
mod_timer(&poll_spurious_irq_timer,
|
|
|
|
jiffies + POLL_SPURIOUS_IRQ_INTERVAL);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
desc->irqs_unhandled = 0;
|
|
|
|
}
|
|
|
|
|
2012-01-12 16:02:18 -07:00
|
|
|
bool noirqdebug __read_mostly;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-01-10 17:52:44 -07:00
|
|
|
int noirqdebug_setup(char *str)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
noirqdebug = 1;
|
|
|
|
printk(KERN_INFO "IRQ lockup detection disabled\n");
|
2006-06-29 03:24:40 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
__setup("noirqdebug", noirqdebug_setup);
|
2008-01-30 05:32:48 -07:00
|
|
|
module_param(noirqdebug, bool, 0644);
|
|
|
|
MODULE_PARM_DESC(noirqdebug, "Disable irq lockup detection when true");
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-06-28 21:45:18 -06:00
|
|
|
static int __init irqfixup_setup(char *str)
|
|
|
|
{
|
|
|
|
irqfixup = 1;
|
|
|
|
printk(KERN_WARNING "Misrouted IRQ fixup support enabled.\n");
|
|
|
|
printk(KERN_WARNING "This may impact system performance.\n");
|
2006-06-29 03:24:40 -06:00
|
|
|
|
2005-06-28 21:45:18 -06:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
__setup("irqfixup", irqfixup_setup);
|
2008-01-30 05:32:48 -07:00
|
|
|
module_param(irqfixup, int, 0644);
|
2005-06-28 21:45:18 -06:00
|
|
|
|
|
|
|
static int __init irqpoll_setup(char *str)
|
|
|
|
{
|
|
|
|
irqfixup = 2;
|
|
|
|
printk(KERN_WARNING "Misrouted IRQ fixup and polling support "
|
|
|
|
"enabled\n");
|
|
|
|
printk(KERN_WARNING "This may significantly impact system "
|
|
|
|
"performance\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
__setup("irqpoll", irqpoll_setup);
|