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 15:07:57 +01:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2008-04-28 17:14:26 +01:00
|
|
|
/*
|
|
|
|
* Count register synchronisation.
|
|
|
|
*
|
2024-06-12 09:54:32 +01:00
|
|
|
* Derived from arch/x86/kernel/tsc_sync.c
|
|
|
|
* Copyright (C) 2006, Red Hat, Inc., Ingo Molnar
|
2008-04-28 17:14:26 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/irqflags.h>
|
2009-06-17 16:40:34 -07:00
|
|
|
#include <linux/cpumask.h>
|
2024-06-12 09:54:32 +01:00
|
|
|
#include <linux/atomic.h>
|
|
|
|
#include <linux/nmi.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/spinlock.h>
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2009-06-17 16:40:34 -07:00
|
|
|
#include <asm/r4k-timer.h>
|
2008-04-28 17:14:26 +01:00
|
|
|
#include <asm/mipsregs.h>
|
2024-06-12 09:54:32 +01:00
|
|
|
#include <asm/time.h>
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
#define COUNTON 100
|
|
|
|
#define NR_LOOPS 3
|
|
|
|
#define LOOP_TIMEOUT 20
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Entry/exit counters that make sure that both CPUs
|
|
|
|
* run the measurement code at once:
|
|
|
|
*/
|
|
|
|
static atomic_t start_count;
|
|
|
|
static atomic_t stop_count;
|
|
|
|
static atomic_t test_runs;
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* We use a raw spinlock in this exceptional case, because
|
|
|
|
* we want to have the fastest, inlined, non-debug version
|
|
|
|
* of a critical section, to be able to prove counter time-warps:
|
|
|
|
*/
|
|
|
|
static arch_spinlock_t sync_lock = __ARCH_SPIN_LOCK_UNLOCKED;
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
static uint32_t last_counter;
|
|
|
|
static uint32_t max_warp;
|
|
|
|
static int nr_warps;
|
|
|
|
static int random_warps;
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Counter warp measurement loop running on both CPUs.
|
|
|
|
*/
|
|
|
|
static uint32_t check_counter_warp(void)
|
|
|
|
{
|
|
|
|
uint32_t start, now, prev, end, cur_max_warp = 0;
|
|
|
|
int i, cur_warps = 0;
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
start = read_c0_count();
|
|
|
|
end = start + (uint32_t) mips_hpt_frequency / 1000 * LOOP_TIMEOUT;
|
2016-01-21 21:09:51 +08:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
for (i = 0; ; i++) {
|
2008-04-28 17:14:26 +01:00
|
|
|
/*
|
2024-06-12 09:54:32 +01:00
|
|
|
* We take the global lock, measure counter, save the
|
|
|
|
* previous counter that was measured (possibly on
|
|
|
|
* another CPU) and update the previous counter timestamp.
|
2008-04-28 17:14:26 +01:00
|
|
|
*/
|
2024-06-12 09:54:32 +01:00
|
|
|
arch_spin_lock(&sync_lock);
|
|
|
|
prev = last_counter;
|
|
|
|
now = read_c0_count();
|
|
|
|
last_counter = now;
|
|
|
|
arch_spin_unlock(&sync_lock);
|
2008-04-28 17:14:26 +01:00
|
|
|
|
|
|
|
/*
|
2024-06-12 09:54:32 +01:00
|
|
|
* Be nice every now and then (and also check whether
|
|
|
|
* measurement is done [we also insert a 10 million
|
|
|
|
* loops safety exit, so we dont lock up in case the
|
|
|
|
* counter is totally broken]):
|
2008-04-28 17:14:26 +01:00
|
|
|
*/
|
2024-06-12 09:54:32 +01:00
|
|
|
if (unlikely(!(i & 7))) {
|
|
|
|
if (now > end || i > 10000000)
|
|
|
|
break;
|
|
|
|
cpu_relax();
|
|
|
|
touch_nmi_watchdog();
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Outside the critical section we can now see whether
|
|
|
|
* we saw a time-warp of the counter going backwards:
|
|
|
|
*/
|
|
|
|
if (unlikely(prev > now)) {
|
|
|
|
arch_spin_lock(&sync_lock);
|
|
|
|
max_warp = max(max_warp, prev - now);
|
|
|
|
cur_max_warp = max_warp;
|
|
|
|
/*
|
|
|
|
* Check whether this bounces back and forth. Only
|
|
|
|
* one CPU should observe time going backwards.
|
|
|
|
*/
|
|
|
|
if (cur_warps != nr_warps)
|
|
|
|
random_warps++;
|
|
|
|
nr_warps++;
|
|
|
|
cur_warps = nr_warps;
|
|
|
|
arch_spin_unlock(&sync_lock);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
WARN(!(now-start),
|
|
|
|
"Warning: zero counter calibration delta: %d [max: %d]\n",
|
|
|
|
now-start, end-start);
|
|
|
|
return cur_max_warp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The freshly booted CPU initiates this via an async SMP function call.
|
|
|
|
*/
|
|
|
|
static void check_counter_sync_source(void *__cpu)
|
|
|
|
{
|
|
|
|
unsigned int cpu = (unsigned long)__cpu;
|
|
|
|
int cpus = 2;
|
|
|
|
|
|
|
|
atomic_set(&test_runs, NR_LOOPS);
|
|
|
|
retry:
|
|
|
|
/* Wait for the target to start. */
|
|
|
|
while (atomic_read(&start_count) != cpus - 1)
|
|
|
|
cpu_relax();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Trigger the target to continue into the measurement too:
|
|
|
|
*/
|
|
|
|
atomic_inc(&start_count);
|
|
|
|
|
|
|
|
check_counter_warp();
|
|
|
|
|
|
|
|
while (atomic_read(&stop_count) != cpus-1)
|
|
|
|
cpu_relax();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the test was successful set the number of runs to zero and
|
|
|
|
* stop. If not, decrement the number of runs an check if we can
|
|
|
|
* retry. In case of random warps no retry is attempted.
|
|
|
|
*/
|
|
|
|
if (!nr_warps) {
|
|
|
|
atomic_set(&test_runs, 0);
|
|
|
|
|
|
|
|
pr_info("Counter synchronization [CPU#%d -> CPU#%u]: passed\n",
|
|
|
|
smp_processor_id(), cpu);
|
|
|
|
} else if (atomic_dec_and_test(&test_runs) || random_warps) {
|
|
|
|
/* Force it to 0 if random warps brought us here */
|
|
|
|
atomic_set(&test_runs, 0);
|
|
|
|
|
|
|
|
pr_info("Counter synchronization [CPU#%d -> CPU#%u]:\n",
|
|
|
|
smp_processor_id(), cpu);
|
|
|
|
pr_info("Measured %d cycles counter warp between CPUs", max_warp);
|
|
|
|
if (random_warps)
|
|
|
|
pr_warn("Counter warped randomly between CPUs\n");
|
2008-04-28 17:14:26 +01:00
|
|
|
}
|
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Reset it - just in case we boot another CPU later:
|
|
|
|
*/
|
|
|
|
atomic_set(&start_count, 0);
|
|
|
|
random_warps = 0;
|
|
|
|
nr_warps = 0;
|
|
|
|
max_warp = 0;
|
|
|
|
last_counter = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Let the target continue with the bootup:
|
|
|
|
*/
|
|
|
|
atomic_inc(&stop_count);
|
2008-04-28 17:14:26 +01:00
|
|
|
|
|
|
|
/*
|
2024-06-12 09:54:32 +01:00
|
|
|
* Retry, if there is a chance to do so.
|
2008-04-28 17:14:26 +01:00
|
|
|
*/
|
2024-06-12 09:54:32 +01:00
|
|
|
if (atomic_read(&test_runs) > 0)
|
|
|
|
goto retry;
|
2008-04-28 17:14:26 +01:00
|
|
|
}
|
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Freshly booted CPUs call into this:
|
|
|
|
*/
|
MIPS: Delete __cpuinit/__CPUINIT usage from MIPS code
commit 3747069b25e419f6b51395f48127e9812abc3596 upstream.
The __cpuinit type of throwaway sections might have made sense
some time ago when RAM was more constrained, but now the savings
do not offset the cost and complications. For example, the fix in
commit 5e427ec2d0 ("x86: Fix bit corruption at CPU resume time")
is a good example of the nasty type of bugs that can be created
with improper use of the various __init prefixes.
After a discussion on LKML[1] it was decided that cpuinit should go
the way of devinit and be phased out. Once all the users are gone,
we can then finally remove the macros themselves from linux/init.h.
Note that some harmless section mismatch warnings may result, since
notify_cpu_starting() and cpu_up() are arch independent (kernel/cpu.c)
and are flagged as __cpuinit -- so if we remove the __cpuinit from
the arch specific callers, we will also get section mismatch warnings.
As an intermediate step, we intend to turn the linux/init.h cpuinit
related content into no-ops as early as possible, since that will get
rid of these warnings. In any case, they are temporary and harmless.
Here, we remove all the MIPS __cpuinit from C code and __CPUINIT
from asm files. MIPS is interesting in this respect, because there
are also uasm users hiding behind their own renamed versions of the
__cpuinit macros.
[1] https://lkml.org/lkml/2013/5/20/589
[ralf@linux-mips.org: Folded in Paul's followup fix.]
Signed-off-by: Paul Gortmaker <paul.gortmaker@windriver.com>
Cc: linux-mips@linux-mips.org
Patchwork: https://patchwork.linux-mips.org/patch/5494/
Patchwork: https://patchwork.linux-mips.org/patch/5495/
Patchwork: https://patchwork.linux-mips.org/patch/5509/
Signed-off-by: Ralf Baechle <ralf@linux-mips.org>
2013-06-18 13:38:59 +00:00
|
|
|
void synchronise_count_slave(int cpu)
|
2008-04-28 17:14:26 +01:00
|
|
|
{
|
2024-06-12 09:54:32 +01:00
|
|
|
uint32_t cur_max_warp, gbl_max_warp, count;
|
|
|
|
int cpus = 2;
|
2020-01-22 15:39:08 +03:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
if (!cpu_has_counter || !mips_hpt_frequency)
|
|
|
|
return;
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/* Kick the control CPU into the counter synchronization function */
|
|
|
|
smp_call_function_single(cpumask_first(cpu_online_mask),
|
|
|
|
check_counter_sync_source,
|
|
|
|
(unsigned long *)(unsigned long)cpu, 0);
|
|
|
|
retry:
|
2008-04-28 17:14:26 +01:00
|
|
|
/*
|
2024-06-12 09:54:32 +01:00
|
|
|
* Register this CPU's participation and wait for the
|
|
|
|
* source CPU to start the measurement:
|
2008-04-28 17:14:26 +01:00
|
|
|
*/
|
2024-06-12 09:54:32 +01:00
|
|
|
atomic_inc(&start_count);
|
|
|
|
while (atomic_read(&start_count) != cpus)
|
|
|
|
cpu_relax();
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
cur_max_warp = check_counter_warp();
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Store the maximum observed warp value for a potential retry:
|
|
|
|
*/
|
|
|
|
gbl_max_warp = max_warp;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ok, we are done:
|
|
|
|
*/
|
|
|
|
atomic_inc(&stop_count);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for the source CPU to print stuff:
|
|
|
|
*/
|
|
|
|
while (atomic_read(&stop_count) != cpus)
|
|
|
|
cpu_relax();
|
2008-04-28 17:14:26 +01:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* Reset it for the next sync test:
|
|
|
|
*/
|
|
|
|
atomic_set(&stop_count, 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check the number of remaining test runs. If not zero, the test
|
|
|
|
* failed and a retry with adjusted counter is possible. If zero the
|
|
|
|
* test was either successful or failed terminally.
|
|
|
|
*/
|
|
|
|
if (!atomic_read(&test_runs)) {
|
|
|
|
/* Arrange for an interrupt in a short while */
|
|
|
|
write_c0_compare(read_c0_count() + COUNTON);
|
|
|
|
return;
|
2008-04-28 17:14:26 +01:00
|
|
|
}
|
2020-01-22 15:39:08 +03:00
|
|
|
|
2024-06-12 09:54:32 +01:00
|
|
|
/*
|
|
|
|
* If the warp value of this CPU is 0, then the other CPU
|
|
|
|
* observed time going backwards so this counter was ahead and
|
|
|
|
* needs to move backwards.
|
|
|
|
*/
|
|
|
|
if (!cur_max_warp)
|
|
|
|
cur_max_warp = -gbl_max_warp;
|
|
|
|
|
|
|
|
count = read_c0_count();
|
|
|
|
count += cur_max_warp;
|
|
|
|
write_c0_count(count);
|
|
|
|
|
|
|
|
pr_debug("Counter compensate: CPU%u observed %d warp\n", cpu, cur_max_warp);
|
|
|
|
|
|
|
|
goto retry;
|
|
|
|
|
2008-04-28 17:14:26 +01:00
|
|
|
}
|