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 22:07:57 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2014-01-09 22:00:52 +08:00
|
|
|
#ifndef _TOOLS_LINUX_COMPILER_H_
|
|
|
|
#define _TOOLS_LINUX_COMPILER_H_
|
2009-10-17 23:12:33 +08:00
|
|
|
|
2020-12-18 20:59:05 +08:00
|
|
|
#include <linux/compiler_types.h>
|
2017-02-10 22:41:11 +08:00
|
|
|
|
2017-02-23 03:48:24 +08:00
|
|
|
#ifndef __compiletime_error
|
|
|
|
# define __compiletime_error(message)
|
|
|
|
#endif
|
|
|
|
|
2020-04-14 22:37:29 +08:00
|
|
|
#ifdef __OPTIMIZE__
|
|
|
|
# define __compiletime_assert(condition, msg, prefix, suffix) \
|
|
|
|
do { \
|
|
|
|
extern void prefix ## suffix(void) __compiletime_error(msg); \
|
|
|
|
if (!(condition)) \
|
|
|
|
prefix ## suffix(); \
|
|
|
|
} while (0)
|
|
|
|
#else
|
|
|
|
# define __compiletime_assert(condition, msg, prefix, suffix) do { } while (0)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define _compiletime_assert(condition, msg, prefix, suffix) \
|
|
|
|
__compiletime_assert(condition, msg, prefix, suffix)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* compiletime_assert - break build and emit msg if condition is false
|
|
|
|
* @condition: a compile-time constant condition to check
|
|
|
|
* @msg: a message to emit if condition is false
|
|
|
|
*
|
|
|
|
* In tradition of POSIX assert, this macro will break the build if the
|
|
|
|
* supplied condition is *false*, emitting the supplied error message if the
|
|
|
|
* compiler has support to do so.
|
|
|
|
*/
|
|
|
|
#define compiletime_assert(condition, msg) \
|
|
|
|
_compiletime_assert(condition, msg, __compiletime_assert_, __COUNTER__)
|
|
|
|
|
2015-05-08 00:38:16 +08:00
|
|
|
/* Optimization barrier */
|
|
|
|
/* The "volatile" is due to gcc bugs */
|
|
|
|
#define barrier() __asm__ __volatile__("": : :"memory")
|
|
|
|
|
2009-10-17 23:12:33 +08:00
|
|
|
#ifndef __always_inline
|
2013-10-07 17:26:18 +08:00
|
|
|
# define __always_inline inline __attribute__((always_inline))
|
2009-10-17 23:12:33 +08:00
|
|
|
#endif
|
2013-10-07 17:26:18 +08:00
|
|
|
|
2017-06-16 22:39:15 +08:00
|
|
|
#ifndef noinline
|
|
|
|
#define noinline
|
|
|
|
#endif
|
|
|
|
|
2017-04-17 22:25:00 +08:00
|
|
|
/* Are two types/vars the same type (ignoring qualifiers)? */
|
|
|
|
#ifndef __same_type
|
|
|
|
# define __same_type(a, b) __builtin_types_compatible_p(typeof(a), typeof(b))
|
|
|
|
#endif
|
|
|
|
|
2016-07-14 23:03:04 +08:00
|
|
|
#ifdef __ANDROID__
|
|
|
|
/*
|
|
|
|
* FIXME: Big hammer to get rid of tons of:
|
|
|
|
* "warning: always_inline function might not be inlinable"
|
|
|
|
*
|
|
|
|
* At least on android-ndk-r12/platforms/android-24/arch-arm
|
|
|
|
*/
|
|
|
|
#undef __always_inline
|
|
|
|
#define __always_inline inline
|
|
|
|
#endif
|
|
|
|
|
2009-10-17 23:12:33 +08:00
|
|
|
#define __user
|
2016-12-17 03:53:45 +08:00
|
|
|
#define __rcu
|
|
|
|
#define __read_mostly
|
2013-10-07 17:26:18 +08:00
|
|
|
|
2011-08-18 19:37:21 +08:00
|
|
|
#ifndef __attribute_const__
|
2013-10-07 17:26:18 +08:00
|
|
|
# define __attribute_const__
|
2011-08-18 19:37:21 +08:00
|
|
|
#endif
|
2009-10-17 23:12:33 +08:00
|
|
|
|
2012-09-11 06:15:03 +08:00
|
|
|
#ifndef __maybe_unused
|
2013-10-07 17:26:18 +08:00
|
|
|
# define __maybe_unused __attribute__((unused))
|
|
|
|
#endif
|
|
|
|
|
2017-05-31 08:38:09 +08:00
|
|
|
#ifndef __used
|
|
|
|
# define __used __attribute__((__unused__))
|
|
|
|
#endif
|
|
|
|
|
2013-10-07 17:26:18 +08:00
|
|
|
#ifndef __packed
|
|
|
|
# define __packed __attribute__((__packed__))
|
2012-09-11 06:15:03 +08:00
|
|
|
#endif
|
2010-03-26 06:58:59 +08:00
|
|
|
|
2012-09-11 06:14:59 +08:00
|
|
|
#ifndef __force
|
2013-10-07 17:26:18 +08:00
|
|
|
# define __force
|
2012-09-11 06:14:59 +08:00
|
|
|
#endif
|
|
|
|
|
2013-10-01 19:26:13 +08:00
|
|
|
#ifndef __weak
|
|
|
|
# define __weak __attribute__((weak))
|
|
|
|
#endif
|
|
|
|
|
2014-01-09 22:00:53 +08:00
|
|
|
#ifndef likely
|
|
|
|
# define likely(x) __builtin_expect(!!(x), 1)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef unlikely
|
|
|
|
# define unlikely(x) __builtin_expect(!!(x), 0)
|
|
|
|
#endif
|
|
|
|
|
2017-05-31 08:38:09 +08:00
|
|
|
#ifndef __init
|
|
|
|
# define __init
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef noinline
|
|
|
|
# define noinline
|
|
|
|
#endif
|
|
|
|
|
2015-07-06 01:12:42 +08:00
|
|
|
#include <linux/types.h>
|
|
|
|
|
2015-10-13 16:52:14 +08:00
|
|
|
/*
|
|
|
|
* Following functions are taken from kernel sources and
|
|
|
|
* break aliasing rules in their original form.
|
|
|
|
*
|
|
|
|
* While kernel is compiled with -fno-strict-aliasing,
|
|
|
|
* perf uses -Wstrict-aliasing=3 which makes build fail
|
|
|
|
* under gcc 4.4.
|
|
|
|
*
|
|
|
|
* Using extra __may_alias__ type to allow aliasing
|
|
|
|
* in this case.
|
|
|
|
*/
|
|
|
|
typedef __u8 __attribute__((__may_alias__)) __u8_alias_t;
|
|
|
|
typedef __u16 __attribute__((__may_alias__)) __u16_alias_t;
|
|
|
|
typedef __u32 __attribute__((__may_alias__)) __u32_alias_t;
|
|
|
|
typedef __u64 __attribute__((__may_alias__)) __u64_alias_t;
|
|
|
|
|
2015-07-06 01:12:42 +08:00
|
|
|
static __always_inline void __read_once_size(const volatile void *p, void *res, int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2015-10-13 16:52:14 +08:00
|
|
|
case 1: *(__u8_alias_t *) res = *(volatile __u8_alias_t *) p; break;
|
|
|
|
case 2: *(__u16_alias_t *) res = *(volatile __u16_alias_t *) p; break;
|
|
|
|
case 4: *(__u32_alias_t *) res = *(volatile __u32_alias_t *) p; break;
|
|
|
|
case 8: *(__u64_alias_t *) res = *(volatile __u64_alias_t *) p; break;
|
2015-07-06 01:12:42 +08:00
|
|
|
default:
|
|
|
|
barrier();
|
|
|
|
__builtin_memcpy((void *)res, (const void *)p, size);
|
|
|
|
barrier();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline void __write_once_size(volatile void *p, void *res, int size)
|
|
|
|
{
|
|
|
|
switch (size) {
|
2015-10-13 16:52:14 +08:00
|
|
|
case 1: *(volatile __u8_alias_t *) p = *(__u8_alias_t *) res; break;
|
|
|
|
case 2: *(volatile __u16_alias_t *) p = *(__u16_alias_t *) res; break;
|
|
|
|
case 4: *(volatile __u32_alias_t *) p = *(__u32_alias_t *) res; break;
|
|
|
|
case 8: *(volatile __u64_alias_t *) p = *(__u64_alias_t *) res; break;
|
2015-07-06 01:12:42 +08:00
|
|
|
default:
|
|
|
|
barrier();
|
|
|
|
__builtin_memcpy((void *)p, (const void *)res, size);
|
|
|
|
barrier();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Prevent the compiler from merging or refetching reads or writes. The
|
|
|
|
* compiler is also forbidden from reordering successive instances of
|
2017-11-27 18:38:22 +08:00
|
|
|
* READ_ONCE and WRITE_ONCE, but only when the compiler is aware of some
|
|
|
|
* particular ordering. One way to make the compiler aware of ordering is to
|
|
|
|
* put the two invocations of READ_ONCE or WRITE_ONCE in different C
|
|
|
|
* statements.
|
2015-07-06 01:12:42 +08:00
|
|
|
*
|
2017-11-27 18:38:22 +08:00
|
|
|
* These two macros will also work on aggregate data types like structs or
|
|
|
|
* unions. If the size of the accessed data type exceeds the word size of
|
|
|
|
* the machine (e.g., 32 bits or 64 bits) READ_ONCE() and WRITE_ONCE() will
|
|
|
|
* fall back to memcpy and print a compile-time warning.
|
2015-07-06 01:12:42 +08:00
|
|
|
*
|
|
|
|
* Their two major use cases are: (1) Mediating communication between
|
|
|
|
* process-level code and irq/NMI handlers, all running on the same CPU,
|
2017-11-27 18:38:22 +08:00
|
|
|
* and (2) Ensuring that the compiler does not fold, spindle, or otherwise
|
2015-07-06 01:12:42 +08:00
|
|
|
* mutilate accesses that either do not require ordering or that interact
|
|
|
|
* with an explicit memory barrier or atomic instruction that provides the
|
|
|
|
* required ordering.
|
|
|
|
*/
|
|
|
|
|
2018-04-05 00:34:45 +08:00
|
|
|
#define READ_ONCE(x) \
|
|
|
|
({ \
|
|
|
|
union { typeof(x) __val; char __c[1]; } __u = \
|
|
|
|
{ .__c = { 0 } }; \
|
|
|
|
__read_once_size(&(x), __u.__c, sizeof(x)); \
|
|
|
|
__u.__val; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define WRITE_ONCE(x, val) \
|
|
|
|
({ \
|
|
|
|
union { typeof(x) __val; char __c[1]; } __u = \
|
|
|
|
{ .__val = (val) }; \
|
|
|
|
__write_once_size(&(x), __u.__c, sizeof(x)); \
|
|
|
|
__u.__val; \
|
|
|
|
})
|
2015-07-06 01:12:42 +08:00
|
|
|
|
2017-02-09 04:01:46 +08:00
|
|
|
|
|
|
|
#ifndef __fallthrough
|
2017-02-10 22:41:11 +08:00
|
|
|
# define __fallthrough
|
2017-02-09 04:01:46 +08:00
|
|
|
#endif
|
|
|
|
|
2020-07-12 05:53:28 +08:00
|
|
|
/* Indirect macros required for expanded argument pasting, eg. __LINE__. */
|
|
|
|
#define ___PASTE(a, b) a##b
|
|
|
|
#define __PASTE(a, b) ___PASTE(a, b)
|
|
|
|
|
2014-01-09 22:00:52 +08:00
|
|
|
#endif /* _TOOLS_LINUX_COMPILER_H */
|