mirror of
https://github.com/torvalds/linux.git
synced 2024-12-13 14:43:03 +00:00
b24413180f
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>
239 lines
7.2 KiB
C
239 lines
7.2 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* This file implements KASLR memory randomization for x86_64. It randomizes
|
|
* the virtual address space of kernel memory regions (physical memory
|
|
* mapping, vmalloc & vmemmap) for x86_64. This security feature mitigates
|
|
* exploits relying on predictable kernel addresses.
|
|
*
|
|
* Entropy is generated using the KASLR early boot functions now shared in
|
|
* the lib directory (originally written by Kees Cook). Randomization is
|
|
* done on PGD & P4D/PUD page table levels to increase possible addresses.
|
|
* The physical memory mapping code was adapted to support P4D/PUD level
|
|
* virtual addresses. This implementation on the best configuration provides
|
|
* 30,000 possible virtual addresses in average for each memory region.
|
|
* An additional low memory page is used to ensure each CPU can start with
|
|
* a PGD aligned virtual address (for realmode).
|
|
*
|
|
* The order of each memory region is not changed. The feature looks at
|
|
* the available space for the regions based on different configuration
|
|
* options and randomizes the base and space between each. The size of the
|
|
* physical memory mapping is the available physical memory.
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
#include <linux/init.h>
|
|
#include <linux/random.h>
|
|
|
|
#include <asm/pgalloc.h>
|
|
#include <asm/pgtable.h>
|
|
#include <asm/setup.h>
|
|
#include <asm/kaslr.h>
|
|
|
|
#include "mm_internal.h"
|
|
|
|
#define TB_SHIFT 40
|
|
|
|
/*
|
|
* Virtual address start and end range for randomization. The end changes base
|
|
* on configuration to have the highest amount of space for randomization.
|
|
* It increases the possible random position for each randomized region.
|
|
*
|
|
* You need to add an if/def entry if you introduce a new memory region
|
|
* compatible with KASLR. Your entry must be in logical order with memory
|
|
* layout. For example, ESPFIX is before EFI because its virtual address is
|
|
* before. You also need to add a BUILD_BUG_ON() in kernel_randomize_memory() to
|
|
* ensure that this order is correct and won't be changed.
|
|
*/
|
|
static const unsigned long vaddr_start = __PAGE_OFFSET_BASE;
|
|
|
|
#if defined(CONFIG_X86_ESPFIX64)
|
|
static const unsigned long vaddr_end = ESPFIX_BASE_ADDR;
|
|
#elif defined(CONFIG_EFI)
|
|
static const unsigned long vaddr_end = EFI_VA_END;
|
|
#else
|
|
static const unsigned long vaddr_end = __START_KERNEL_map;
|
|
#endif
|
|
|
|
/* Default values */
|
|
unsigned long page_offset_base = __PAGE_OFFSET_BASE;
|
|
EXPORT_SYMBOL(page_offset_base);
|
|
unsigned long vmalloc_base = __VMALLOC_BASE;
|
|
EXPORT_SYMBOL(vmalloc_base);
|
|
unsigned long vmemmap_base = __VMEMMAP_BASE;
|
|
EXPORT_SYMBOL(vmemmap_base);
|
|
|
|
/*
|
|
* Memory regions randomized by KASLR (except modules that use a separate logic
|
|
* earlier during boot). The list is ordered based on virtual addresses. This
|
|
* order is kept after randomization.
|
|
*/
|
|
static __initdata struct kaslr_memory_region {
|
|
unsigned long *base;
|
|
unsigned long size_tb;
|
|
} kaslr_regions[] = {
|
|
{ &page_offset_base, 1 << (__PHYSICAL_MASK_SHIFT - TB_SHIFT) /* Maximum */ },
|
|
{ &vmalloc_base, VMALLOC_SIZE_TB },
|
|
{ &vmemmap_base, 1 },
|
|
};
|
|
|
|
/* Get size in bytes used by the memory region */
|
|
static inline unsigned long get_padding(struct kaslr_memory_region *region)
|
|
{
|
|
return (region->size_tb << TB_SHIFT);
|
|
}
|
|
|
|
/*
|
|
* Apply no randomization if KASLR was disabled at boot or if KASAN
|
|
* is enabled. KASAN shadow mappings rely on regions being PGD aligned.
|
|
*/
|
|
static inline bool kaslr_memory_enabled(void)
|
|
{
|
|
return kaslr_enabled() && !IS_ENABLED(CONFIG_KASAN);
|
|
}
|
|
|
|
/* Initialize base and padding for each memory region randomized with KASLR */
|
|
void __init kernel_randomize_memory(void)
|
|
{
|
|
size_t i;
|
|
unsigned long vaddr = vaddr_start;
|
|
unsigned long rand, memory_tb;
|
|
struct rnd_state rand_state;
|
|
unsigned long remain_entropy;
|
|
|
|
/*
|
|
* All these BUILD_BUG_ON checks ensures the memory layout is
|
|
* consistent with the vaddr_start/vaddr_end variables.
|
|
*/
|
|
BUILD_BUG_ON(vaddr_start >= vaddr_end);
|
|
BUILD_BUG_ON(IS_ENABLED(CONFIG_X86_ESPFIX64) &&
|
|
vaddr_end >= EFI_VA_END);
|
|
BUILD_BUG_ON((IS_ENABLED(CONFIG_X86_ESPFIX64) ||
|
|
IS_ENABLED(CONFIG_EFI)) &&
|
|
vaddr_end >= __START_KERNEL_map);
|
|
BUILD_BUG_ON(vaddr_end > __START_KERNEL_map);
|
|
|
|
if (!kaslr_memory_enabled())
|
|
return;
|
|
|
|
/*
|
|
* Update Physical memory mapping to available and
|
|
* add padding if needed (especially for memory hotplug support).
|
|
*/
|
|
BUG_ON(kaslr_regions[0].base != &page_offset_base);
|
|
memory_tb = DIV_ROUND_UP(max_pfn << PAGE_SHIFT, 1UL << TB_SHIFT) +
|
|
CONFIG_RANDOMIZE_MEMORY_PHYSICAL_PADDING;
|
|
|
|
/* Adapt phyiscal memory region size based on available memory */
|
|
if (memory_tb < kaslr_regions[0].size_tb)
|
|
kaslr_regions[0].size_tb = memory_tb;
|
|
|
|
/* Calculate entropy available between regions */
|
|
remain_entropy = vaddr_end - vaddr_start;
|
|
for (i = 0; i < ARRAY_SIZE(kaslr_regions); i++)
|
|
remain_entropy -= get_padding(&kaslr_regions[i]);
|
|
|
|
prandom_seed_state(&rand_state, kaslr_get_random_long("Memory"));
|
|
|
|
for (i = 0; i < ARRAY_SIZE(kaslr_regions); i++) {
|
|
unsigned long entropy;
|
|
|
|
/*
|
|
* Select a random virtual address using the extra entropy
|
|
* available.
|
|
*/
|
|
entropy = remain_entropy / (ARRAY_SIZE(kaslr_regions) - i);
|
|
prandom_bytes_state(&rand_state, &rand, sizeof(rand));
|
|
if (IS_ENABLED(CONFIG_X86_5LEVEL))
|
|
entropy = (rand % (entropy + 1)) & P4D_MASK;
|
|
else
|
|
entropy = (rand % (entropy + 1)) & PUD_MASK;
|
|
vaddr += entropy;
|
|
*kaslr_regions[i].base = vaddr;
|
|
|
|
/*
|
|
* Jump the region and add a minimum padding based on
|
|
* randomization alignment.
|
|
*/
|
|
vaddr += get_padding(&kaslr_regions[i]);
|
|
if (IS_ENABLED(CONFIG_X86_5LEVEL))
|
|
vaddr = round_up(vaddr + 1, P4D_SIZE);
|
|
else
|
|
vaddr = round_up(vaddr + 1, PUD_SIZE);
|
|
remain_entropy -= entropy;
|
|
}
|
|
}
|
|
|
|
static void __meminit init_trampoline_pud(void)
|
|
{
|
|
unsigned long paddr, paddr_next;
|
|
pgd_t *pgd;
|
|
pud_t *pud_page, *pud_page_tramp;
|
|
int i;
|
|
|
|
pud_page_tramp = alloc_low_page();
|
|
|
|
paddr = 0;
|
|
pgd = pgd_offset_k((unsigned long)__va(paddr));
|
|
pud_page = (pud_t *) pgd_page_vaddr(*pgd);
|
|
|
|
for (i = pud_index(paddr); i < PTRS_PER_PUD; i++, paddr = paddr_next) {
|
|
pud_t *pud, *pud_tramp;
|
|
unsigned long vaddr = (unsigned long)__va(paddr);
|
|
|
|
pud_tramp = pud_page_tramp + pud_index(paddr);
|
|
pud = pud_page + pud_index(vaddr);
|
|
paddr_next = (paddr & PUD_MASK) + PUD_SIZE;
|
|
|
|
*pud_tramp = *pud;
|
|
}
|
|
|
|
set_pgd(&trampoline_pgd_entry,
|
|
__pgd(_KERNPG_TABLE | __pa(pud_page_tramp)));
|
|
}
|
|
|
|
static void __meminit init_trampoline_p4d(void)
|
|
{
|
|
unsigned long paddr, paddr_next;
|
|
pgd_t *pgd;
|
|
p4d_t *p4d_page, *p4d_page_tramp;
|
|
int i;
|
|
|
|
p4d_page_tramp = alloc_low_page();
|
|
|
|
paddr = 0;
|
|
pgd = pgd_offset_k((unsigned long)__va(paddr));
|
|
p4d_page = (p4d_t *) pgd_page_vaddr(*pgd);
|
|
|
|
for (i = p4d_index(paddr); i < PTRS_PER_P4D; i++, paddr = paddr_next) {
|
|
p4d_t *p4d, *p4d_tramp;
|
|
unsigned long vaddr = (unsigned long)__va(paddr);
|
|
|
|
p4d_tramp = p4d_page_tramp + p4d_index(paddr);
|
|
p4d = p4d_page + p4d_index(vaddr);
|
|
paddr_next = (paddr & P4D_MASK) + P4D_SIZE;
|
|
|
|
*p4d_tramp = *p4d;
|
|
}
|
|
|
|
set_pgd(&trampoline_pgd_entry,
|
|
__pgd(_KERNPG_TABLE | __pa(p4d_page_tramp)));
|
|
}
|
|
|
|
/*
|
|
* Create PGD aligned trampoline table to allow real mode initialization
|
|
* of additional CPUs. Consume only 1 low memory page.
|
|
*/
|
|
void __meminit init_trampoline(void)
|
|
{
|
|
|
|
if (!kaslr_memory_enabled()) {
|
|
init_trampoline_default();
|
|
return;
|
|
}
|
|
|
|
if (IS_ENABLED(CONFIG_X86_5LEVEL))
|
|
init_trampoline_p4d();
|
|
else
|
|
init_trampoline_pud();
|
|
}
|