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
|
|
|
/*
|
|
|
|
* Copyright (C) 1992, 1998-2004 Linus Torvalds, Ingo Molnar
|
|
|
|
*
|
|
|
|
* This file contains the /proc/irq/ handling code.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/irq.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/gfp.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/proc_fs.h>
|
2008-08-12 16:09:03 -06:00
|
|
|
#include <linux/seq_file.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/interrupt.h>
|
2010-12-16 09:21:47 -07:00
|
|
|
#include <linux/kernel_stat.h>
|
2015-09-26 05:23:56 -06:00
|
|
|
#include <linux/mutex.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-01-08 02:02:17 -07:00
|
|
|
#include "internals.h"
|
|
|
|
|
2014-12-11 15:01:41 -07:00
|
|
|
/*
|
|
|
|
* Access rules:
|
|
|
|
*
|
|
|
|
* procfs protects read/write of /proc/irq/N/ files against a
|
|
|
|
* concurrent free of the interrupt descriptor. remove_proc_entry()
|
|
|
|
* immediately prevents new read/writes to happen and waits for
|
|
|
|
* already running read/write functions to complete.
|
|
|
|
*
|
|
|
|
* We remove the proc entries first and then delete the interrupt
|
|
|
|
* descriptor from the radix tree and free it. So it is guaranteed
|
|
|
|
* that irq_to_desc(N) is valid as long as the read/writes are
|
|
|
|
* permitted by procfs.
|
|
|
|
*
|
|
|
|
* The read from /proc/interrupts is a different problem because there
|
|
|
|
* is no protection. So the lookup and the access to irqdesc
|
|
|
|
* information must be protected by sparse_irq_lock.
|
|
|
|
*/
|
2006-06-29 03:24:42 -06:00
|
|
|
static struct proc_dir_entry *root_irq_dir;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
|
2017-06-19 17:37:38 -06:00
|
|
|
enum {
|
|
|
|
AFFINITY,
|
|
|
|
AFFINITY_LIST,
|
|
|
|
EFFECTIVE,
|
|
|
|
EFFECTIVE_LIST,
|
|
|
|
};
|
|
|
|
|
2017-06-19 17:37:35 -06:00
|
|
|
static int show_irq_affinity(int type, struct seq_file *m)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2008-08-19 21:50:05 -06:00
|
|
|
struct irq_desc *desc = irq_to_desc((long)m->private);
|
2017-06-19 17:37:38 -06:00
|
|
|
const struct cpumask *mask;
|
2007-07-21 09:09:54 -06:00
|
|
|
|
2017-06-19 17:37:38 -06:00
|
|
|
switch (type) {
|
|
|
|
case AFFINITY:
|
|
|
|
case AFFINITY_LIST:
|
|
|
|
mask = desc->irq_common_data.affinity;
|
2007-07-21 09:09:54 -06:00
|
|
|
#ifdef CONFIG_GENERIC_PENDING_IRQ
|
2017-06-19 17:37:38 -06:00
|
|
|
if (irqd_is_setaffinity_pending(&desc->irq_data))
|
|
|
|
mask = desc->pending_mask;
|
2007-07-21 09:09:54 -06:00
|
|
|
#endif
|
2017-06-19 17:37:38 -06:00
|
|
|
break;
|
|
|
|
case EFFECTIVE:
|
|
|
|
case EFFECTIVE_LIST:
|
|
|
|
#ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
|
2017-08-18 02:39:15 -06:00
|
|
|
mask = irq_data_get_effective_affinity_mask(&desc->irq_data);
|
2017-06-19 17:37:38 -06:00
|
|
|
break;
|
|
|
|
#endif
|
2017-08-25 14:34:05 -06:00
|
|
|
default:
|
|
|
|
return -EINVAL;
|
2017-08-22 01:50:53 -06:00
|
|
|
}
|
2017-06-19 17:37:38 -06:00
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case AFFINITY_LIST:
|
|
|
|
case EFFECTIVE_LIST:
|
2015-02-13 15:38:10 -07:00
|
|
|
seq_printf(m, "%*pbl\n", cpumask_pr_args(mask));
|
2017-06-19 17:37:38 -06:00
|
|
|
break;
|
|
|
|
case AFFINITY:
|
|
|
|
case EFFECTIVE:
|
2015-02-13 15:38:10 -07:00
|
|
|
seq_printf(m, "%*pb\n", cpumask_pr_args(mask));
|
2017-06-19 17:37:38 -06:00
|
|
|
break;
|
|
|
|
}
|
2008-08-12 16:09:03 -06:00
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2010-04-30 15:44:50 -06:00
|
|
|
static int irq_affinity_hint_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
struct irq_desc *desc = irq_to_desc((long)m->private);
|
|
|
|
unsigned long flags;
|
|
|
|
cpumask_var_t mask;
|
|
|
|
|
2010-05-05 14:56:42 -06:00
|
|
|
if (!zalloc_cpumask_var(&mask, GFP_KERNEL))
|
2010-04-30 15:44:50 -06:00
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
raw_spin_lock_irqsave(&desc->lock, flags);
|
|
|
|
if (desc->affinity_hint)
|
|
|
|
cpumask_copy(mask, desc->affinity_hint);
|
|
|
|
raw_spin_unlock_irqrestore(&desc->lock, flags);
|
|
|
|
|
2015-02-13 15:38:10 -07:00
|
|
|
seq_printf(m, "%*pb\n", cpumask_pr_args(mask));
|
2010-04-30 15:44:50 -06:00
|
|
|
free_cpumask_var(mask);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-05-10 23:42:44 -06:00
|
|
|
#ifndef is_affinity_mask_valid
|
|
|
|
#define is_affinity_mask_valid(val) 1
|
|
|
|
#endif
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
int no_irq_affinity;
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
static int irq_affinity_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2017-06-19 17:37:38 -06:00
|
|
|
return show_irq_affinity(AFFINITY, m);
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_affinity_list_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2017-06-19 17:37:38 -06:00
|
|
|
return show_irq_affinity(AFFINITY_LIST, m);
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static ssize_t write_irq_affinity(int type, struct file *file,
|
2008-08-12 16:09:03 -06:00
|
|
|
const char __user *buffer, size_t count, loff_t *pos)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
unsigned int irq = (int)(long)PDE_DATA(file_inode(file));
|
2008-12-13 03:50:26 -07:00
|
|
|
cpumask_var_t new_value;
|
2008-08-12 16:09:03 -06:00
|
|
|
int err;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2016-07-04 02:39:23 -06:00
|
|
|
if (!irq_can_set_affinity_usr(irq) || no_irq_affinity)
|
2005-04-16 16:20:36 -06:00
|
|
|
return -EIO;
|
|
|
|
|
2008-12-13 03:50:26 -07:00
|
|
|
if (!alloc_cpumask_var(&new_value, GFP_KERNEL))
|
|
|
|
return -ENOMEM;
|
|
|
|
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
if (type)
|
|
|
|
err = cpumask_parselist_user(buffer, count, new_value);
|
|
|
|
else
|
|
|
|
err = cpumask_parse_user(buffer, count, new_value);
|
2005-04-16 16:20:36 -06:00
|
|
|
if (err)
|
2008-12-13 03:50:26 -07:00
|
|
|
goto free_cpumask;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-01-03 04:50:46 -07:00
|
|
|
if (!is_affinity_mask_valid(new_value)) {
|
2008-12-13 03:50:26 -07:00
|
|
|
err = -EINVAL;
|
|
|
|
goto free_cpumask;
|
|
|
|
}
|
2007-05-10 23:42:44 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Do not allow disabling IRQs completely - it's a too easy
|
|
|
|
* way to make the system unusable accidentally :-) At least
|
|
|
|
* one online CPU still has to be targeted.
|
|
|
|
*/
|
2008-12-13 03:50:26 -07:00
|
|
|
if (!cpumask_intersects(new_value, cpu_online_mask)) {
|
2017-06-19 17:37:21 -06:00
|
|
|
/*
|
|
|
|
* Special case for empty set - allow the architecture code
|
|
|
|
* to set default SMP affinity.
|
|
|
|
*/
|
|
|
|
err = irq_select_affinity_usr(irq) ? -EINVAL : count;
|
2008-12-13 03:50:26 -07:00
|
|
|
} else {
|
2017-11-07 18:55:03 -07:00
|
|
|
err = irq_set_affinity(irq, new_value);
|
|
|
|
if (!err)
|
|
|
|
err = count;
|
2008-12-13 03:50:26 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
free_cpumask:
|
|
|
|
free_cpumask_var(new_value);
|
|
|
|
return err;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
static ssize_t irq_affinity_proc_write(struct file *file,
|
|
|
|
const char __user *buffer, size_t count, loff_t *pos)
|
|
|
|
{
|
|
|
|
return write_irq_affinity(0, file, buffer, count, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t irq_affinity_list_proc_write(struct file *file,
|
|
|
|
const char __user *buffer, size_t count, loff_t *pos)
|
|
|
|
{
|
|
|
|
return write_irq_affinity(1, file, buffer, count, pos);
|
|
|
|
}
|
|
|
|
|
2008-08-12 16:09:03 -06:00
|
|
|
static int irq_affinity_proc_open(struct inode *inode, struct file *file)
|
2008-05-29 12:02:52 -06:00
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, irq_affinity_proc_show, PDE_DATA(inode));
|
2008-05-29 12:02:52 -06:00
|
|
|
}
|
|
|
|
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
static int irq_affinity_list_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, irq_affinity_list_proc_show, PDE_DATA(inode));
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
}
|
|
|
|
|
2010-04-30 15:44:50 -06:00
|
|
|
static int irq_affinity_hint_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, irq_affinity_hint_proc_show, PDE_DATA(inode));
|
2010-04-30 15:44:50 -06:00
|
|
|
}
|
|
|
|
|
2008-08-12 16:09:03 -06:00
|
|
|
static const struct file_operations irq_affinity_proc_fops = {
|
|
|
|
.open = irq_affinity_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
.write = irq_affinity_proc_write,
|
|
|
|
};
|
|
|
|
|
2010-04-30 15:44:50 -06:00
|
|
|
static const struct file_operations irq_affinity_hint_proc_fops = {
|
|
|
|
.open = irq_affinity_hint_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
static const struct file_operations irq_affinity_list_proc_fops = {
|
|
|
|
.open = irq_affinity_list_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
.write = irq_affinity_list_proc_write,
|
|
|
|
};
|
|
|
|
|
2017-06-19 17:37:38 -06:00
|
|
|
#ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
|
|
|
|
static int irq_effective_aff_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
return show_irq_affinity(EFFECTIVE, m);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_effective_aff_list_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
return show_irq_affinity(EFFECTIVE_LIST, m);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_effective_aff_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return single_open(file, irq_effective_aff_proc_show, PDE_DATA(inode));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_effective_aff_list_proc_open(struct inode *inode,
|
|
|
|
struct file *file)
|
|
|
|
{
|
|
|
|
return single_open(file, irq_effective_aff_list_proc_show,
|
|
|
|
PDE_DATA(inode));
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations irq_effective_aff_proc_fops = {
|
|
|
|
.open = irq_effective_aff_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct file_operations irq_effective_aff_list_proc_fops = {
|
|
|
|
.open = irq_effective_aff_list_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2008-08-12 16:09:03 -06:00
|
|
|
static int default_affinity_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2015-02-13 15:38:10 -07:00
|
|
|
seq_printf(m, "%*pb\n", cpumask_pr_args(irq_default_affinity));
|
2008-08-12 16:09:03 -06:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t default_affinity_write(struct file *file,
|
|
|
|
const char __user *buffer, size_t count, loff_t *ppos)
|
2008-05-29 12:02:52 -06:00
|
|
|
{
|
2008-12-31 16:42:26 -07:00
|
|
|
cpumask_var_t new_value;
|
2008-08-12 16:09:03 -06:00
|
|
|
int err;
|
2008-05-29 12:02:52 -06:00
|
|
|
|
2008-12-31 16:42:26 -07:00
|
|
|
if (!alloc_cpumask_var(&new_value, GFP_KERNEL))
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
err = cpumask_parse_user(buffer, count, new_value);
|
2008-05-29 12:02:52 -06:00
|
|
|
if (err)
|
2008-12-31 16:42:26 -07:00
|
|
|
goto out;
|
2008-05-29 12:02:52 -06:00
|
|
|
|
2008-12-31 16:42:26 -07:00
|
|
|
if (!is_affinity_mask_valid(new_value)) {
|
|
|
|
err = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
2008-05-29 12:02:52 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Do not allow disabling IRQs completely - it's a too easy
|
|
|
|
* way to make the system unusable accidentally :-) At least
|
|
|
|
* one online CPU still has to be targeted.
|
|
|
|
*/
|
2008-12-31 16:42:26 -07:00
|
|
|
if (!cpumask_intersects(new_value, cpu_online_mask)) {
|
|
|
|
err = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
2008-05-29 12:02:52 -06:00
|
|
|
|
2008-12-31 16:42:26 -07:00
|
|
|
cpumask_copy(irq_default_affinity, new_value);
|
|
|
|
err = count;
|
2008-05-29 12:02:52 -06:00
|
|
|
|
2008-12-31 16:42:26 -07:00
|
|
|
out:
|
|
|
|
free_cpumask_var(new_value);
|
|
|
|
return err;
|
2008-05-29 12:02:52 -06:00
|
|
|
}
|
2008-08-12 16:09:03 -06:00
|
|
|
|
|
|
|
static int default_affinity_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, default_affinity_show, PDE_DATA(inode));
|
2008-08-12 16:09:03 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations default_affinity_proc_fops = {
|
|
|
|
.open = default_affinity_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
.write = default_affinity_write,
|
|
|
|
};
|
2010-03-11 15:08:56 -07:00
|
|
|
|
|
|
|
static int irq_node_proc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
struct irq_desc *desc = irq_to_desc((long) m->private);
|
|
|
|
|
2015-06-01 02:05:13 -06:00
|
|
|
seq_printf(m, "%d\n", irq_desc_get_node(desc));
|
2010-03-11 15:08:56 -07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_node_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, irq_node_proc_show, PDE_DATA(inode));
|
2010-03-11 15:08:56 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations irq_node_proc_fops = {
|
|
|
|
.open = irq_node_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif
|
|
|
|
|
2009-08-28 12:19:33 -06:00
|
|
|
static int irq_spurious_proc_show(struct seq_file *m, void *v)
|
2008-01-30 05:32:48 -07:00
|
|
|
{
|
2009-08-28 12:19:33 -06:00
|
|
|
struct irq_desc *desc = irq_to_desc((long) m->private);
|
|
|
|
|
|
|
|
seq_printf(m, "count %u\n" "unhandled %u\n" "last_unhandled %u ms\n",
|
|
|
|
desc->irq_count, desc->irqs_unhandled,
|
|
|
|
jiffies_to_msecs(desc->last_unhandled));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int irq_spurious_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2013-03-31 16:16:14 -06:00
|
|
|
return single_open(file, irq_spurious_proc_show, PDE_DATA(inode));
|
2008-01-30 05:32:48 -07:00
|
|
|
}
|
|
|
|
|
2009-08-28 12:19:33 -06:00
|
|
|
static const struct file_operations irq_spurious_proc_fops = {
|
|
|
|
.open = irq_spurious_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
};
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#define MAX_NAMELEN 128
|
|
|
|
|
|
|
|
static int name_unique(unsigned int irq, struct irqaction *new_action)
|
|
|
|
{
|
2008-08-19 21:50:05 -06:00
|
|
|
struct irq_desc *desc = irq_to_desc(irq);
|
2005-04-16 16:20:36 -06:00
|
|
|
struct irqaction *action;
|
2007-05-08 01:27:31 -06:00
|
|
|
unsigned long flags;
|
|
|
|
int ret = 1;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-11-17 08:46:45 -07:00
|
|
|
raw_spin_lock_irqsave(&desc->lock, flags);
|
2016-01-14 02:54:13 -07:00
|
|
|
for_each_action_of_desc(desc, action) {
|
2005-04-16 16:20:36 -06:00
|
|
|
if ((action != new_action) && action->name &&
|
2007-05-08 01:27:31 -06:00
|
|
|
!strcmp(new_action->name, action->name)) {
|
|
|
|
ret = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-11-17 08:46:45 -07:00
|
|
|
raw_spin_unlock_irqrestore(&desc->lock, flags);
|
2007-05-08 01:27:31 -06:00
|
|
|
return ret;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
void register_handler_proc(unsigned int irq, struct irqaction *action)
|
|
|
|
{
|
|
|
|
char name [MAX_NAMELEN];
|
2008-08-19 21:50:05 -06:00
|
|
|
struct irq_desc *desc = irq_to_desc(irq);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2008-08-19 21:50:05 -06:00
|
|
|
if (!desc->dir || action->dir || !action->name ||
|
2005-04-16 16:20:36 -06:00
|
|
|
!name_unique(irq, action))
|
|
|
|
return;
|
|
|
|
|
|
|
|
snprintf(name, MAX_NAMELEN, "%s", action->name);
|
|
|
|
|
|
|
|
/* create /proc/irq/1234/handler/ */
|
2008-08-19 21:50:05 -06:00
|
|
|
action->dir = proc_mkdir(name, desc->dir);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
#undef MAX_NAMELEN
|
|
|
|
|
|
|
|
#define MAX_NAMELEN 10
|
|
|
|
|
2008-08-19 21:50:11 -06:00
|
|
|
void register_irq_proc(unsigned int irq, struct irq_desc *desc)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2015-09-26 05:23:56 -06:00
|
|
|
static DEFINE_MUTEX(register_lock);
|
2017-06-19 17:37:37 -06:00
|
|
|
void __maybe_unused *irqp = (void *)(unsigned long) irq;
|
2005-04-16 16:20:36 -06:00
|
|
|
char name [MAX_NAMELEN];
|
|
|
|
|
2015-09-26 05:23:56 -06:00
|
|
|
if (!root_irq_dir || (desc->irq_data.chip == &no_irq_chip))
|
2005-04-16 16:20:36 -06:00
|
|
|
return;
|
|
|
|
|
2015-09-26 05:23:56 -06:00
|
|
|
/*
|
|
|
|
* irq directories are registered only when a handler is
|
|
|
|
* added, not when the descriptor is created, so multiple
|
|
|
|
* tasks might try to register at the same time.
|
|
|
|
*/
|
|
|
|
mutex_lock(®ister_lock);
|
|
|
|
|
|
|
|
if (desc->dir)
|
|
|
|
goto out_unlock;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
sprintf(name, "%d", irq);
|
|
|
|
|
|
|
|
/* create /proc/irq/1234 */
|
2008-08-19 21:50:05 -06:00
|
|
|
desc->dir = proc_mkdir(name, root_irq_dir);
|
2009-10-26 14:28:11 -06:00
|
|
|
if (!desc->dir)
|
2015-09-26 05:23:56 -06:00
|
|
|
goto out_unlock;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
2008-08-12 16:09:03 -06:00
|
|
|
/* create /proc/irq/<irq>/smp_affinity */
|
2014-03-13 20:50:55 -06:00
|
|
|
proc_create_data("smp_affinity", 0644, desc->dir,
|
2017-06-19 17:37:37 -06:00
|
|
|
&irq_affinity_proc_fops, irqp);
|
2010-03-11 15:08:56 -07:00
|
|
|
|
2010-04-30 15:44:50 -06:00
|
|
|
/* create /proc/irq/<irq>/affinity_hint */
|
2014-03-13 20:50:55 -06:00
|
|
|
proc_create_data("affinity_hint", 0444, desc->dir,
|
2017-06-19 17:37:37 -06:00
|
|
|
&irq_affinity_hint_proc_fops, irqp);
|
2010-04-30 15:44:50 -06:00
|
|
|
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
/* create /proc/irq/<irq>/smp_affinity_list */
|
2014-03-13 20:50:55 -06:00
|
|
|
proc_create_data("smp_affinity_list", 0644, desc->dir,
|
2017-06-19 17:37:37 -06:00
|
|
|
&irq_affinity_list_proc_fops, irqp);
|
bitmap, irq: add smp_affinity_list interface to /proc/irq
Manually adjusting the smp_affinity for IRQ's becomes unwieldy when the
cpu count is large.
Setting smp affinity to cpus 256 to 263 would be:
echo 000000ff,00000000,00000000,00000000,00000000,00000000,00000000,00000000 > smp_affinity
instead of:
echo 256-263 > smp_affinity_list
Think about what it looks like for cpus around say, 4088 to 4095.
We already have many alternate "list" interfaces:
/sys/devices/system/cpu/cpuX/indexY/shared_cpu_list
/sys/devices/system/cpu/cpuX/topology/thread_siblings_list
/sys/devices/system/cpu/cpuX/topology/core_siblings_list
/sys/devices/system/node/nodeX/cpulist
/sys/devices/pci***/***/local_cpulist
Add a companion interface, smp_affinity_list to use cpu lists instead of
cpu maps. This conforms to other companion interfaces where both a map
and a list interface exists.
This required adding a bitmap_parselist_user() function in a manner
similar to the bitmap_parse_user() function.
[akpm@linux-foundation.org: make __bitmap_parselist() static]
Signed-off-by: Mike Travis <travis@sgi.com>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Jack Steiner <steiner@sgi.com>
Cc: Lee Schermerhorn <lee.schermerhorn@hp.com>
Cc: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2011-05-24 18:13:12 -06:00
|
|
|
|
2010-03-11 15:08:56 -07:00
|
|
|
proc_create_data("node", 0444, desc->dir,
|
2017-06-19 17:37:37 -06:00
|
|
|
&irq_node_proc_fops, irqp);
|
2017-06-19 17:37:38 -06:00
|
|
|
# ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
|
|
|
|
proc_create_data("effective_affinity", 0444, desc->dir,
|
|
|
|
&irq_effective_aff_proc_fops, irqp);
|
|
|
|
proc_create_data("effective_affinity_list", 0444, desc->dir,
|
|
|
|
&irq_effective_aff_list_proc_fops, irqp);
|
|
|
|
# endif
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif
|
2009-08-28 12:19:33 -06:00
|
|
|
proc_create_data("spurious", 0444, desc->dir,
|
|
|
|
&irq_spurious_proc_fops, (void *)(long)irq);
|
2015-09-26 05:23:56 -06:00
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
mutex_unlock(®ister_lock);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2010-09-29 18:46:07 -06:00
|
|
|
void unregister_irq_proc(unsigned int irq, struct irq_desc *desc)
|
|
|
|
{
|
|
|
|
char name [MAX_NAMELEN];
|
|
|
|
|
|
|
|
if (!root_irq_dir || !desc->dir)
|
|
|
|
return;
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
remove_proc_entry("smp_affinity", desc->dir);
|
|
|
|
remove_proc_entry("affinity_hint", desc->dir);
|
2011-05-25 23:09:40 -06:00
|
|
|
remove_proc_entry("smp_affinity_list", desc->dir);
|
2010-09-29 18:46:07 -06:00
|
|
|
remove_proc_entry("node", desc->dir);
|
2017-06-19 17:37:38 -06:00
|
|
|
# ifdef CONFIG_GENERIC_IRQ_EFFECTIVE_AFF_MASK
|
|
|
|
remove_proc_entry("effective_affinity", desc->dir);
|
|
|
|
remove_proc_entry("effective_affinity_list", desc->dir);
|
|
|
|
# endif
|
2010-09-29 18:46:07 -06:00
|
|
|
#endif
|
|
|
|
remove_proc_entry("spurious", desc->dir);
|
|
|
|
|
|
|
|
sprintf(name, "%u", irq);
|
|
|
|
remove_proc_entry(name, root_irq_dir);
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
#undef MAX_NAMELEN
|
|
|
|
|
|
|
|
void unregister_handler_proc(unsigned int irq, struct irqaction *action)
|
|
|
|
{
|
2013-04-12 10:27:28 -06:00
|
|
|
proc_remove(action->dir);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-10-21 17:49:09 -06:00
|
|
|
static void register_default_affinity_proc(void)
|
2008-05-29 12:02:52 -06:00
|
|
|
{
|
|
|
|
#ifdef CONFIG_SMP
|
2014-03-13 20:50:55 -06:00
|
|
|
proc_create("irq/default_smp_affinity", 0644, NULL,
|
2008-08-12 16:09:03 -06:00
|
|
|
&default_affinity_proc_fops);
|
2008-05-29 12:02:52 -06:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
void init_irq_proc(void)
|
|
|
|
{
|
2008-08-19 21:50:11 -06:00
|
|
|
unsigned int irq;
|
|
|
|
struct irq_desc *desc;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* create /proc/irq */
|
|
|
|
root_irq_dir = proc_mkdir("irq", NULL);
|
|
|
|
if (!root_irq_dir)
|
|
|
|
return;
|
|
|
|
|
2008-05-29 12:02:52 -06:00
|
|
|
register_default_affinity_proc();
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* Create entries for all existing IRQs.
|
|
|
|
*/
|
2016-03-19 07:59:19 -06:00
|
|
|
for_each_irq_desc(irq, desc)
|
2008-08-19 21:50:11 -06:00
|
|
|
register_irq_proc(irq, desc);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2010-12-16 09:21:47 -07:00
|
|
|
#ifdef CONFIG_GENERIC_IRQ_SHOW
|
|
|
|
|
|
|
|
int __weak arch_show_interrupts(struct seq_file *p, int prec)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-03-25 15:20:51 -06:00
|
|
|
#ifndef ACTUAL_NR_IRQS
|
|
|
|
# define ACTUAL_NR_IRQS nr_irqs
|
|
|
|
#endif
|
|
|
|
|
2010-12-16 09:21:47 -07:00
|
|
|
int show_interrupts(struct seq_file *p, void *v)
|
|
|
|
{
|
|
|
|
static int prec;
|
|
|
|
|
|
|
|
unsigned long flags, any_count = 0;
|
|
|
|
int i = *(loff_t *) v, j;
|
|
|
|
struct irqaction *action;
|
|
|
|
struct irq_desc *desc;
|
|
|
|
|
2011-03-25 15:20:51 -06:00
|
|
|
if (i > ACTUAL_NR_IRQS)
|
2010-12-16 09:21:47 -07:00
|
|
|
return 0;
|
|
|
|
|
2011-03-25 15:20:51 -06:00
|
|
|
if (i == ACTUAL_NR_IRQS)
|
2010-12-16 09:21:47 -07:00
|
|
|
return arch_show_interrupts(p, prec);
|
|
|
|
|
|
|
|
/* print header and calculate the width of the first column */
|
|
|
|
if (i == 0) {
|
|
|
|
for (prec = 3, j = 1000; prec < 10 && j <= nr_irqs; ++prec)
|
|
|
|
j *= 10;
|
|
|
|
|
|
|
|
seq_printf(p, "%*s", prec + 8, "");
|
|
|
|
for_each_online_cpu(j)
|
|
|
|
seq_printf(p, "CPU%-8d", j);
|
|
|
|
seq_putc(p, '\n');
|
|
|
|
}
|
|
|
|
|
2014-12-11 15:01:41 -07:00
|
|
|
irq_lock_sparse();
|
2010-12-16 09:21:47 -07:00
|
|
|
desc = irq_to_desc(i);
|
|
|
|
if (!desc)
|
2014-12-11 15:01:41 -07:00
|
|
|
goto outsparse;
|
2010-12-16 09:21:47 -07:00
|
|
|
|
|
|
|
raw_spin_lock_irqsave(&desc->lock, flags);
|
|
|
|
for_each_online_cpu(j)
|
|
|
|
any_count |= kstat_irqs_cpu(i, j);
|
|
|
|
action = desc->action;
|
2015-11-10 02:58:12 -07:00
|
|
|
if ((!action || irq_desc_is_chained(desc)) && !any_count)
|
2010-12-16 09:21:47 -07:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
seq_printf(p, "%*d: ", prec, i);
|
|
|
|
for_each_online_cpu(j)
|
|
|
|
seq_printf(p, "%10u ", kstat_irqs_cpu(i, j));
|
2011-03-25 09:48:50 -06:00
|
|
|
|
|
|
|
if (desc->irq_data.chip) {
|
|
|
|
if (desc->irq_data.chip->irq_print_chip)
|
|
|
|
desc->irq_data.chip->irq_print_chip(&desc->irq_data, p);
|
|
|
|
else if (desc->irq_data.chip->name)
|
|
|
|
seq_printf(p, " %8s", desc->irq_data.chip->name);
|
|
|
|
else
|
|
|
|
seq_printf(p, " %8s", "-");
|
|
|
|
} else {
|
|
|
|
seq_printf(p, " %8s", "None");
|
|
|
|
}
|
2012-01-26 16:29:19 -07:00
|
|
|
if (desc->irq_data.domain)
|
|
|
|
seq_printf(p, " %*d", prec, (int) desc->irq_data.hwirq);
|
2017-02-10 09:54:16 -07:00
|
|
|
else
|
|
|
|
seq_printf(p, " %*s", prec, "");
|
2011-04-30 14:56:20 -06:00
|
|
|
#ifdef CONFIG_GENERIC_IRQ_SHOW_LEVEL
|
2011-03-25 09:48:50 -06:00
|
|
|
seq_printf(p, " %-8s", irqd_is_level_type(&desc->irq_data) ? "Level" : "Edge");
|
|
|
|
#endif
|
2011-03-17 06:36:57 -06:00
|
|
|
if (desc->name)
|
|
|
|
seq_printf(p, "-%-8s", desc->name);
|
2010-12-16 09:21:47 -07:00
|
|
|
|
|
|
|
if (action) {
|
|
|
|
seq_printf(p, " %s", action->name);
|
|
|
|
while ((action = action->next) != NULL)
|
|
|
|
seq_printf(p, ", %s", action->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
seq_putc(p, '\n');
|
|
|
|
out:
|
|
|
|
raw_spin_unlock_irqrestore(&desc->lock, flags);
|
2014-12-11 15:01:41 -07:00
|
|
|
outsparse:
|
|
|
|
irq_unlock_sparse();
|
2010-12-16 09:21:47 -07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|