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 21:07:57 +07:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2015-12-01 10:36:38 +07:00
|
|
|
#ifndef _ASM_POWERPC_NOHASH_PGTABLE_H
|
|
|
|
|
#define _ASM_POWERPC_NOHASH_PGTABLE_H
|
2015-12-01 10:36:32 +07:00
|
|
|
|
|
|
|
|
#if defined(CONFIG_PPC64)
|
2015-12-01 10:36:38 +07:00
|
|
|
#include <asm/nohash/64/pgtable.h>
|
2015-12-01 10:36:32 +07:00
|
|
|
#else
|
2015-12-01 10:36:38 +07:00
|
|
|
#include <asm/nohash/32/pgtable.h>
|
2015-12-01 10:36:32 +07:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
|
|
|
|
|
/* Generic accessors to PTE bits */
|
|
|
|
|
static inline int pte_write(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return (pte_val(pte) & (_PAGE_RW | _PAGE_RO)) != _PAGE_RO;
|
|
|
|
|
}
|
powerpc/hugetlb: fix page rights verification in gup_hugepte()
gup_hugepte() checks if pages are present and readable, and
when 'write' is set, also checks if the pages are writable.
Initially this was done by checking if _PAGE_PRESENT and
_PAGE_READ were set. In addition, _PAGE_WRITE was verified for write
accesses.
The problem is that we have to handle the three following cases:
1/ The target defines __PAGE_READ and __PAGE_WRITE
2/ The target defines __PAGE_RW
3/ The target defines __PAGE_RO
In case 1/, this is obvious
In case 2/, __PAGE_READ is defined as 0 and __PAGE_WRITE as __PAGE_RW
so it works as well.
But in case 3, __PAGE_RW is defined as 0, which means __PAGE_WRITE is 0
and then the test returns true (page writable) in all cases.
A first correction was attempted in commit 6b8cb66a6a7cc ("powerpc: Fix
usage of _PAGE_RO in hugepage"), but that fix is wrong:
instead of checking that the page is writable when write is requested,
it checks that the page is NOT writable when write is NOT requested.
This patch adds a new pte_read() helper to check whether a page is
readable or not. This avoids handling all possible cases in
gup_hugepte().
Then gup_hugepte() is modified to use pte_present(), pte_read()
and pte_write() instead of the raw flags.
Signed-off-by: Christophe Leroy <christophe.leroy@c-s.fr>
Reviewed-by: Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2017-07-12 22:03:42 +07:00
|
|
|
static inline int pte_read(pte_t pte) { return 1; }
|
2015-12-01 10:36:32 +07:00
|
|
|
static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_DIRTY; }
|
|
|
|
|
static inline int pte_special(pte_t pte) { return pte_val(pte) & _PAGE_SPECIAL; }
|
|
|
|
|
static inline int pte_none(pte_t pte) { return (pte_val(pte) & ~_PTE_NONE_MASK) == 0; }
|
|
|
|
|
static inline pgprot_t pte_pgprot(pte_t pte) { return __pgprot(pte_val(pte) & PAGE_PROT_BITS); }
|
|
|
|
|
|
|
|
|
|
#ifdef CONFIG_NUMA_BALANCING
|
|
|
|
|
/*
|
|
|
|
|
* These work without NUMA balancing but the kernel does not care. See the
|
|
|
|
|
* comment in include/asm-generic/pgtable.h . On powerpc, this will only
|
|
|
|
|
* work for user pages and always return true for kernel pages.
|
|
|
|
|
*/
|
|
|
|
|
static inline int pte_protnone(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return (pte_val(pte) &
|
|
|
|
|
(_PAGE_PRESENT | _PAGE_USER)) == _PAGE_PRESENT;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline int pmd_protnone(pmd_t pmd)
|
|
|
|
|
{
|
|
|
|
|
return pte_protnone(pmd_pte(pmd));
|
|
|
|
|
}
|
|
|
|
|
#endif /* CONFIG_NUMA_BALANCING */
|
|
|
|
|
|
|
|
|
|
static inline int pte_present(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return pte_val(pte) & _PAGE_PRESENT;
|
|
|
|
|
}
|
|
|
|
|
|
2017-12-04 09:19:12 +07:00
|
|
|
/*
|
|
|
|
|
* We only find page table entry in the last level
|
|
|
|
|
* Hence no need for other accessors
|
|
|
|
|
*/
|
|
|
|
|
#define pte_access_permitted pte_access_permitted
|
|
|
|
|
static inline bool pte_access_permitted(pte_t pte, bool write)
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* A read-only access is controlled by _PAGE_USER bit.
|
|
|
|
|
* We have _PAGE_READ set for WRITE and EXECUTE
|
|
|
|
|
*/
|
2018-08-21 20:03:23 +07:00
|
|
|
if (!pte_present(pte) || !pte_user(pte) || !pte_read(pte))
|
|
|
|
|
return false;
|
2017-12-04 09:19:12 +07:00
|
|
|
|
2018-08-21 20:03:23 +07:00
|
|
|
if (write && !pte_write(pte))
|
2017-12-04 09:19:12 +07:00
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2015-12-01 10:36:32 +07:00
|
|
|
/* Conversion functions: convert a page and protection to a page entry,
|
|
|
|
|
* and a page entry and page directory to the page they refer to.
|
|
|
|
|
*
|
|
|
|
|
* Even if PTEs can be unsigned long long, a PFN is always an unsigned
|
|
|
|
|
* long for now.
|
|
|
|
|
*/
|
|
|
|
|
static inline pte_t pfn_pte(unsigned long pfn, pgprot_t pgprot) {
|
|
|
|
|
return __pte(((pte_basic_t)(pfn) << PTE_RPN_SHIFT) |
|
|
|
|
|
pgprot_val(pgprot)); }
|
|
|
|
|
static inline unsigned long pte_pfn(pte_t pte) {
|
|
|
|
|
return pte_val(pte) >> PTE_RPN_SHIFT; }
|
|
|
|
|
|
|
|
|
|
/* Generic modifiers for PTE bits */
|
2015-12-01 10:36:34 +07:00
|
|
|
static inline pte_t pte_wrprotect(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
pte_basic_t ptev;
|
|
|
|
|
|
|
|
|
|
ptev = pte_val(pte) & ~(_PAGE_RW | _PAGE_HWWRITE);
|
|
|
|
|
ptev |= _PAGE_RO;
|
|
|
|
|
return __pte(ptev);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkclean(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return __pte(pte_val(pte) & ~(_PAGE_DIRTY | _PAGE_HWWRITE));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkold(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return __pte(pte_val(pte) & ~_PAGE_ACCESSED);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkwrite(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
pte_basic_t ptev;
|
|
|
|
|
|
|
|
|
|
ptev = pte_val(pte) & ~_PAGE_RO;
|
|
|
|
|
ptev |= _PAGE_RW;
|
|
|
|
|
return __pte(ptev);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkdirty(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return __pte(pte_val(pte) | _PAGE_DIRTY);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkyoung(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return __pte(pte_val(pte) | _PAGE_ACCESSED);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkspecial(pte_t pte)
|
|
|
|
|
{
|
|
|
|
|
return __pte(pte_val(pte) | _PAGE_SPECIAL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pte_t pte_mkhuge(pte_t pte)
|
2015-12-01 10:36:32 +07:00
|
|
|
{
|
2018-01-12 19:45:31 +07:00
|
|
|
return __pte(pte_val(pte) | _PAGE_HUGE);
|
2015-12-01 10:36:32 +07:00
|
|
|
}
|
|
|
|
|
|
2015-12-01 10:36:34 +07:00
|
|
|
static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
|
|
|
|
|
{
|
|
|
|
|
return __pte((pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot));
|
|
|
|
|
}
|
2015-12-01 10:36:32 +07:00
|
|
|
|
|
|
|
|
/* Insert a PTE, top-level function is out of line. It uses an inline
|
|
|
|
|
* low level function in the respective pgtable-* files
|
|
|
|
|
*/
|
|
|
|
|
extern void set_pte_at(struct mm_struct *mm, unsigned long addr, pte_t *ptep,
|
|
|
|
|
pte_t pte);
|
|
|
|
|
|
|
|
|
|
/* This low level function performs the actual PTE insertion
|
|
|
|
|
* Setting the PTE depends on the MMU type and other factors. It's
|
|
|
|
|
* an horrible mess that I'm not going to try to clean up now but
|
|
|
|
|
* I'm keeping it in one place rather than spread around
|
|
|
|
|
*/
|
|
|
|
|
static inline void __set_pte_at(struct mm_struct *mm, unsigned long addr,
|
|
|
|
|
pte_t *ptep, pte_t pte, int percpu)
|
|
|
|
|
{
|
|
|
|
|
/* Second case is 32-bit with 64-bit PTE. In this case, we
|
|
|
|
|
* can just store as long as we do the two halves in the right order
|
2018-04-24 23:31:28 +07:00
|
|
|
* with a barrier in between.
|
|
|
|
|
* In the percpu case, we also fallback to the simple update
|
2015-12-01 10:36:32 +07:00
|
|
|
*/
|
2018-04-24 23:31:32 +07:00
|
|
|
if (IS_ENABLED(CONFIG_PPC32) && IS_ENABLED(CONFIG_PTE_64BIT) && !percpu) {
|
|
|
|
|
__asm__ __volatile__("\
|
|
|
|
|
stw%U0%X0 %2,%0\n\
|
|
|
|
|
eieio\n\
|
|
|
|
|
stw%U0%X0 %L2,%1"
|
|
|
|
|
: "=m" (*ptep), "=m" (*((unsigned char *)ptep+4))
|
|
|
|
|
: "r" (pte) : "memory");
|
2015-12-01 10:36:32 +07:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
/* Anything else just stores the PTE normally. That covers all 64-bit
|
|
|
|
|
* cases, and 32-bit non-hash with 32-bit PTEs.
|
|
|
|
|
*/
|
|
|
|
|
*ptep = pte;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* With hardware tablewalk, a sync is needed to ensure that
|
|
|
|
|
* subsequent accesses see the PTE we just wrote. Unlike userspace
|
|
|
|
|
* mappings, we can't tolerate spurious faults, so make sure
|
|
|
|
|
* the new PTE will be seen the first time.
|
|
|
|
|
*/
|
2018-04-24 23:31:32 +07:00
|
|
|
if (IS_ENABLED(CONFIG_PPC_BOOK3E_64) && is_kernel_addr(addr))
|
2015-12-01 10:36:32 +07:00
|
|
|
mb();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
|
|
|
|
|
extern int ptep_set_access_flags(struct vm_area_struct *vma, unsigned long address,
|
|
|
|
|
pte_t *ptep, pte_t entry, int dirty);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Macro to mark a page protection value as "uncacheable".
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define _PAGE_CACHE_CTL (_PAGE_COHERENT | _PAGE_GUARDED | _PAGE_NO_CACHE | \
|
|
|
|
|
_PAGE_WRITETHRU)
|
|
|
|
|
|
|
|
|
|
#define pgprot_noncached(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
|
|
|
|
|
_PAGE_NO_CACHE | _PAGE_GUARDED))
|
|
|
|
|
|
|
|
|
|
#define pgprot_noncached_wc(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
|
|
|
|
|
_PAGE_NO_CACHE))
|
|
|
|
|
|
|
|
|
|
#define pgprot_cached(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
|
|
|
|
|
_PAGE_COHERENT))
|
|
|
|
|
|
2018-01-12 19:45:25 +07:00
|
|
|
#if _PAGE_WRITETHRU != 0
|
2015-12-01 10:36:32 +07:00
|
|
|
#define pgprot_cached_wthru(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
|
|
|
|
|
_PAGE_COHERENT | _PAGE_WRITETHRU))
|
2018-10-09 20:51:43 +07:00
|
|
|
#else
|
|
|
|
|
#define pgprot_cached_wthru(prot) pgprot_noncached(prot)
|
2018-01-12 19:45:25 +07:00
|
|
|
#endif
|
2015-12-01 10:36:32 +07:00
|
|
|
|
|
|
|
|
#define pgprot_cached_noncoherent(prot) \
|
|
|
|
|
(__pgprot(pgprot_val(prot) & ~_PAGE_CACHE_CTL))
|
|
|
|
|
|
|
|
|
|
#define pgprot_writecombine pgprot_noncached_wc
|
|
|
|
|
|
|
|
|
|
struct file;
|
|
|
|
|
extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
|
|
|
|
|
unsigned long size, pgprot_t vma_prot);
|
|
|
|
|
#define __HAVE_PHYS_MEM_ACCESS_PROT
|
|
|
|
|
|
2015-12-01 10:36:52 +07:00
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
|
static inline int hugepd_ok(hugepd_t hpd)
|
|
|
|
|
{
|
2016-12-07 14:47:28 +07:00
|
|
|
#ifdef CONFIG_PPC_8xx
|
2016-12-14 11:37:53 +07:00
|
|
|
return ((hpd_val(hpd) & 0x4) != 0);
|
2016-12-07 14:47:28 +07:00
|
|
|
#else
|
2016-12-14 11:37:53 +07:00
|
|
|
/* We clear the top bit to indicate hugepd */
|
2017-02-16 22:11:29 +07:00
|
|
|
return (hpd_val(hpd) && (hpd_val(hpd) & PD_HUGE) == 0);
|
2016-12-07 14:47:28 +07:00
|
|
|
#endif
|
2015-12-01 10:36:52 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline int pmd_huge(pmd_t pmd)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline int pud_huge(pud_t pud)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline int pgd_huge(pgd_t pgd)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
#define pgd_huge pgd_huge
|
|
|
|
|
|
|
|
|
|
#define is_hugepd(hpd) (hugepd_ok(hpd))
|
|
|
|
|
#endif
|
|
|
|
|
|
2015-12-01 10:36:32 +07:00
|
|
|
#endif /* __ASSEMBLY__ */
|
|
|
|
|
#endif
|