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
|
2017-03-13 23:33:37 +07:00
|
|
|
#define DISABLE_BRANCH_PROFILING
|
2015-07-02 16:09:37 +07:00
|
|
|
#define pr_fmt(fmt) "kasan: " fmt
|
x86/mm: Optimize boot-time paging mode switching cost
By this point we have functioning boot-time switching between 4- and
5-level paging mode. But naive approach comes with cost.
Numbers below are for kernel build, allmodconfig, 5 times.
CONFIG_X86_5LEVEL=n:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17308719.892691 task-clock:u (msec) # 26.772 CPUs utilized ( +- 0.11% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,993,164 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,614,978,867,455 cycles:u # 2.520 GHz ( +- 0.01% )
39,371,534,575,126 stalled-cycles-frontend:u # 90.27% frontend cycles idle ( +- 0.09% )
28,363,350,152,428 instructions:u # 0.65 insn per cycle
# 1.39 stalled cycles per insn ( +- 0.00% )
6,316,784,066,413 branches:u # 364.948 M/sec ( +- 0.00% )
250,808,144,781 branch-misses:u # 3.97% of all branches ( +- 0.01% )
646.531974142 seconds time elapsed ( +- 1.15% )
CONFIG_X86_5LEVEL=y:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17411536.780625 task-clock:u (msec) # 26.426 CPUs utilized ( +- 0.10% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,868,663 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,865,909,056,301 cycles:u # 2.519 GHz ( +- 0.01% )
39,740,130,365,581 stalled-cycles-frontend:u # 90.59% frontend cycles idle ( +- 0.05% )
28,363,358,997,959 instructions:u # 0.65 insn per cycle
# 1.40 stalled cycles per insn ( +- 0.00% )
6,316,784,937,460 branches:u # 362.793 M/sec ( +- 0.00% )
251,531,919,485 branch-misses:u # 3.98% of all branches ( +- 0.00% )
658.886307752 seconds time elapsed ( +- 0.92% )
The patch tries to fix the performance regression by using
cpu_feature_enabled(X86_FEATURE_LA57) instead of pgtable_l5_enabled in
all hot code paths. These will statically patch the target code for
additional performance.
CONFIG_X86_5LEVEL=y + the patch:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17381990.268506 task-clock:u (msec) # 26.907 CPUs utilized ( +- 0.19% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,862,625 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,697,726,320,051 cycles:u # 2.514 GHz ( +- 0.03% )
39,480,408,690,401 stalled-cycles-frontend:u # 90.35% frontend cycles idle ( +- 0.05% )
28,363,394,221,388 instructions:u # 0.65 insn per cycle
# 1.39 stalled cycles per insn ( +- 0.00% )
6,316,794,985,573 branches:u # 363.410 M/sec ( +- 0.00% )
251,013,232,547 branch-misses:u # 3.97% of all branches ( +- 0.01% )
645.991174661 seconds time elapsed ( +- 1.19% )
Unfortunately, this approach doesn't help with text size:
vmlinux.before .text size: 8190319
vmlinux.after .text size: 8200623
The .text section is increased by about 4k. Not sure if we can do anything
about this.
Signed-off-by: Kirill A. Shuemov <kirill.shutemov@linux.intel.com>
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Andy Lutomirski <luto@kernel.org>
Cc: Arjan van de Ven <arjan@linux.intel.com>
Cc: Borislav Petkov <bp@alien8.de>
Cc: Borislav Petkov <bp@suse.de>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Dave Hansen <dave.hansen@linux.intel.com>
Cc: David Woodhouse <dwmw2@infradead.org>
Cc: Josh Poimboeuf <jpoimboe@redhat.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: linux-mm@kvack.org
Link: http://lkml.kernel.org/r/20180216114948.68868-4-kirill.shutemov@linux.intel.com
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2018-02-16 18:49:48 +07:00
|
|
|
|
2018-05-18 17:35:23 +07:00
|
|
|
/* cpu_feature_enabled() cannot be used this early */
|
|
|
|
#define USE_EARLY_PGTABLE_L5
|
x86/mm: Optimize boot-time paging mode switching cost
By this point we have functioning boot-time switching between 4- and
5-level paging mode. But naive approach comes with cost.
Numbers below are for kernel build, allmodconfig, 5 times.
CONFIG_X86_5LEVEL=n:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17308719.892691 task-clock:u (msec) # 26.772 CPUs utilized ( +- 0.11% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,993,164 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,614,978,867,455 cycles:u # 2.520 GHz ( +- 0.01% )
39,371,534,575,126 stalled-cycles-frontend:u # 90.27% frontend cycles idle ( +- 0.09% )
28,363,350,152,428 instructions:u # 0.65 insn per cycle
# 1.39 stalled cycles per insn ( +- 0.00% )
6,316,784,066,413 branches:u # 364.948 M/sec ( +- 0.00% )
250,808,144,781 branch-misses:u # 3.97% of all branches ( +- 0.01% )
646.531974142 seconds time elapsed ( +- 1.15% )
CONFIG_X86_5LEVEL=y:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17411536.780625 task-clock:u (msec) # 26.426 CPUs utilized ( +- 0.10% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,868,663 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,865,909,056,301 cycles:u # 2.519 GHz ( +- 0.01% )
39,740,130,365,581 stalled-cycles-frontend:u # 90.59% frontend cycles idle ( +- 0.05% )
28,363,358,997,959 instructions:u # 0.65 insn per cycle
# 1.40 stalled cycles per insn ( +- 0.00% )
6,316,784,937,460 branches:u # 362.793 M/sec ( +- 0.00% )
251,531,919,485 branch-misses:u # 3.98% of all branches ( +- 0.00% )
658.886307752 seconds time elapsed ( +- 0.92% )
The patch tries to fix the performance regression by using
cpu_feature_enabled(X86_FEATURE_LA57) instead of pgtable_l5_enabled in
all hot code paths. These will statically patch the target code for
additional performance.
CONFIG_X86_5LEVEL=y + the patch:
Performance counter stats for 'sh -c make -j100 -B -k >/dev/null' (5 runs):
17381990.268506 task-clock:u (msec) # 26.907 CPUs utilized ( +- 0.19% )
0 context-switches:u # 0.000 K/sec
0 cpu-migrations:u # 0.000 K/sec
331,862,625 page-faults:u # 0.019 M/sec ( +- 0.01% )
43,697,726,320,051 cycles:u # 2.514 GHz ( +- 0.03% )
39,480,408,690,401 stalled-cycles-frontend:u # 90.35% frontend cycles idle ( +- 0.05% )
28,363,394,221,388 instructions:u # 0.65 insn per cycle
# 1.39 stalled cycles per insn ( +- 0.00% )
6,316,794,985,573 branches:u # 363.410 M/sec ( +- 0.00% )
251,013,232,547 branch-misses:u # 3.97% of all branches ( +- 0.01% )
645.991174661 seconds time elapsed ( +- 1.19% )
Unfortunately, this approach doesn't help with text size:
vmlinux.before .text size: 8190319
vmlinux.after .text size: 8200623
The .text section is increased by about 4k. Not sure if we can do anything
about this.
Signed-off-by: Kirill A. Shuemov <kirill.shutemov@linux.intel.com>
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Andy Lutomirski <luto@kernel.org>
Cc: Arjan van de Ven <arjan@linux.intel.com>
Cc: Borislav Petkov <bp@alien8.de>
Cc: Borislav Petkov <bp@suse.de>
Cc: Dan Williams <dan.j.williams@intel.com>
Cc: Dave Hansen <dave.hansen@linux.intel.com>
Cc: David Woodhouse <dwmw2@infradead.org>
Cc: Josh Poimboeuf <jpoimboe@redhat.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: linux-mm@kvack.org
Link: http://lkml.kernel.org/r/20180216114948.68868-4-kirill.shutemov@linux.intel.com
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2018-02-16 18:49:48 +07:00
|
|
|
|
2018-10-31 05:09:49 +07:00
|
|
|
#include <linux/memblock.h>
|
2015-02-14 05:39:25 +07:00
|
|
|
#include <linux/kasan.h>
|
|
|
|
#include <linux/kdebug.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/sched.h>
|
2017-02-04 07:20:53 +07:00
|
|
|
#include <linux/sched/task.h>
|
2015-02-14 05:39:25 +07:00
|
|
|
#include <linux/vmalloc.h>
|
|
|
|
|
2017-01-27 17:59:46 +07:00
|
|
|
#include <asm/e820/types.h>
|
2017-11-16 08:36:35 +07:00
|
|
|
#include <asm/pgalloc.h>
|
2015-02-14 05:39:25 +07:00
|
|
|
#include <asm/tlbflush.h>
|
|
|
|
#include <asm/sections.h>
|
2017-07-18 04:10:11 +07:00
|
|
|
#include <asm/pgtable.h>
|
2017-12-21 00:51:31 +07:00
|
|
|
#include <asm/cpu_entry_area.h>
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2017-01-28 23:29:08 +07:00
|
|
|
extern struct range pfn_mapped[E820_MAX_ENTRIES];
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2018-02-14 18:16:53 +07:00
|
|
|
static p4d_t tmp_p4d_table[MAX_PTRS_PER_P4D] __initdata __aligned(PAGE_SIZE);
|
2017-09-29 21:08:18 +07:00
|
|
|
|
2018-01-10 22:36:02 +07:00
|
|
|
static __init void *early_alloc(size_t size, int nid, bool panic)
|
2017-11-16 08:36:35 +07:00
|
|
|
{
|
2018-01-10 22:36:02 +07:00
|
|
|
if (panic)
|
2018-10-31 05:08:04 +07:00
|
|
|
return memblock_alloc_try_nid(size, size,
|
2018-10-31 05:09:44 +07:00
|
|
|
__pa(MAX_DMA_ADDRESS), MEMBLOCK_ALLOC_ACCESSIBLE, nid);
|
2018-01-10 22:36:02 +07:00
|
|
|
else
|
2018-10-31 05:08:04 +07:00
|
|
|
return memblock_alloc_try_nid_nopanic(size, size,
|
2018-10-31 05:09:44 +07:00
|
|
|
__pa(MAX_DMA_ADDRESS), MEMBLOCK_ALLOC_ACCESSIBLE, nid);
|
2017-11-16 08:36:35 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_populate_pmd(pmd_t *pmd, unsigned long addr,
|
|
|
|
unsigned long end, int nid)
|
|
|
|
{
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
if (pmd_none(*pmd)) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
if (boot_cpu_has(X86_FEATURE_PSE) &&
|
|
|
|
((end - addr) == PMD_SIZE) &&
|
|
|
|
IS_ALIGNED(addr, PMD_SIZE)) {
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PMD_SIZE, nid, false);
|
2017-11-16 08:36:35 +07:00
|
|
|
if (p && pmd_set_huge(pmd, __pa(p), PAGE_KERNEL))
|
|
|
|
return;
|
|
|
|
else if (p)
|
|
|
|
memblock_free(__pa(p), PMD_SIZE);
|
|
|
|
}
|
|
|
|
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PAGE_SIZE, nid, true);
|
2017-11-16 08:36:35 +07:00
|
|
|
pmd_populate_kernel(&init_mm, pmd, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
pte = pte_offset_kernel(pmd, addr);
|
|
|
|
do {
|
|
|
|
pte_t entry;
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
if (!pte_none(*pte))
|
|
|
|
continue;
|
|
|
|
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PAGE_SIZE, nid, true);
|
2017-11-16 08:36:35 +07:00
|
|
|
entry = pfn_pte(PFN_DOWN(__pa(p)), PAGE_KERNEL);
|
|
|
|
set_pte_at(&init_mm, addr, pte, entry);
|
|
|
|
} while (pte++, addr += PAGE_SIZE, addr != end);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_populate_pud(pud_t *pud, unsigned long addr,
|
|
|
|
unsigned long end, int nid)
|
|
|
|
{
|
|
|
|
pmd_t *pmd;
|
|
|
|
unsigned long next;
|
|
|
|
|
|
|
|
if (pud_none(*pud)) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
if (boot_cpu_has(X86_FEATURE_GBPAGES) &&
|
|
|
|
((end - addr) == PUD_SIZE) &&
|
|
|
|
IS_ALIGNED(addr, PUD_SIZE)) {
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PUD_SIZE, nid, false);
|
2017-11-16 08:36:35 +07:00
|
|
|
if (p && pud_set_huge(pud, __pa(p), PAGE_KERNEL))
|
|
|
|
return;
|
|
|
|
else if (p)
|
|
|
|
memblock_free(__pa(p), PUD_SIZE);
|
|
|
|
}
|
|
|
|
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PAGE_SIZE, nid, true);
|
2017-11-16 08:36:35 +07:00
|
|
|
pud_populate(&init_mm, pud, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
pmd = pmd_offset(pud, addr);
|
|
|
|
do {
|
|
|
|
next = pmd_addr_end(addr, end);
|
|
|
|
if (!pmd_large(*pmd))
|
|
|
|
kasan_populate_pmd(pmd, addr, next, nid);
|
|
|
|
} while (pmd++, addr = next, addr != end);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_populate_p4d(p4d_t *p4d, unsigned long addr,
|
|
|
|
unsigned long end, int nid)
|
|
|
|
{
|
|
|
|
pud_t *pud;
|
|
|
|
unsigned long next;
|
|
|
|
|
|
|
|
if (p4d_none(*p4d)) {
|
2018-01-10 22:36:02 +07:00
|
|
|
void *p = early_alloc(PAGE_SIZE, nid, true);
|
2017-11-16 08:36:35 +07:00
|
|
|
|
|
|
|
p4d_populate(&init_mm, p4d, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
pud = pud_offset(p4d, addr);
|
|
|
|
do {
|
|
|
|
next = pud_addr_end(addr, end);
|
|
|
|
if (!pud_large(*pud))
|
|
|
|
kasan_populate_pud(pud, addr, next, nid);
|
|
|
|
} while (pud++, addr = next, addr != end);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_populate_pgd(pgd_t *pgd, unsigned long addr,
|
|
|
|
unsigned long end, int nid)
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
p4d_t *p4d;
|
|
|
|
unsigned long next;
|
|
|
|
|
|
|
|
if (pgd_none(*pgd)) {
|
2018-01-10 22:36:02 +07:00
|
|
|
p = early_alloc(PAGE_SIZE, nid, true);
|
2017-11-16 08:36:35 +07:00
|
|
|
pgd_populate(&init_mm, pgd, p);
|
|
|
|
}
|
|
|
|
|
|
|
|
p4d = p4d_offset(pgd, addr);
|
|
|
|
do {
|
|
|
|
next = p4d_addr_end(addr, end);
|
|
|
|
kasan_populate_p4d(p4d, addr, next, nid);
|
|
|
|
} while (p4d++, addr = next, addr != end);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_populate_shadow(unsigned long addr, unsigned long end,
|
|
|
|
int nid)
|
|
|
|
{
|
|
|
|
pgd_t *pgd;
|
|
|
|
unsigned long next;
|
|
|
|
|
|
|
|
addr = addr & PAGE_MASK;
|
|
|
|
end = round_up(end, PAGE_SIZE);
|
|
|
|
pgd = pgd_offset_k(addr);
|
|
|
|
do {
|
|
|
|
next = pgd_addr_end(addr, end);
|
|
|
|
kasan_populate_pgd(pgd, addr, next, nid);
|
|
|
|
} while (pgd++, addr = next, addr != end);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init map_range(struct range *range)
|
2015-02-14 05:39:25 +07:00
|
|
|
{
|
|
|
|
unsigned long start;
|
|
|
|
unsigned long end;
|
|
|
|
|
|
|
|
start = (unsigned long)kasan_mem_to_shadow(pfn_to_kaddr(range->start));
|
|
|
|
end = (unsigned long)kasan_mem_to_shadow(pfn_to_kaddr(range->end));
|
|
|
|
|
2017-11-16 08:36:35 +07:00
|
|
|
kasan_populate_shadow(start, end, early_pfn_to_nid(range->start));
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static void __init clear_pgds(unsigned long start,
|
|
|
|
unsigned long end)
|
|
|
|
{
|
2017-03-18 01:55:13 +07:00
|
|
|
pgd_t *pgd;
|
2017-09-29 21:08:18 +07:00
|
|
|
/* See comment in kasan_init() */
|
|
|
|
unsigned long pgd_end = end & PGDIR_MASK;
|
2017-03-18 01:55:13 +07:00
|
|
|
|
2017-09-29 21:08:18 +07:00
|
|
|
for (; start < pgd_end; start += PGDIR_SIZE) {
|
2017-03-18 01:55:13 +07:00
|
|
|
pgd = pgd_offset_k(start);
|
|
|
|
/*
|
|
|
|
* With folded p4d, pgd_clear() is nop, use p4d_clear()
|
|
|
|
* instead.
|
|
|
|
*/
|
2018-05-18 17:35:24 +07:00
|
|
|
if (pgtable_l5_enabled())
|
2017-03-18 01:55:13 +07:00
|
|
|
pgd_clear(pgd);
|
2018-02-15 01:25:41 +07:00
|
|
|
else
|
|
|
|
p4d_clear(p4d_offset(pgd, start));
|
2017-03-18 01:55:13 +07:00
|
|
|
}
|
2017-09-29 21:08:18 +07:00
|
|
|
|
|
|
|
pgd = pgd_offset_k(start);
|
|
|
|
for (; start < end; start += P4D_SIZE)
|
|
|
|
p4d_clear(p4d_offset(pgd, start));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline p4d_t *early_p4d_offset(pgd_t *pgd, unsigned long addr)
|
|
|
|
{
|
|
|
|
unsigned long p4d;
|
|
|
|
|
2018-05-18 17:35:24 +07:00
|
|
|
if (!pgtable_l5_enabled())
|
2017-09-29 21:08:18 +07:00
|
|
|
return (p4d_t *)pgd;
|
|
|
|
|
|
|
|
p4d = __pa_nodebug(pgd_val(*pgd)) & PTE_PFN_MASK;
|
|
|
|
p4d += __START_KERNEL_map - phys_base;
|
|
|
|
return (p4d_t *)p4d + p4d_index(addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init kasan_early_p4d_populate(pgd_t *pgd,
|
|
|
|
unsigned long addr,
|
|
|
|
unsigned long end)
|
|
|
|
{
|
|
|
|
pgd_t pgd_entry;
|
|
|
|
p4d_t *p4d, p4d_entry;
|
|
|
|
unsigned long next;
|
|
|
|
|
|
|
|
if (pgd_none(*pgd)) {
|
2018-12-28 15:30:01 +07:00
|
|
|
pgd_entry = __pgd(_KERNPG_TABLE |
|
|
|
|
__pa_nodebug(kasan_early_shadow_p4d));
|
2017-09-29 21:08:18 +07:00
|
|
|
set_pgd(pgd, pgd_entry);
|
|
|
|
}
|
|
|
|
|
|
|
|
p4d = early_p4d_offset(pgd, addr);
|
|
|
|
do {
|
|
|
|
next = p4d_addr_end(addr, end);
|
|
|
|
|
|
|
|
if (!p4d_none(*p4d))
|
|
|
|
continue;
|
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
p4d_entry = __p4d(_KERNPG_TABLE |
|
|
|
|
__pa_nodebug(kasan_early_shadow_pud));
|
2017-09-29 21:08:18 +07:00
|
|
|
set_p4d(p4d, p4d_entry);
|
|
|
|
} while (p4d++, addr = next, addr != end && p4d_none(*p4d));
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|
|
|
|
|
2015-07-02 16:09:34 +07:00
|
|
|
static void __init kasan_map_early_shadow(pgd_t *pgd)
|
2015-02-14 05:39:25 +07:00
|
|
|
{
|
2017-09-29 21:08:18 +07:00
|
|
|
/* See comment in kasan_init() */
|
|
|
|
unsigned long addr = KASAN_SHADOW_START & PGDIR_MASK;
|
2015-02-14 05:39:25 +07:00
|
|
|
unsigned long end = KASAN_SHADOW_END;
|
2017-09-29 21:08:18 +07:00
|
|
|
unsigned long next;
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2017-09-29 21:08:18 +07:00
|
|
|
pgd += pgd_index(addr);
|
|
|
|
do {
|
|
|
|
next = pgd_addr_end(addr, end);
|
|
|
|
kasan_early_p4d_populate(pgd, addr, next);
|
|
|
|
} while (pgd++, addr = next, addr != end);
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_KASAN_INLINE
|
|
|
|
static int kasan_die_handler(struct notifier_block *self,
|
|
|
|
unsigned long val,
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
if (val == DIE_GPF) {
|
2016-07-15 02:06:53 +07:00
|
|
|
pr_emerg("CONFIG_KASAN_INLINE enabled\n");
|
|
|
|
pr_emerg("GPF could be caused by NULL-ptr deref or user memory access\n");
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|
|
|
|
return NOTIFY_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct notifier_block kasan_die_notifier = {
|
|
|
|
.notifier_call = kasan_die_handler,
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2015-07-02 16:09:34 +07:00
|
|
|
void __init kasan_early_init(void)
|
|
|
|
{
|
|
|
|
int i;
|
2018-12-28 15:30:01 +07:00
|
|
|
pteval_t pte_val = __pa_nodebug(kasan_early_shadow_page) |
|
|
|
|
__PAGE_KERNEL | _PAGE_ENC;
|
|
|
|
pmdval_t pmd_val = __pa_nodebug(kasan_early_shadow_pte) | _KERNPG_TABLE;
|
|
|
|
pudval_t pud_val = __pa_nodebug(kasan_early_shadow_pmd) | _KERNPG_TABLE;
|
|
|
|
p4dval_t p4d_val = __pa_nodebug(kasan_early_shadow_pud) | _KERNPG_TABLE;
|
2015-07-02 16:09:34 +07:00
|
|
|
|
2018-04-07 03:55:09 +07:00
|
|
|
/* Mask out unsupported __PAGE_KERNEL bits: */
|
|
|
|
pte_val &= __default_kernel_pte_mask;
|
|
|
|
pmd_val &= __default_kernel_pte_mask;
|
|
|
|
pud_val &= __default_kernel_pte_mask;
|
|
|
|
p4d_val &= __default_kernel_pte_mask;
|
|
|
|
|
2015-07-02 16:09:34 +07:00
|
|
|
for (i = 0; i < PTRS_PER_PTE; i++)
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_early_shadow_pte[i] = __pte(pte_val);
|
2015-07-02 16:09:34 +07:00
|
|
|
|
|
|
|
for (i = 0; i < PTRS_PER_PMD; i++)
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_early_shadow_pmd[i] = __pmd(pmd_val);
|
2015-07-02 16:09:34 +07:00
|
|
|
|
|
|
|
for (i = 0; i < PTRS_PER_PUD; i++)
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_early_shadow_pud[i] = __pud(pud_val);
|
2015-07-02 16:09:34 +07:00
|
|
|
|
2018-05-18 17:35:24 +07:00
|
|
|
for (i = 0; pgtable_l5_enabled() && i < PTRS_PER_P4D; i++)
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_early_shadow_p4d[i] = __p4d(p4d_val);
|
2017-03-30 15:07:30 +07:00
|
|
|
|
2017-06-06 18:31:27 +07:00
|
|
|
kasan_map_early_shadow(early_top_pgt);
|
|
|
|
kasan_map_early_shadow(init_top_pgt);
|
2015-07-02 16:09:34 +07:00
|
|
|
}
|
|
|
|
|
2015-02-14 05:39:25 +07:00
|
|
|
void __init kasan_init(void)
|
|
|
|
{
|
|
|
|
int i;
|
2017-12-04 21:07:16 +07:00
|
|
|
void *shadow_cpu_entry_begin, *shadow_cpu_entry_end;
|
2015-02-14 05:39:25 +07:00
|
|
|
|
|
|
|
#ifdef CONFIG_KASAN_INLINE
|
|
|
|
register_die_notifier(&kasan_die_notifier);
|
|
|
|
#endif
|
|
|
|
|
2017-06-06 18:31:27 +07:00
|
|
|
memcpy(early_top_pgt, init_top_pgt, sizeof(early_top_pgt));
|
2017-09-29 21:08:18 +07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We use the same shadow offset for 4- and 5-level paging to
|
|
|
|
* facilitate boot-time switching between paging modes.
|
|
|
|
* As result in 5-level paging mode KASAN_SHADOW_START and
|
|
|
|
* KASAN_SHADOW_END are not aligned to PGD boundary.
|
|
|
|
*
|
|
|
|
* KASAN_SHADOW_START doesn't share PGD with anything else.
|
|
|
|
* We claim whole PGD entry to make things easier.
|
|
|
|
*
|
|
|
|
* KASAN_SHADOW_END lands in the last PGD entry and it collides with
|
|
|
|
* bunch of things like kernel code, modules, EFI mapping, etc.
|
|
|
|
* We need to take extra steps to not overwrite them.
|
|
|
|
*/
|
2018-05-18 17:35:24 +07:00
|
|
|
if (pgtable_l5_enabled()) {
|
2017-09-29 21:08:18 +07:00
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
ptr = (void *)pgd_page_vaddr(*pgd_offset_k(KASAN_SHADOW_END));
|
|
|
|
memcpy(tmp_p4d_table, (void *)ptr, sizeof(tmp_p4d_table));
|
|
|
|
set_pgd(&early_top_pgt[pgd_index(KASAN_SHADOW_END)],
|
|
|
|
__pgd(__pa(tmp_p4d_table) | _KERNPG_TABLE));
|
|
|
|
}
|
|
|
|
|
2017-06-06 18:31:27 +07:00
|
|
|
load_cr3(early_top_pgt);
|
2015-07-02 16:09:35 +07:00
|
|
|
__flush_tlb_all();
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2017-09-29 21:08:18 +07:00
|
|
|
clear_pgds(KASAN_SHADOW_START & PGDIR_MASK, KASAN_SHADOW_END);
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_populate_early_shadow((void *)(KASAN_SHADOW_START & PGDIR_MASK),
|
2015-02-14 05:39:25 +07:00
|
|
|
kasan_mem_to_shadow((void *)PAGE_OFFSET));
|
|
|
|
|
2017-01-28 23:29:08 +07:00
|
|
|
for (i = 0; i < E820_MAX_ENTRIES; i++) {
|
2015-02-14 05:39:25 +07:00
|
|
|
if (pfn_mapped[i].end == 0)
|
|
|
|
break;
|
|
|
|
|
2017-11-16 08:36:35 +07:00
|
|
|
map_range(&pfn_mapped[i]);
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|
2017-11-16 08:36:35 +07:00
|
|
|
|
2017-12-21 00:51:31 +07:00
|
|
|
shadow_cpu_entry_begin = (void *)CPU_ENTRY_AREA_BASE;
|
2017-12-04 21:07:16 +07:00
|
|
|
shadow_cpu_entry_begin = kasan_mem_to_shadow(shadow_cpu_entry_begin);
|
2018-12-28 15:30:01 +07:00
|
|
|
shadow_cpu_entry_begin = (void *)round_down(
|
|
|
|
(unsigned long)shadow_cpu_entry_begin, PAGE_SIZE);
|
2017-12-04 21:07:16 +07:00
|
|
|
|
2017-12-21 00:51:31 +07:00
|
|
|
shadow_cpu_entry_end = (void *)(CPU_ENTRY_AREA_BASE +
|
|
|
|
CPU_ENTRY_AREA_MAP_SIZE);
|
2017-12-04 21:07:16 +07:00
|
|
|
shadow_cpu_entry_end = kasan_mem_to_shadow(shadow_cpu_entry_end);
|
2018-12-28 15:30:01 +07:00
|
|
|
shadow_cpu_entry_end = (void *)round_up(
|
|
|
|
(unsigned long)shadow_cpu_entry_end, PAGE_SIZE);
|
2017-12-04 21:07:16 +07:00
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_populate_early_shadow(
|
2017-12-21 00:51:31 +07:00
|
|
|
kasan_mem_to_shadow((void *)PAGE_OFFSET + MAXMEM),
|
|
|
|
shadow_cpu_entry_begin);
|
2017-12-04 21:07:16 +07:00
|
|
|
|
|
|
|
kasan_populate_shadow((unsigned long)shadow_cpu_entry_begin,
|
|
|
|
(unsigned long)shadow_cpu_entry_end, 0);
|
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_populate_early_shadow(shadow_cpu_entry_end,
|
|
|
|
kasan_mem_to_shadow((void *)__START_KERNEL_map));
|
2017-12-21 00:51:31 +07:00
|
|
|
|
|
|
|
kasan_populate_shadow((unsigned long)kasan_mem_to_shadow(_stext),
|
|
|
|
(unsigned long)kasan_mem_to_shadow(_end),
|
|
|
|
early_pfn_to_nid(__pa(_stext)));
|
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
kasan_populate_early_shadow(kasan_mem_to_shadow((void *)MODULES_END),
|
|
|
|
(void *)KASAN_SHADOW_END);
|
2015-02-14 05:39:25 +07:00
|
|
|
|
2017-06-06 18:31:27 +07:00
|
|
|
load_cr3(init_top_pgt);
|
2015-07-02 16:09:35 +07:00
|
|
|
__flush_tlb_all();
|
2015-07-02 16:09:37 +07:00
|
|
|
|
2016-01-11 19:51:18 +07:00
|
|
|
/*
|
2018-12-28 15:30:01 +07:00
|
|
|
* kasan_early_shadow_page has been used as early shadow memory, thus
|
|
|
|
* it may contain some garbage. Now we can clear and write protect it,
|
|
|
|
* since after the TLB flush no one should write to it.
|
2016-01-11 19:51:18 +07:00
|
|
|
*/
|
2018-12-28 15:30:01 +07:00
|
|
|
memset(kasan_early_shadow_page, 0, PAGE_SIZE);
|
2016-01-11 19:51:19 +07:00
|
|
|
for (i = 0; i < PTRS_PER_PTE; i++) {
|
2018-04-07 03:55:09 +07:00
|
|
|
pte_t pte;
|
|
|
|
pgprot_t prot;
|
|
|
|
|
|
|
|
prot = __pgprot(__PAGE_KERNEL_RO | _PAGE_ENC);
|
|
|
|
pgprot_val(prot) &= __default_kernel_pte_mask;
|
|
|
|
|
2018-12-28 15:30:01 +07:00
|
|
|
pte = __pte(__pa(kasan_early_shadow_page) | pgprot_val(prot));
|
|
|
|
set_pte(&kasan_early_shadow_pte[i], pte);
|
2016-01-11 19:51:19 +07:00
|
|
|
}
|
|
|
|
/* Flush TLBs again to be sure that write protection applied. */
|
|
|
|
__flush_tlb_all();
|
2016-01-11 19:51:18 +07:00
|
|
|
|
|
|
|
init_task.kasan_depth = 0;
|
2015-11-06 09:51:03 +07:00
|
|
|
pr_info("KernelAddressSanitizer initialized\n");
|
2015-02-14 05:39:25 +07:00
|
|
|
}
|