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 17:07:57 +03:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2008-02-07 13:50:52 +03:00
|
|
|
#ifndef __ASM_SH_UACCESS_H
|
|
|
|
#define __ASM_SH_UACCESS_H
|
|
|
|
|
2008-06-03 15:05:39 +04:00
|
|
|
#include <asm/segment.h>
|
2016-12-25 22:49:42 +03:00
|
|
|
#include <asm/extable.h>
|
2008-06-03 15:05:39 +04:00
|
|
|
|
|
|
|
#define __addr_ok(addr) \
|
|
|
|
((unsigned long __force)(addr) < current_thread_info()->addr_limit.seg)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* __access_ok: Check if address with size is OK or not.
|
|
|
|
*
|
|
|
|
* Uhhuh, this needs 33-bit arithmetic. We have a carry..
|
|
|
|
*
|
|
|
|
* sum := addr + size; carry? --> flag = true;
|
|
|
|
* if (sum >= addr_limit) flag = true;
|
|
|
|
*/
|
|
|
|
#define __access_ok(addr, size) \
|
|
|
|
(__addr_ok((addr) + (size)))
|
|
|
|
#define access_ok(type, addr, size) \
|
|
|
|
(__chk_user_ptr(addr), \
|
|
|
|
__access_ok((unsigned long __force)(addr), (size)))
|
|
|
|
|
2012-05-25 08:02:48 +04:00
|
|
|
#define user_addr_max() (current_thread_info()->addr_limit.seg)
|
|
|
|
|
2008-06-03 15:05:39 +04:00
|
|
|
/*
|
|
|
|
* Uh, these should become the main single-value transfer routines ...
|
|
|
|
* They automatically use the right size if we just have the right
|
|
|
|
* pointer type ...
|
|
|
|
*
|
|
|
|
* As SuperH uses the same address space for kernel and user data, we
|
|
|
|
* can just do these as direct assignments.
|
|
|
|
*
|
|
|
|
* Careful to not
|
|
|
|
* (a) re-use the arguments for side effects (sizeof is ok)
|
|
|
|
* (b) require any knowledge of processes at this stage
|
|
|
|
*/
|
|
|
|
#define put_user(x,ptr) __put_user_check((x), (ptr), sizeof(*(ptr)))
|
|
|
|
#define get_user(x,ptr) __get_user_check((x), (ptr), sizeof(*(ptr)))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The "__xxx" versions do not do address space checking, useful when
|
|
|
|
* doing multiple accesses to the same area (the user has to do the
|
|
|
|
* checks by hand with "access_ok()")
|
|
|
|
*/
|
|
|
|
#define __put_user(x,ptr) __put_user_nocheck((x), (ptr), sizeof(*(ptr)))
|
|
|
|
#define __get_user(x,ptr) __get_user_nocheck((x), (ptr), sizeof(*(ptr)))
|
|
|
|
|
|
|
|
struct __large_struct { unsigned long buf[100]; };
|
|
|
|
#define __m(x) (*(struct __large_struct __user *)(x))
|
|
|
|
|
|
|
|
#define __get_user_nocheck(x,ptr,size) \
|
|
|
|
({ \
|
|
|
|
long __gu_err; \
|
|
|
|
unsigned long __gu_val; \
|
|
|
|
const __typeof__(*(ptr)) __user *__gu_addr = (ptr); \
|
|
|
|
__chk_user_ptr(ptr); \
|
|
|
|
__get_user_size(__gu_val, __gu_addr, (size), __gu_err); \
|
2014-12-12 02:56:04 +03:00
|
|
|
(x) = (__force __typeof__(*(ptr)))__gu_val; \
|
2008-06-03 15:05:39 +04:00
|
|
|
__gu_err; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define __get_user_check(x,ptr,size) \
|
|
|
|
({ \
|
|
|
|
long __gu_err = -EFAULT; \
|
|
|
|
unsigned long __gu_val = 0; \
|
|
|
|
const __typeof__(*(ptr)) *__gu_addr = (ptr); \
|
|
|
|
if (likely(access_ok(VERIFY_READ, __gu_addr, (size)))) \
|
|
|
|
__get_user_size(__gu_val, __gu_addr, (size), __gu_err); \
|
2014-12-12 02:56:04 +03:00
|
|
|
(x) = (__force __typeof__(*(ptr)))__gu_val; \
|
2008-06-03 15:05:39 +04:00
|
|
|
__gu_err; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define __put_user_nocheck(x,ptr,size) \
|
|
|
|
({ \
|
|
|
|
long __pu_err; \
|
|
|
|
__typeof__(*(ptr)) __user *__pu_addr = (ptr); \
|
2008-07-29 04:16:33 +04:00
|
|
|
__typeof__(*(ptr)) __pu_val = x; \
|
2008-06-03 15:05:39 +04:00
|
|
|
__chk_user_ptr(ptr); \
|
2008-07-29 04:16:33 +04:00
|
|
|
__put_user_size(__pu_val, __pu_addr, (size), __pu_err); \
|
2008-06-03 15:05:39 +04:00
|
|
|
__pu_err; \
|
|
|
|
})
|
|
|
|
|
|
|
|
#define __put_user_check(x,ptr,size) \
|
|
|
|
({ \
|
|
|
|
long __pu_err = -EFAULT; \
|
|
|
|
__typeof__(*(ptr)) __user *__pu_addr = (ptr); \
|
2008-07-29 04:16:33 +04:00
|
|
|
__typeof__(*(ptr)) __pu_val = x; \
|
2008-06-03 15:05:39 +04:00
|
|
|
if (likely(access_ok(VERIFY_WRITE, __pu_addr, size))) \
|
2008-07-29 04:16:33 +04:00
|
|
|
__put_user_size(__pu_val, __pu_addr, (size), \
|
2008-06-03 15:05:39 +04:00
|
|
|
__pu_err); \
|
|
|
|
__pu_err; \
|
|
|
|
})
|
|
|
|
|
2007-11-10 13:55:50 +03:00
|
|
|
#ifdef CONFIG_SUPERH32
|
2012-10-02 21:01:25 +04:00
|
|
|
# include <asm/uaccess_32.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#else
|
2012-10-02 21:01:25 +04:00
|
|
|
# include <asm/uaccess_64.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
2008-02-07 13:50:52 +03:00
|
|
|
|
2012-05-25 08:02:48 +04:00
|
|
|
extern long strncpy_from_user(char *dest, const char __user *src, long count);
|
|
|
|
|
2012-06-04 10:46:05 +04:00
|
|
|
extern __must_check long strnlen_user(const char __user *str, long n);
|
|
|
|
|
2008-06-03 15:05:39 +04:00
|
|
|
/* Generic arbitrary sized copy. */
|
|
|
|
/* Return the number of bytes NOT copied */
|
|
|
|
__kernel_size_t __copy_user(void *to, const void *from, __kernel_size_t n);
|
|
|
|
|
|
|
|
static __always_inline unsigned long
|
2017-03-21 21:43:13 +03:00
|
|
|
raw_copy_from_user(void *to, const void __user *from, unsigned long n)
|
2008-06-03 15:05:39 +04:00
|
|
|
{
|
|
|
|
return __copy_user(to, (__force void *)from, n);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __always_inline unsigned long __must_check
|
2017-03-21 21:43:13 +03:00
|
|
|
raw_copy_to_user(void __user *to, const void *from, unsigned long n)
|
2008-06-03 15:05:39 +04:00
|
|
|
{
|
|
|
|
return __copy_user((__force void *)to, from, n);
|
|
|
|
}
|
2017-03-21 21:43:13 +03:00
|
|
|
#define INLINE_COPY_FROM_USER
|
|
|
|
#define INLINE_COPY_TO_USER
|
2008-06-03 15:05:39 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear the area and return remaining number of bytes
|
|
|
|
* (on failure. Usually it's 0.)
|
|
|
|
*/
|
|
|
|
__kernel_size_t __clear_user(void *addr, __kernel_size_t size);
|
|
|
|
|
|
|
|
#define clear_user(addr,n) \
|
|
|
|
({ \
|
|
|
|
void __user * __cl_addr = (addr); \
|
|
|
|
unsigned long __cl_size = (n); \
|
|
|
|
\
|
|
|
|
if (__cl_size && access_ok(VERIFY_WRITE, \
|
|
|
|
((unsigned long)(__cl_addr)), __cl_size)) \
|
|
|
|
__cl_size = __clear_user(__cl_addr, __cl_size); \
|
|
|
|
\
|
|
|
|
__cl_size; \
|
|
|
|
})
|
|
|
|
|
2012-03-28 21:30:03 +04:00
|
|
|
extern void *set_exception_table_vec(unsigned int vec, void *handler);
|
|
|
|
|
|
|
|
static inline void *set_exception_table_evt(unsigned int evt, void *handler)
|
|
|
|
{
|
|
|
|
return set_exception_table_vec(evt >> 5, handler);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mem_access {
|
|
|
|
unsigned long (*from)(void *dst, const void __user *src, unsigned long cnt);
|
|
|
|
unsigned long (*to)(void __user *dst, const void *src, unsigned long cnt);
|
|
|
|
};
|
|
|
|
|
|
|
|
int handle_unaligned_access(insn_size_t instruction, struct pt_regs *regs,
|
|
|
|
struct mem_access *ma, int, unsigned long address);
|
2008-06-03 15:05:39 +04:00
|
|
|
|
2008-02-07 13:50:52 +03:00
|
|
|
#endif /* __ASM_SH_UACCESS_H */
|