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 */
|
2005-04-17 00:20:36 +02:00
|
|
|
#ifndef _ASM_GENERIC_DIV64_H
|
|
|
|
#define _ASM_GENERIC_DIV64_H
|
|
|
|
/*
|
|
|
|
* Copyright (C) 2003 Bernardo Innocenti <bernie@develer.com>
|
|
|
|
* Based on former asm-ppc/div64.h and asm-m68knommu/div64.h
|
|
|
|
*
|
2015-10-30 20:36:39 +01:00
|
|
|
* Optimization for constant divisors on 32-bit machines:
|
|
|
|
* Copyright (C) 2006-2015 Nicolas Pitre
|
|
|
|
*
|
2005-04-17 00:20:36 +02:00
|
|
|
* The semantics of do_div() are:
|
|
|
|
*
|
|
|
|
* uint32_t do_div(uint64_t *n, uint32_t base)
|
|
|
|
* {
|
|
|
|
* uint32_t remainder = *n % base;
|
|
|
|
* *n = *n / base;
|
|
|
|
* return remainder;
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* NOTE: macro parameter n is evaluated multiple times,
|
|
|
|
* beware of side effects!
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
|
|
|
|
#if BITS_PER_LONG == 64
|
|
|
|
|
2017-09-30 17:43:42 +02:00
|
|
|
/**
|
|
|
|
* do_div - returns 2 values: calculate remainder and update new dividend
|
|
|
|
* @n: pointer to uint64_t dividend (will be updated)
|
|
|
|
* @base: uint32_t divisor
|
|
|
|
*
|
|
|
|
* Summary:
|
|
|
|
* ``uint32_t remainder = *n % base;``
|
|
|
|
* ``*n = *n / base;``
|
|
|
|
*
|
|
|
|
* Return: (uint32_t)remainder
|
|
|
|
*
|
|
|
|
* NOTE: macro parameter @n is evaluated multiple times,
|
|
|
|
* beware of side effects!
|
|
|
|
*/
|
2005-04-17 00:20:36 +02:00
|
|
|
# define do_div(n,base) ({ \
|
|
|
|
uint32_t __base = (base); \
|
|
|
|
uint32_t __rem; \
|
|
|
|
__rem = ((uint64_t)(n)) % __base; \
|
|
|
|
(n) = ((uint64_t)(n)) / __base; \
|
|
|
|
__rem; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#elif BITS_PER_LONG == 32
|
|
|
|
|
2015-11-02 20:55:05 +01:00
|
|
|
#include <linux/log2.h>
|
|
|
|
|
2015-10-30 20:36:39 +01:00
|
|
|
/*
|
|
|
|
* If the divisor happens to be constant, we determine the appropriate
|
|
|
|
* inverse at compile time to turn the division into a few inline
|
|
|
|
* multiplications which ought to be much faster. And yet only if compiling
|
|
|
|
* with a sufficiently recent gcc version to perform proper 64-bit constant
|
|
|
|
* propagation.
|
|
|
|
*
|
|
|
|
* (It is unfortunate that gcc doesn't perform all this internally.)
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __div64_const32_is_OK
|
|
|
|
#define __div64_const32_is_OK (__GNUC__ >= 4)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define __div64_const32(n, ___b) \
|
|
|
|
({ \
|
|
|
|
/* \
|
|
|
|
* Multiplication by reciprocal of b: n / b = n * (p / b) / p \
|
|
|
|
* \
|
|
|
|
* We rely on the fact that most of this code gets optimized \
|
|
|
|
* away at compile time due to constant propagation and only \
|
|
|
|
* a few multiplication instructions should remain. \
|
|
|
|
* Hence this monstrous macro (static inline doesn't always \
|
|
|
|
* do the trick here). \
|
|
|
|
*/ \
|
|
|
|
uint64_t ___res, ___x, ___t, ___m, ___n = (n); \
|
2015-10-30 22:54:56 +01:00
|
|
|
uint32_t ___p, ___bias; \
|
2015-10-30 20:36:39 +01:00
|
|
|
\
|
|
|
|
/* determine MSB of b */ \
|
|
|
|
___p = 1 << ilog2(___b); \
|
|
|
|
\
|
|
|
|
/* compute m = ((p << 64) + b - 1) / b */ \
|
|
|
|
___m = (~0ULL / ___b) * ___p; \
|
|
|
|
___m += (((~0ULL % ___b + 1) * ___p) + ___b - 1) / ___b; \
|
|
|
|
\
|
|
|
|
/* one less than the dividend with highest result */ \
|
|
|
|
___x = ~0ULL / ___b * ___b - 1; \
|
|
|
|
\
|
|
|
|
/* test our ___m with res = m * x / (p << 64) */ \
|
|
|
|
___res = ((___m & 0xffffffff) * (___x & 0xffffffff)) >> 32; \
|
|
|
|
___t = ___res += (___m & 0xffffffff) * (___x >> 32); \
|
|
|
|
___res += (___x & 0xffffffff) * (___m >> 32); \
|
|
|
|
___t = (___res < ___t) ? (1ULL << 32) : 0; \
|
|
|
|
___res = (___res >> 32) + ___t; \
|
|
|
|
___res += (___m >> 32) * (___x >> 32); \
|
|
|
|
___res /= ___p; \
|
|
|
|
\
|
|
|
|
/* Now sanitize and optimize what we've got. */ \
|
|
|
|
if (~0ULL % (___b / (___b & -___b)) == 0) { \
|
|
|
|
/* special case, can be simplified to ... */ \
|
|
|
|
___n /= (___b & -___b); \
|
|
|
|
___m = ~0ULL / (___b / (___b & -___b)); \
|
|
|
|
___p = 1; \
|
|
|
|
___bias = 1; \
|
|
|
|
} else if (___res != ___x / ___b) { \
|
|
|
|
/* \
|
|
|
|
* We can't get away without a bias to compensate \
|
|
|
|
* for bit truncation errors. To avoid it we'd need an \
|
|
|
|
* additional bit to represent m which would overflow \
|
|
|
|
* a 64-bit variable. \
|
|
|
|
* \
|
|
|
|
* Instead we do m = p / b and n / b = (n * m + m) / p. \
|
|
|
|
*/ \
|
|
|
|
___bias = 1; \
|
|
|
|
/* Compute m = (p << 64) / b */ \
|
|
|
|
___m = (~0ULL / ___b) * ___p; \
|
|
|
|
___m += ((~0ULL % ___b + 1) * ___p) / ___b; \
|
|
|
|
} else { \
|
|
|
|
/* \
|
|
|
|
* Reduce m / p, and try to clear bit 31 of m when \
|
|
|
|
* possible, otherwise that'll need extra overflow \
|
|
|
|
* handling later. \
|
|
|
|
*/ \
|
|
|
|
uint32_t ___bits = -(___m & -___m); \
|
|
|
|
___bits |= ___m >> 32; \
|
|
|
|
___bits = (~___bits) << 1; \
|
|
|
|
/* \
|
|
|
|
* If ___bits == 0 then setting bit 31 is unavoidable. \
|
|
|
|
* Simply apply the maximum possible reduction in that \
|
|
|
|
* case. Otherwise the MSB of ___bits indicates the \
|
|
|
|
* best reduction we should apply. \
|
|
|
|
*/ \
|
|
|
|
if (!___bits) { \
|
|
|
|
___p /= (___m & -___m); \
|
|
|
|
___m /= (___m & -___m); \
|
|
|
|
} else { \
|
|
|
|
___p >>= ilog2(___bits); \
|
|
|
|
___m >>= ilog2(___bits); \
|
|
|
|
} \
|
|
|
|
/* No bias needed. */ \
|
|
|
|
___bias = 0; \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
/* \
|
|
|
|
* Now we have a combination of 2 conditions: \
|
|
|
|
* \
|
|
|
|
* 1) whether or not we need to apply a bias, and \
|
|
|
|
* \
|
|
|
|
* 2) whether or not there might be an overflow in the cross \
|
|
|
|
* product determined by (___m & ((1 << 63) | (1 << 31))). \
|
|
|
|
* \
|
2015-10-30 22:54:56 +01:00
|
|
|
* Select the best way to do (m_bias + m * n) / (1 << 64). \
|
2015-10-30 20:36:39 +01:00
|
|
|
* From now on there will be actual runtime code generated. \
|
|
|
|
*/ \
|
2015-10-30 22:54:56 +01:00
|
|
|
___res = __arch_xprod_64(___m, ___n, ___bias); \
|
2015-10-30 20:36:39 +01:00
|
|
|
\
|
|
|
|
___res /= ___p; \
|
|
|
|
})
|
|
|
|
|
2015-10-30 22:54:56 +01:00
|
|
|
#ifndef __arch_xprod_64
|
|
|
|
/*
|
|
|
|
* Default C implementation for __arch_xprod_64()
|
|
|
|
*
|
|
|
|
* Prototype: uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias)
|
|
|
|
* Semantic: retval = ((bias ? m : 0) + m * n) >> 64
|
|
|
|
*
|
|
|
|
* The product is a 128-bit value, scaled down to 64 bits.
|
|
|
|
* Assuming constant propagation to optimize away unused conditional code.
|
|
|
|
* Architectures may provide their own optimized assembly implementation.
|
|
|
|
*/
|
|
|
|
static inline uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias)
|
|
|
|
{
|
|
|
|
uint32_t m_lo = m;
|
|
|
|
uint32_t m_hi = m >> 32;
|
|
|
|
uint32_t n_lo = n;
|
|
|
|
uint32_t n_hi = n >> 32;
|
|
|
|
uint64_t res, tmp;
|
|
|
|
|
|
|
|
if (!bias) {
|
|
|
|
res = ((uint64_t)m_lo * n_lo) >> 32;
|
|
|
|
} else if (!(m & ((1ULL << 63) | (1ULL << 31)))) {
|
|
|
|
/* there can't be any overflow here */
|
|
|
|
res = (m + (uint64_t)m_lo * n_lo) >> 32;
|
|
|
|
} else {
|
|
|
|
res = m + (uint64_t)m_lo * n_lo;
|
|
|
|
tmp = (res < m) ? (1ULL << 32) : 0;
|
|
|
|
res = (res >> 32) + tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!(m & ((1ULL << 63) | (1ULL << 31)))) {
|
|
|
|
/* there can't be any overflow here */
|
|
|
|
res += (uint64_t)m_lo * n_hi;
|
|
|
|
res += (uint64_t)m_hi * n_lo;
|
|
|
|
res >>= 32;
|
|
|
|
} else {
|
|
|
|
tmp = res += (uint64_t)m_lo * n_hi;
|
|
|
|
res += (uint64_t)m_hi * n_lo;
|
|
|
|
tmp = (res < tmp) ? (1ULL << 32) : 0;
|
|
|
|
res = (res >> 32) + tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
res += (uint64_t)m_hi * n_hi;
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-11-02 19:02:46 +01:00
|
|
|
#ifndef __div64_32
|
2005-04-17 00:20:36 +02:00
|
|
|
extern uint32_t __div64_32(uint64_t *dividend, uint32_t divisor);
|
2015-11-02 19:02:46 +01:00
|
|
|
#endif
|
2005-04-17 00:20:36 +02:00
|
|
|
|
|
|
|
/* The unnecessary pointer compare is there
|
|
|
|
* to check for type safety (n must be 64bit)
|
|
|
|
*/
|
|
|
|
# define do_div(n,base) ({ \
|
|
|
|
uint32_t __base = (base); \
|
|
|
|
uint32_t __rem; \
|
|
|
|
(void)(((typeof((n)) *)0) == ((uint64_t *)0)); \
|
2015-11-02 20:55:05 +01:00
|
|
|
if (__builtin_constant_p(__base) && \
|
|
|
|
is_power_of_2(__base)) { \
|
|
|
|
__rem = (n) & (__base - 1); \
|
|
|
|
(n) >>= ilog2(__base); \
|
2015-10-30 20:36:39 +01:00
|
|
|
} else if (__div64_const32_is_OK && \
|
|
|
|
__builtin_constant_p(__base) && \
|
|
|
|
__base != 0) { \
|
|
|
|
uint32_t __res_lo, __n_lo = (n); \
|
|
|
|
(n) = __div64_const32(n, __base); \
|
|
|
|
/* the remainder can be computed with 32-bit regs */ \
|
|
|
|
__res_lo = (n); \
|
|
|
|
__rem = __n_lo - __res_lo * __base; \
|
2015-11-02 20:55:05 +01:00
|
|
|
} else if (likely(((n) >> 32) == 0)) { \
|
2005-04-17 00:20:36 +02:00
|
|
|
__rem = (uint32_t)(n) % __base; \
|
|
|
|
(n) = (uint32_t)(n) / __base; \
|
|
|
|
} else \
|
|
|
|
__rem = __div64_32(&(n), __base); \
|
|
|
|
__rem; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#else /* BITS_PER_LONG == ?? */
|
|
|
|
|
|
|
|
# error do_div() does not yet support the C64
|
|
|
|
|
|
|
|
#endif /* BITS_PER_LONG */
|
|
|
|
|
|
|
|
#endif /* _ASM_GENERIC_DIV64_H */
|