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 14:07:57 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2006-07-03 07:24:52 +00:00
|
|
|
/*
|
|
|
|
* kernel/lockdep_proc.c
|
|
|
|
*
|
|
|
|
* Runtime locking correctness validator
|
|
|
|
*
|
|
|
|
* Started by Ingo Molnar:
|
|
|
|
*
|
2007-07-19 08:48:59 +00:00
|
|
|
* Copyright (C) 2006,2007 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
|
2015-11-16 10:08:45 +00:00
|
|
|
* Copyright (C) 2007 Red Hat, Inc., Peter Zijlstra
|
2006-07-03 07:24:52 +00:00
|
|
|
*
|
|
|
|
* Code for /proc/lockdep and /proc/lockdep_stats:
|
|
|
|
*
|
|
|
|
*/
|
2011-05-23 18:51:41 +00:00
|
|
|
#include <linux/export.h>
|
2006-07-03 07:24:52 +00:00
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <linux/debug_locks.h>
|
2007-07-19 08:48:57 +00:00
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
#include <linux/sort.h>
|
2016-12-24 19:46:01 +00:00
|
|
|
#include <linux/uaccess.h>
|
2007-07-19 08:48:57 +00:00
|
|
|
#include <asm/div64.h>
|
2006-07-03 07:24:52 +00:00
|
|
|
|
|
|
|
#include "lockdep_internals.h"
|
|
|
|
|
|
|
|
static void *l_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
2009-08-17 05:40:17 +00:00
|
|
|
return seq_list_next(v, &all_lock_classes, pos);
|
2006-07-03 07:24:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *l_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
2009-08-17 05:40:17 +00:00
|
|
|
return seq_list_start_head(&all_lock_classes, *pos);
|
2006-07-03 07:24:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void l_stop(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2007-02-10 09:44:59 +00:00
|
|
|
static void print_name(struct seq_file *m, struct lock_class *class)
|
|
|
|
{
|
2012-10-20 19:05:19 +00:00
|
|
|
char str[KSYM_NAME_LEN];
|
2007-02-10 09:44:59 +00:00
|
|
|
const char *name = class->name;
|
|
|
|
|
|
|
|
if (!name) {
|
|
|
|
name = __get_key_name(class->key, str);
|
|
|
|
seq_printf(m, "%s", name);
|
|
|
|
} else{
|
|
|
|
seq_printf(m, "%s", name);
|
|
|
|
if (class->name_version > 1)
|
|
|
|
seq_printf(m, "#%d", class->name_version);
|
|
|
|
if (class->subclass)
|
|
|
|
seq_printf(m, "/%d", class->subclass);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-03 07:24:52 +00:00
|
|
|
static int l_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2009-08-17 05:40:17 +00:00
|
|
|
struct lock_class *class = list_entry(v, struct lock_class, lock_entry);
|
2007-02-10 09:44:59 +00:00
|
|
|
struct lock_list *entry;
|
2009-01-22 16:53:47 +00:00
|
|
|
char usage[LOCK_USAGE_CHARS];
|
2006-07-03 07:24:52 +00:00
|
|
|
|
2009-08-17 05:40:17 +00:00
|
|
|
if (v == &all_lock_classes) {
|
2007-10-11 20:11:11 +00:00
|
|
|
seq_printf(m, "all lock classes:\n");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-07-03 07:24:52 +00:00
|
|
|
seq_printf(m, "%p", class->key);
|
|
|
|
#ifdef CONFIG_DEBUG_LOCKDEP
|
2018-10-03 17:07:18 +00:00
|
|
|
seq_printf(m, " OPS:%8ld", debug_class_ops_read(class));
|
2006-07-03 07:24:52 +00:00
|
|
|
#endif
|
2008-08-15 16:33:05 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
|
|
|
seq_printf(m, " FD:%5ld", lockdep_count_forward_deps(class));
|
|
|
|
seq_printf(m, " BD:%5ld", lockdep_count_backward_deps(class));
|
|
|
|
#endif
|
2006-07-03 07:24:52 +00:00
|
|
|
|
2009-01-22 16:53:47 +00:00
|
|
|
get_usage_chars(class, usage);
|
|
|
|
seq_printf(m, " %s", usage);
|
2006-07-03 07:24:52 +00:00
|
|
|
|
2007-02-10 09:44:59 +00:00
|
|
|
seq_printf(m, ": ");
|
|
|
|
print_name(m, class);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
|
|
|
|
list_for_each_entry(entry, &class->locks_after, entry) {
|
|
|
|
if (entry->distance == 1) {
|
2008-06-13 06:40:17 +00:00
|
|
|
seq_printf(m, " -> [%p] ", entry->class->key);
|
2007-02-10 09:44:59 +00:00
|
|
|
print_name(m, entry->class);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
2006-07-03 07:24:52 +00:00
|
|
|
}
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-12-07 04:40:36 +00:00
|
|
|
static const struct seq_operations lockdep_ops = {
|
2006-07-03 07:24:52 +00:00
|
|
|
.start = l_start,
|
|
|
|
.next = l_next,
|
|
|
|
.stop = l_stop,
|
|
|
|
.show = l_show,
|
|
|
|
};
|
|
|
|
|
2008-06-23 03:20:54 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
2008-06-20 08:39:21 +00:00
|
|
|
static void *lc_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
2019-02-14 23:00:48 +00:00
|
|
|
if (*pos < 0)
|
|
|
|
return NULL;
|
|
|
|
|
2008-06-20 08:39:21 +00:00
|
|
|
if (*pos == 0)
|
|
|
|
return SEQ_START_TOKEN;
|
|
|
|
|
2019-02-14 23:00:48 +00:00
|
|
|
return lock_chains + (*pos - 1);
|
2008-06-20 08:39:21 +00:00
|
|
|
}
|
|
|
|
|
2009-08-17 05:40:39 +00:00
|
|
|
static void *lc_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
2019-02-14 23:00:48 +00:00
|
|
|
*pos = lockdep_next_lockchain(*pos - 1) + 1;
|
2009-08-17 05:40:39 +00:00
|
|
|
return lc_start(m, pos);
|
|
|
|
}
|
|
|
|
|
2008-06-20 08:39:21 +00:00
|
|
|
static void lc_stop(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static int lc_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
struct lock_chain *chain = v;
|
|
|
|
struct lock_class *class;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (v == SEQ_START_TOKEN) {
|
2016-03-30 09:36:59 +00:00
|
|
|
if (nr_chain_hlocks > MAX_LOCKDEP_CHAIN_HLOCKS)
|
|
|
|
seq_printf(m, "(buggered) ");
|
2008-06-20 08:39:21 +00:00
|
|
|
seq_printf(m, "all lock chains:\n");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
seq_printf(m, "irq_context: %d\n", chain->irq_context);
|
|
|
|
|
|
|
|
for (i = 0; i < chain->depth; i++) {
|
|
|
|
class = lock_chain_get_class(chain, i);
|
2008-08-11 07:30:26 +00:00
|
|
|
if (!class->key)
|
|
|
|
continue;
|
|
|
|
|
2008-06-20 08:39:21 +00:00
|
|
|
seq_printf(m, "[%p] ", class->key);
|
|
|
|
print_name(m, class);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct seq_operations lockdep_chains_ops = {
|
|
|
|
.start = lc_start,
|
|
|
|
.next = lc_next,
|
|
|
|
.stop = lc_stop,
|
|
|
|
.show = lc_show,
|
|
|
|
};
|
2008-06-23 03:20:54 +00:00
|
|
|
#endif /* CONFIG_PROVE_LOCKING */
|
2008-06-20 08:39:21 +00:00
|
|
|
|
2006-07-03 07:24:52 +00:00
|
|
|
static void lockdep_stats_debug_show(struct seq_file *m)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_DEBUG_LOCKDEP
|
2010-04-05 22:10:17 +00:00
|
|
|
unsigned long long hi1 = debug_atomic_read(hardirqs_on_events),
|
|
|
|
hi2 = debug_atomic_read(hardirqs_off_events),
|
|
|
|
hr1 = debug_atomic_read(redundant_hardirqs_on),
|
|
|
|
hr2 = debug_atomic_read(redundant_hardirqs_off),
|
|
|
|
si1 = debug_atomic_read(softirqs_on_events),
|
|
|
|
si2 = debug_atomic_read(softirqs_off_events),
|
|
|
|
sr1 = debug_atomic_read(redundant_softirqs_on),
|
|
|
|
sr2 = debug_atomic_read(redundant_softirqs_off);
|
|
|
|
|
|
|
|
seq_printf(m, " chain lookup misses: %11llu\n",
|
|
|
|
debug_atomic_read(chain_lookup_misses));
|
|
|
|
seq_printf(m, " chain lookup hits: %11llu\n",
|
|
|
|
debug_atomic_read(chain_lookup_hits));
|
|
|
|
seq_printf(m, " cyclic checks: %11llu\n",
|
|
|
|
debug_atomic_read(nr_cyclic_checks));
|
2017-03-03 09:13:38 +00:00
|
|
|
seq_printf(m, " redundant checks: %11llu\n",
|
|
|
|
debug_atomic_read(nr_redundant_checks));
|
|
|
|
seq_printf(m, " redundant links: %11llu\n",
|
|
|
|
debug_atomic_read(nr_redundant));
|
2010-04-05 22:10:17 +00:00
|
|
|
seq_printf(m, " find-mask forwards checks: %11llu\n",
|
|
|
|
debug_atomic_read(nr_find_usage_forwards_checks));
|
|
|
|
seq_printf(m, " find-mask backwards checks: %11llu\n",
|
|
|
|
debug_atomic_read(nr_find_usage_backwards_checks));
|
|
|
|
|
|
|
|
seq_printf(m, " hardirq on events: %11llu\n", hi1);
|
|
|
|
seq_printf(m, " hardirq off events: %11llu\n", hi2);
|
|
|
|
seq_printf(m, " redundant hardirq ons: %11llu\n", hr1);
|
|
|
|
seq_printf(m, " redundant hardirq offs: %11llu\n", hr2);
|
|
|
|
seq_printf(m, " softirq on events: %11llu\n", si1);
|
|
|
|
seq_printf(m, " softirq off events: %11llu\n", si2);
|
|
|
|
seq_printf(m, " redundant softirq ons: %11llu\n", sr1);
|
|
|
|
seq_printf(m, " redundant softirq offs: %11llu\n", sr2);
|
2006-07-03 07:24:52 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static int lockdep_stats_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
struct lock_class *class;
|
|
|
|
unsigned long nr_unused = 0, nr_uncategorized = 0,
|
|
|
|
nr_irq_safe = 0, nr_irq_unsafe = 0,
|
|
|
|
nr_softirq_safe = 0, nr_softirq_unsafe = 0,
|
|
|
|
nr_hardirq_safe = 0, nr_hardirq_unsafe = 0,
|
|
|
|
nr_irq_read_safe = 0, nr_irq_read_unsafe = 0,
|
|
|
|
nr_softirq_read_safe = 0, nr_softirq_read_unsafe = 0,
|
|
|
|
nr_hardirq_read_safe = 0, nr_hardirq_read_unsafe = 0,
|
2011-03-23 12:38:28 +00:00
|
|
|
sum_forward_deps = 0;
|
2006-07-03 07:24:52 +00:00
|
|
|
|
|
|
|
list_for_each_entry(class, &all_lock_classes, lock_entry) {
|
|
|
|
|
|
|
|
if (class->usage_mask == 0)
|
|
|
|
nr_unused++;
|
|
|
|
if (class->usage_mask == LOCKF_USED)
|
|
|
|
nr_uncategorized++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_IRQ)
|
|
|
|
nr_irq_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_IRQ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_irq_unsafe++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_SOFTIRQ)
|
|
|
|
nr_softirq_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_SOFTIRQ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_softirq_unsafe++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_HARDIRQ)
|
|
|
|
nr_hardirq_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_HARDIRQ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_hardirq_unsafe++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_IRQ_READ)
|
|
|
|
nr_irq_read_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_IRQ_READ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_irq_read_unsafe++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_SOFTIRQ_READ)
|
|
|
|
nr_softirq_read_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_SOFTIRQ_READ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_softirq_read_unsafe++;
|
|
|
|
if (class->usage_mask & LOCKF_USED_IN_HARDIRQ_READ)
|
|
|
|
nr_hardirq_read_safe++;
|
2009-01-22 12:10:52 +00:00
|
|
|
if (class->usage_mask & LOCKF_ENABLED_HARDIRQ_READ)
|
2006-07-03 07:24:52 +00:00
|
|
|
nr_hardirq_read_unsafe++;
|
|
|
|
|
2008-08-15 16:33:05 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
2008-07-30 04:45:03 +00:00
|
|
|
sum_forward_deps += lockdep_count_forward_deps(class);
|
2008-08-15 16:33:05 +00:00
|
|
|
#endif
|
2006-07-03 07:24:52 +00:00
|
|
|
}
|
2007-02-10 09:46:34 +00:00
|
|
|
#ifdef CONFIG_DEBUG_LOCKDEP
|
2010-04-05 22:10:17 +00:00
|
|
|
DEBUG_LOCKS_WARN_ON(debug_atomic_read(nr_unused_locks) != nr_unused);
|
2006-07-03 07:24:52 +00:00
|
|
|
#endif
|
|
|
|
seq_printf(m, " lock-classes: %11lu [max: %lu]\n",
|
|
|
|
nr_lock_classes, MAX_LOCKDEP_KEYS);
|
|
|
|
seq_printf(m, " direct dependencies: %11lu [max: %lu]\n",
|
|
|
|
nr_list_entries, MAX_LOCKDEP_ENTRIES);
|
|
|
|
seq_printf(m, " indirect dependencies: %11lu\n",
|
|
|
|
sum_forward_deps);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Total number of dependencies:
|
|
|
|
*
|
|
|
|
* All irq-safe locks may nest inside irq-unsafe locks,
|
|
|
|
* plus all the other known dependencies:
|
|
|
|
*/
|
|
|
|
seq_printf(m, " all direct dependencies: %11lu\n",
|
|
|
|
nr_irq_unsafe * nr_irq_safe +
|
|
|
|
nr_hardirq_unsafe * nr_hardirq_safe +
|
|
|
|
nr_list_entries);
|
|
|
|
|
2007-07-19 08:48:54 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
2006-07-03 07:24:52 +00:00
|
|
|
seq_printf(m, " dependency chains: %11lu [max: %lu]\n",
|
2019-02-14 23:00:48 +00:00
|
|
|
lock_chain_count(), MAX_LOCKDEP_CHAINS);
|
2008-06-20 08:39:21 +00:00
|
|
|
seq_printf(m, " dependency chain hlocks: %11d [max: %lu]\n",
|
2008-06-23 03:20:54 +00:00
|
|
|
nr_chain_hlocks, MAX_LOCKDEP_CHAIN_HLOCKS);
|
2007-07-19 08:48:54 +00:00
|
|
|
#endif
|
2006-07-03 07:24:52 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_TRACE_IRQFLAGS
|
|
|
|
seq_printf(m, " in-hardirq chains: %11u\n",
|
|
|
|
nr_hardirq_chains);
|
|
|
|
seq_printf(m, " in-softirq chains: %11u\n",
|
|
|
|
nr_softirq_chains);
|
|
|
|
#endif
|
|
|
|
seq_printf(m, " in-process chains: %11u\n",
|
|
|
|
nr_process_chains);
|
|
|
|
seq_printf(m, " stack-trace entries: %11lu [max: %lu]\n",
|
|
|
|
nr_stack_trace_entries, MAX_STACK_TRACE_ENTRIES);
|
|
|
|
seq_printf(m, " combined max dependencies: %11u\n",
|
|
|
|
(nr_hardirq_chains + 1) *
|
|
|
|
(nr_softirq_chains + 1) *
|
|
|
|
(nr_process_chains + 1)
|
|
|
|
);
|
|
|
|
seq_printf(m, " hardirq-safe locks: %11lu\n",
|
|
|
|
nr_hardirq_safe);
|
|
|
|
seq_printf(m, " hardirq-unsafe locks: %11lu\n",
|
|
|
|
nr_hardirq_unsafe);
|
|
|
|
seq_printf(m, " softirq-safe locks: %11lu\n",
|
|
|
|
nr_softirq_safe);
|
|
|
|
seq_printf(m, " softirq-unsafe locks: %11lu\n",
|
|
|
|
nr_softirq_unsafe);
|
|
|
|
seq_printf(m, " irq-safe locks: %11lu\n",
|
|
|
|
nr_irq_safe);
|
|
|
|
seq_printf(m, " irq-unsafe locks: %11lu\n",
|
|
|
|
nr_irq_unsafe);
|
|
|
|
|
|
|
|
seq_printf(m, " hardirq-read-safe locks: %11lu\n",
|
|
|
|
nr_hardirq_read_safe);
|
|
|
|
seq_printf(m, " hardirq-read-unsafe locks: %11lu\n",
|
|
|
|
nr_hardirq_read_unsafe);
|
|
|
|
seq_printf(m, " softirq-read-safe locks: %11lu\n",
|
|
|
|
nr_softirq_read_safe);
|
|
|
|
seq_printf(m, " softirq-read-unsafe locks: %11lu\n",
|
|
|
|
nr_softirq_read_unsafe);
|
|
|
|
seq_printf(m, " irq-read-safe locks: %11lu\n",
|
|
|
|
nr_irq_read_safe);
|
|
|
|
seq_printf(m, " irq-read-unsafe locks: %11lu\n",
|
|
|
|
nr_irq_read_unsafe);
|
|
|
|
|
|
|
|
seq_printf(m, " uncategorized locks: %11lu\n",
|
|
|
|
nr_uncategorized);
|
|
|
|
seq_printf(m, " unused locks: %11lu\n",
|
|
|
|
nr_unused);
|
|
|
|
seq_printf(m, " max locking depth: %11u\n",
|
|
|
|
max_lockdep_depth);
|
2009-08-02 12:44:24 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
2009-07-16 13:44:29 +00:00
|
|
|
seq_printf(m, " max bfs queue depth: %11u\n",
|
|
|
|
max_bfs_queue_depth);
|
2009-08-02 12:44:24 +00:00
|
|
|
#endif
|
2006-07-03 07:24:52 +00:00
|
|
|
lockdep_stats_debug_show(m);
|
|
|
|
seq_printf(m, " debug_locks: %11u\n",
|
|
|
|
debug_locks);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-07-19 08:48:57 +00:00
|
|
|
#ifdef CONFIG_LOCK_STAT
|
|
|
|
|
|
|
|
struct lock_stat_data {
|
|
|
|
struct lock_class *class;
|
|
|
|
struct lock_class_stats stats;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct lock_stat_seq {
|
|
|
|
struct lock_stat_data *iter_end;
|
|
|
|
struct lock_stat_data stats[MAX_LOCKDEP_KEYS];
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sort on absolute number of contentions
|
|
|
|
*/
|
|
|
|
static int lock_stat_cmp(const void *l, const void *r)
|
|
|
|
{
|
|
|
|
const struct lock_stat_data *dl = l, *dr = r;
|
|
|
|
unsigned long nl, nr;
|
|
|
|
|
|
|
|
nl = dl->stats.read_waittime.nr + dl->stats.write_waittime.nr;
|
|
|
|
nr = dr->stats.read_waittime.nr + dr->stats.write_waittime.nr;
|
|
|
|
|
|
|
|
return nr - nl;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void seq_line(struct seq_file *m, char c, int offset, int length)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < offset; i++)
|
|
|
|
seq_puts(m, " ");
|
|
|
|
for (i = 0; i < length; i++)
|
|
|
|
seq_printf(m, "%c", c);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void snprint_time(char *buf, size_t bufsiz, s64 nr)
|
|
|
|
{
|
2008-09-23 13:33:41 +00:00
|
|
|
s64 div;
|
|
|
|
s32 rem;
|
2007-07-19 08:48:57 +00:00
|
|
|
|
2008-08-25 21:15:33 +00:00
|
|
|
nr += 5; /* for display rounding */
|
2008-09-23 13:33:41 +00:00
|
|
|
div = div_s64_rem(nr, 1000, &rem);
|
|
|
|
snprintf(buf, bufsiz, "%lld.%02d", (long long)div, (int)rem/10);
|
2007-07-19 08:48:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void seq_time(struct seq_file *m, s64 time)
|
|
|
|
{
|
|
|
|
char num[15];
|
|
|
|
|
|
|
|
snprint_time(num, sizeof(num), time);
|
|
|
|
seq_printf(m, " %14s", num);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void seq_lock_time(struct seq_file *m, struct lock_time *lt)
|
|
|
|
{
|
|
|
|
seq_printf(m, "%14lu", lt->nr);
|
|
|
|
seq_time(m, lt->min);
|
|
|
|
seq_time(m, lt->max);
|
|
|
|
seq_time(m, lt->total);
|
2013-11-06 16:42:30 +00:00
|
|
|
seq_time(m, lt->nr ? div_s64(lt->total, lt->nr) : 0);
|
2007-07-19 08:48:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void seq_stats(struct seq_file *m, struct lock_stat_data *data)
|
|
|
|
{
|
2015-06-02 10:50:13 +00:00
|
|
|
struct lockdep_subclass_key *ckey;
|
2007-07-19 08:48:57 +00:00
|
|
|
struct lock_class_stats *stats;
|
2015-06-02 10:50:13 +00:00
|
|
|
struct lock_class *class;
|
|
|
|
const char *cname;
|
2007-07-19 08:48:57 +00:00
|
|
|
int i, namelen;
|
2015-06-02 10:50:13 +00:00
|
|
|
char name[39];
|
2007-07-19 08:48:57 +00:00
|
|
|
|
|
|
|
class = data->class;
|
|
|
|
stats = &data->stats;
|
|
|
|
|
2007-07-19 08:49:01 +00:00
|
|
|
namelen = 38;
|
|
|
|
if (class->name_version > 1)
|
|
|
|
namelen -= 2; /* XXX truncates versions > 9 */
|
|
|
|
if (class->subclass)
|
|
|
|
namelen -= 2;
|
|
|
|
|
2015-06-02 10:50:13 +00:00
|
|
|
rcu_read_lock_sched();
|
|
|
|
cname = rcu_dereference_sched(class->name);
|
|
|
|
ckey = rcu_dereference_sched(class->key);
|
|
|
|
|
|
|
|
if (!cname && !ckey) {
|
|
|
|
rcu_read_unlock_sched();
|
|
|
|
return;
|
|
|
|
|
|
|
|
} else if (!cname) {
|
2007-07-19 08:49:01 +00:00
|
|
|
char str[KSYM_NAME_LEN];
|
|
|
|
const char *key_name;
|
|
|
|
|
2015-06-02 10:50:13 +00:00
|
|
|
key_name = __get_key_name(ckey, str);
|
2007-07-19 08:49:01 +00:00
|
|
|
snprintf(name, namelen, "%s", key_name);
|
|
|
|
} else {
|
2015-06-02 10:50:13 +00:00
|
|
|
snprintf(name, namelen, "%s", cname);
|
2007-07-19 08:49:01 +00:00
|
|
|
}
|
2015-06-02 10:50:13 +00:00
|
|
|
rcu_read_unlock_sched();
|
|
|
|
|
2007-07-19 08:48:57 +00:00
|
|
|
namelen = strlen(name);
|
2007-07-19 08:49:01 +00:00
|
|
|
if (class->name_version > 1) {
|
|
|
|
snprintf(name+namelen, 3, "#%d", class->name_version);
|
|
|
|
namelen += 2;
|
|
|
|
}
|
|
|
|
if (class->subclass) {
|
|
|
|
snprintf(name+namelen, 3, "/%d", class->subclass);
|
|
|
|
namelen += 2;
|
|
|
|
}
|
2007-07-19 08:48:57 +00:00
|
|
|
|
|
|
|
if (stats->write_holdtime.nr) {
|
|
|
|
if (stats->read_holdtime.nr)
|
|
|
|
seq_printf(m, "%38s-W:", name);
|
|
|
|
else
|
|
|
|
seq_printf(m, "%40s:", name);
|
|
|
|
|
2007-07-19 08:49:00 +00:00
|
|
|
seq_printf(m, "%14lu ", stats->bounces[bounce_contended_write]);
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_lock_time(m, &stats->write_waittime);
|
2007-07-19 08:49:00 +00:00
|
|
|
seq_printf(m, " %14lu ", stats->bounces[bounce_acquired_write]);
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_lock_time(m, &stats->write_holdtime);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (stats->read_holdtime.nr) {
|
|
|
|
seq_printf(m, "%38s-R:", name);
|
2007-07-19 08:49:00 +00:00
|
|
|
seq_printf(m, "%14lu ", stats->bounces[bounce_contended_read]);
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_lock_time(m, &stats->read_waittime);
|
2007-07-19 08:49:00 +00:00
|
|
|
seq_printf(m, " %14lu ", stats->bounces[bounce_acquired_read]);
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_lock_time(m, &stats->read_holdtime);
|
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (stats->read_waittime.nr + stats->write_waittime.nr == 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if (stats->read_holdtime.nr)
|
|
|
|
namelen += 2;
|
|
|
|
|
2008-10-16 21:17:09 +00:00
|
|
|
for (i = 0; i < LOCKSTAT_POINTS; i++) {
|
2007-07-19 08:48:57 +00:00
|
|
|
char ip[32];
|
|
|
|
|
|
|
|
if (class->contention_point[i] == 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (!i)
|
|
|
|
seq_line(m, '-', 40-namelen, namelen);
|
|
|
|
|
|
|
|
snprintf(ip, sizeof(ip), "[<%p>]",
|
|
|
|
(void *)class->contention_point[i]);
|
2010-11-05 23:12:38 +00:00
|
|
|
seq_printf(m, "%40s %14lu %29s %pS\n",
|
|
|
|
name, stats->contention_point[i],
|
|
|
|
ip, (void *)class->contention_point[i]);
|
2007-07-19 08:48:57 +00:00
|
|
|
}
|
2008-10-16 21:17:09 +00:00
|
|
|
for (i = 0; i < LOCKSTAT_POINTS; i++) {
|
|
|
|
char ip[32];
|
|
|
|
|
|
|
|
if (class->contending_point[i] == 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (!i)
|
|
|
|
seq_line(m, '-', 40-namelen, namelen);
|
|
|
|
|
|
|
|
snprintf(ip, sizeof(ip), "[<%p>]",
|
|
|
|
(void *)class->contending_point[i]);
|
2010-11-05 23:12:38 +00:00
|
|
|
seq_printf(m, "%40s %14lu %29s %pS\n",
|
|
|
|
name, stats->contending_point[i],
|
|
|
|
ip, (void *)class->contending_point[i]);
|
2008-10-16 21:17:09 +00:00
|
|
|
}
|
2007-07-19 08:48:57 +00:00
|
|
|
if (i) {
|
|
|
|
seq_puts(m, "\n");
|
2013-10-09 03:37:16 +00:00
|
|
|
seq_line(m, '.', 0, 40 + 1 + 12 * (14 + 1));
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_puts(m, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void seq_header(struct seq_file *m)
|
|
|
|
{
|
2013-10-09 03:37:16 +00:00
|
|
|
seq_puts(m, "lock_stat version 0.4\n");
|
2009-02-14 15:59:04 +00:00
|
|
|
|
|
|
|
if (unlikely(!debug_locks))
|
|
|
|
seq_printf(m, "*WARNING* lock debugging disabled!! - possibly due to a lockdep warning\n");
|
|
|
|
|
2013-10-09 03:37:16 +00:00
|
|
|
seq_line(m, '-', 0, 40 + 1 + 12 * (14 + 1));
|
|
|
|
seq_printf(m, "%40s %14s %14s %14s %14s %14s %14s %14s %14s %14s %14s "
|
2007-07-19 08:49:00 +00:00
|
|
|
"%14s %14s\n",
|
2007-07-19 08:48:57 +00:00
|
|
|
"class name",
|
2007-07-19 08:49:00 +00:00
|
|
|
"con-bounces",
|
2007-07-19 08:48:57 +00:00
|
|
|
"contentions",
|
|
|
|
"waittime-min",
|
|
|
|
"waittime-max",
|
|
|
|
"waittime-total",
|
2013-10-09 03:37:16 +00:00
|
|
|
"waittime-avg",
|
2007-07-19 08:49:00 +00:00
|
|
|
"acq-bounces",
|
2007-07-19 08:48:57 +00:00
|
|
|
"acquisitions",
|
|
|
|
"holdtime-min",
|
|
|
|
"holdtime-max",
|
2013-10-09 03:37:16 +00:00
|
|
|
"holdtime-total",
|
|
|
|
"holdtime-avg");
|
|
|
|
seq_line(m, '-', 0, 40 + 1 + 12 * (14 + 1));
|
2007-07-19 08:48:57 +00:00
|
|
|
seq_printf(m, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *ls_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
|
|
|
struct lock_stat_seq *data = m->private;
|
2009-08-17 05:40:59 +00:00
|
|
|
struct lock_stat_data *iter;
|
2007-07-19 08:48:57 +00:00
|
|
|
|
2007-10-11 20:11:11 +00:00
|
|
|
if (*pos == 0)
|
|
|
|
return SEQ_START_TOKEN;
|
2007-07-19 08:48:57 +00:00
|
|
|
|
2009-08-17 05:40:59 +00:00
|
|
|
iter = data->stats + (*pos - 1);
|
|
|
|
if (iter >= data->iter_end)
|
|
|
|
iter = NULL;
|
2007-07-19 08:48:59 +00:00
|
|
|
|
2009-08-17 05:40:59 +00:00
|
|
|
return iter;
|
2007-07-19 08:48:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void *ls_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
|
|
|
(*pos)++;
|
2009-08-17 05:40:59 +00:00
|
|
|
return ls_start(m, pos);
|
2007-07-19 08:48:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ls_stop(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static int ls_show(struct seq_file *m, void *v)
|
|
|
|
{
|
2007-10-11 20:11:11 +00:00
|
|
|
if (v == SEQ_START_TOKEN)
|
|
|
|
seq_header(m);
|
|
|
|
else
|
|
|
|
seq_stats(m, v);
|
2007-07-19 08:48:57 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-09-22 23:43:43 +00:00
|
|
|
static const struct seq_operations lockstat_ops = {
|
2007-07-19 08:48:57 +00:00
|
|
|
.start = ls_start,
|
|
|
|
.next = ls_next,
|
|
|
|
.stop = ls_stop,
|
|
|
|
.show = ls_show,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int lock_stat_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
int res;
|
|
|
|
struct lock_class *class;
|
|
|
|
struct lock_stat_seq *data = vmalloc(sizeof(struct lock_stat_seq));
|
|
|
|
|
|
|
|
if (!data)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
res = seq_open(file, &lockstat_ops);
|
|
|
|
if (!res) {
|
|
|
|
struct lock_stat_data *iter = data->stats;
|
|
|
|
struct seq_file *m = file->private_data;
|
|
|
|
|
|
|
|
list_for_each_entry(class, &all_lock_classes, lock_entry) {
|
|
|
|
iter->class = class;
|
|
|
|
iter->stats = lock_stats(class);
|
|
|
|
iter++;
|
|
|
|
}
|
|
|
|
data->iter_end = iter;
|
|
|
|
|
2009-08-17 05:40:59 +00:00
|
|
|
sort(data->stats, data->iter_end - data->stats,
|
2007-07-19 08:48:57 +00:00
|
|
|
sizeof(struct lock_stat_data),
|
|
|
|
lock_stat_cmp, NULL);
|
|
|
|
|
|
|
|
m->private = data;
|
|
|
|
} else
|
|
|
|
vfree(data);
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t lock_stat_write(struct file *file, const char __user *buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct lock_class *class;
|
|
|
|
char c;
|
|
|
|
|
|
|
|
if (count) {
|
|
|
|
if (get_user(c, buf))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
if (c != '0')
|
|
|
|
return count;
|
|
|
|
|
|
|
|
list_for_each_entry(class, &all_lock_classes, lock_entry)
|
|
|
|
clear_lock_stats(class);
|
|
|
|
}
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int lock_stat_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct seq_file *seq = file->private_data;
|
|
|
|
|
|
|
|
vfree(seq->private);
|
|
|
|
return seq_release(inode, file);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations proc_lock_stat_operations = {
|
|
|
|
.open = lock_stat_open,
|
|
|
|
.write = lock_stat_write,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = lock_stat_release,
|
|
|
|
};
|
|
|
|
#endif /* CONFIG_LOCK_STAT */
|
|
|
|
|
2006-07-03 07:24:52 +00:00
|
|
|
static int __init lockdep_proc_init(void)
|
|
|
|
{
|
2018-04-13 17:44:18 +00:00
|
|
|
proc_create_seq("lockdep", S_IRUSR, NULL, &lockdep_ops);
|
2008-06-23 03:20:54 +00:00
|
|
|
#ifdef CONFIG_PROVE_LOCKING
|
2018-04-13 17:44:18 +00:00
|
|
|
proc_create_seq("lockdep_chains", S_IRUSR, NULL, &lockdep_chains_ops);
|
2008-06-23 03:20:54 +00:00
|
|
|
#endif
|
2018-05-15 13:57:23 +00:00
|
|
|
proc_create_single("lockdep_stats", S_IRUSR, NULL, lockdep_stats_show);
|
2007-07-19 08:48:57 +00:00
|
|
|
#ifdef CONFIG_LOCK_STAT
|
2009-08-07 08:37:10 +00:00
|
|
|
proc_create("lock_stat", S_IRUSR | S_IWUSR, NULL,
|
|
|
|
&proc_lock_stat_operations);
|
2007-07-19 08:48:57 +00:00
|
|
|
#endif
|
|
|
|
|
2006-07-03 07:24:52 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
__initcall(lockdep_proc_init);
|
|
|
|
|