mirror of
https://github.com/torvalds/linux.git
synced 2024-12-26 04:42:12 +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>
391 lines
9.4 KiB
C
391 lines
9.4 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* arch/cris/mm/fault.c
|
|
*
|
|
* Copyright (C) 2000-2010 Axis Communications AB
|
|
*/
|
|
|
|
#include <linux/mm.h>
|
|
#include <linux/interrupt.h>
|
|
#include <linux/extable.h>
|
|
#include <linux/wait.h>
|
|
#include <linux/sched/signal.h>
|
|
#include <linux/uaccess.h>
|
|
#include <arch/system.h>
|
|
|
|
extern int find_fixup_code(struct pt_regs *);
|
|
extern void die_if_kernel(const char *, struct pt_regs *, long);
|
|
extern void show_registers(struct pt_regs *regs);
|
|
|
|
/* debug of low-level TLB reload */
|
|
#undef DEBUG
|
|
|
|
#ifdef DEBUG
|
|
#define D(x) x
|
|
#else
|
|
#define D(x)
|
|
#endif
|
|
|
|
/* debug of higher-level faults */
|
|
#define DPG(x)
|
|
|
|
/* current active page directory */
|
|
|
|
DEFINE_PER_CPU(pgd_t *, current_pgd);
|
|
unsigned long cris_signal_return_page;
|
|
|
|
/*
|
|
* This routine handles page faults. It determines the address,
|
|
* and the problem, and then passes it off to one of the appropriate
|
|
* routines.
|
|
*
|
|
* Notice that the address we're given is aligned to the page the fault
|
|
* occurred in, since we only get the PFN in R_MMU_CAUSE not the complete
|
|
* address.
|
|
*
|
|
* error_code:
|
|
* bit 0 == 0 means no page found, 1 means protection fault
|
|
* bit 1 == 0 means read, 1 means write
|
|
*
|
|
* If this routine detects a bad access, it returns 1, otherwise it
|
|
* returns 0.
|
|
*/
|
|
|
|
asmlinkage void
|
|
do_page_fault(unsigned long address, struct pt_regs *regs,
|
|
int protection, int writeaccess)
|
|
{
|
|
struct task_struct *tsk;
|
|
struct mm_struct *mm;
|
|
struct vm_area_struct * vma;
|
|
siginfo_t info;
|
|
int fault;
|
|
unsigned int flags = FAULT_FLAG_ALLOW_RETRY | FAULT_FLAG_KILLABLE;
|
|
|
|
D(printk(KERN_DEBUG
|
|
"Page fault for %lX on %X at %lX, prot %d write %d\n",
|
|
address, smp_processor_id(), instruction_pointer(regs),
|
|
protection, writeaccess));
|
|
|
|
tsk = current;
|
|
|
|
/*
|
|
* We fault-in kernel-space virtual memory on-demand. The
|
|
* 'reference' page table is init_mm.pgd.
|
|
*
|
|
* NOTE! We MUST NOT take any locks for this case. We may
|
|
* be in an interrupt or a critical region, and should
|
|
* only copy the information from the master page table,
|
|
* nothing more.
|
|
*
|
|
* NOTE2: This is done so that, when updating the vmalloc
|
|
* mappings we don't have to walk all processes pgdirs and
|
|
* add the high mappings all at once. Instead we do it as they
|
|
* are used. However vmalloc'ed page entries have the PAGE_GLOBAL
|
|
* bit set so sometimes the TLB can use a lingering entry.
|
|
*
|
|
* This verifies that the fault happens in kernel space
|
|
* and that the fault was not a protection error (error_code & 1).
|
|
*/
|
|
|
|
if (address >= VMALLOC_START &&
|
|
!protection &&
|
|
!user_mode(regs))
|
|
goto vmalloc_fault;
|
|
|
|
/* When stack execution is not allowed we store the signal
|
|
* trampolines in the reserved cris_signal_return_page.
|
|
* Handle this in the exact same way as vmalloc (we know
|
|
* that the mapping is there and is valid so no need to
|
|
* call handle_mm_fault).
|
|
*/
|
|
if (cris_signal_return_page &&
|
|
address == cris_signal_return_page &&
|
|
!protection && user_mode(regs))
|
|
goto vmalloc_fault;
|
|
|
|
/* we can and should enable interrupts at this point */
|
|
local_irq_enable();
|
|
|
|
mm = tsk->mm;
|
|
info.si_code = SEGV_MAPERR;
|
|
|
|
/*
|
|
* If we're in an interrupt, have pagefaults disabled or have no
|
|
* user context, we must not take the fault.
|
|
*/
|
|
|
|
if (faulthandler_disabled() || !mm)
|
|
goto no_context;
|
|
|
|
if (user_mode(regs))
|
|
flags |= FAULT_FLAG_USER;
|
|
retry:
|
|
down_read(&mm->mmap_sem);
|
|
vma = find_vma(mm, address);
|
|
if (!vma)
|
|
goto bad_area;
|
|
if (vma->vm_start <= address)
|
|
goto good_area;
|
|
if (!(vma->vm_flags & VM_GROWSDOWN))
|
|
goto bad_area;
|
|
if (user_mode(regs)) {
|
|
/*
|
|
* accessing the stack below usp is always a bug.
|
|
* we get page-aligned addresses so we can only check
|
|
* if we're within a page from usp, but that might be
|
|
* enough to catch brutal errors at least.
|
|
*/
|
|
if (address + PAGE_SIZE < rdusp())
|
|
goto bad_area;
|
|
}
|
|
if (expand_stack(vma, address))
|
|
goto bad_area;
|
|
|
|
/*
|
|
* Ok, we have a good vm_area for this memory access, so
|
|
* we can handle it..
|
|
*/
|
|
|
|
good_area:
|
|
info.si_code = SEGV_ACCERR;
|
|
|
|
/* first do some preliminary protection checks */
|
|
|
|
if (writeaccess == 2){
|
|
if (!(vma->vm_flags & VM_EXEC))
|
|
goto bad_area;
|
|
} else if (writeaccess == 1) {
|
|
if (!(vma->vm_flags & VM_WRITE))
|
|
goto bad_area;
|
|
flags |= FAULT_FLAG_WRITE;
|
|
} else {
|
|
if (!(vma->vm_flags & (VM_READ | VM_EXEC)))
|
|
goto bad_area;
|
|
}
|
|
|
|
/*
|
|
* If for any reason at all we couldn't handle the fault,
|
|
* make sure we exit gracefully rather than endlessly redo
|
|
* the fault.
|
|
*/
|
|
|
|
fault = handle_mm_fault(vma, address, flags);
|
|
|
|
if ((fault & VM_FAULT_RETRY) && fatal_signal_pending(current))
|
|
return;
|
|
|
|
if (unlikely(fault & VM_FAULT_ERROR)) {
|
|
if (fault & VM_FAULT_OOM)
|
|
goto out_of_memory;
|
|
else if (fault & VM_FAULT_SIGSEGV)
|
|
goto bad_area;
|
|
else if (fault & VM_FAULT_SIGBUS)
|
|
goto do_sigbus;
|
|
BUG();
|
|
}
|
|
|
|
if (flags & FAULT_FLAG_ALLOW_RETRY) {
|
|
if (fault & VM_FAULT_MAJOR)
|
|
tsk->maj_flt++;
|
|
else
|
|
tsk->min_flt++;
|
|
if (fault & VM_FAULT_RETRY) {
|
|
flags &= ~FAULT_FLAG_ALLOW_RETRY;
|
|
flags |= FAULT_FLAG_TRIED;
|
|
|
|
/*
|
|
* No need to up_read(&mm->mmap_sem) as we would
|
|
* have already released it in __lock_page_or_retry
|
|
* in mm/filemap.c.
|
|
*/
|
|
|
|
goto retry;
|
|
}
|
|
}
|
|
|
|
up_read(&mm->mmap_sem);
|
|
return;
|
|
|
|
/*
|
|
* Something tried to access memory that isn't in our memory map..
|
|
* Fix it, but check if it's kernel or user first..
|
|
*/
|
|
|
|
bad_area:
|
|
up_read(&mm->mmap_sem);
|
|
|
|
bad_area_nosemaphore:
|
|
DPG(show_registers(regs));
|
|
|
|
/* User mode accesses just cause a SIGSEGV */
|
|
|
|
if (user_mode(regs)) {
|
|
#ifdef CONFIG_NO_SEGFAULT_TERMINATION
|
|
DECLARE_WAIT_QUEUE_HEAD(wq);
|
|
#endif
|
|
printk(KERN_NOTICE "%s (pid %d) segfaults for page "
|
|
"address %08lx at pc %08lx\n",
|
|
tsk->comm, tsk->pid,
|
|
address, instruction_pointer(regs));
|
|
|
|
/* With DPG on, we've already dumped registers above. */
|
|
DPG(if (0))
|
|
show_registers(regs);
|
|
|
|
#ifdef CONFIG_NO_SEGFAULT_TERMINATION
|
|
wait_event_interruptible(wq, 0 == 1);
|
|
#else
|
|
info.si_signo = SIGSEGV;
|
|
info.si_errno = 0;
|
|
/* info.si_code has been set above */
|
|
info.si_addr = (void *)address;
|
|
force_sig_info(SIGSEGV, &info, tsk);
|
|
#endif
|
|
return;
|
|
}
|
|
|
|
no_context:
|
|
|
|
/* Are we prepared to handle this kernel fault?
|
|
*
|
|
* (The kernel has valid exception-points in the source
|
|
* when it accesses user-memory. When it fails in one
|
|
* of those points, we find it in a table and do a jump
|
|
* to some fixup code that loads an appropriate error
|
|
* code)
|
|
*/
|
|
|
|
if (find_fixup_code(regs))
|
|
return;
|
|
|
|
/*
|
|
* Oops. The kernel tried to access some bad page. We'll have to
|
|
* terminate things with extreme prejudice.
|
|
*/
|
|
|
|
if (!oops_in_progress) {
|
|
oops_in_progress = 1;
|
|
if ((unsigned long) (address) < PAGE_SIZE)
|
|
printk(KERN_ALERT "Unable to handle kernel NULL "
|
|
"pointer dereference");
|
|
else
|
|
printk(KERN_ALERT "Unable to handle kernel access"
|
|
" at virtual address %08lx\n", address);
|
|
|
|
die_if_kernel("Oops", regs, (writeaccess << 1) | protection);
|
|
oops_in_progress = 0;
|
|
}
|
|
|
|
do_exit(SIGKILL);
|
|
|
|
/*
|
|
* We ran out of memory, or some other thing happened to us that made
|
|
* us unable to handle the page fault gracefully.
|
|
*/
|
|
|
|
out_of_memory:
|
|
up_read(&mm->mmap_sem);
|
|
if (!user_mode(regs))
|
|
goto no_context;
|
|
pagefault_out_of_memory();
|
|
return;
|
|
|
|
do_sigbus:
|
|
up_read(&mm->mmap_sem);
|
|
|
|
/*
|
|
* Send a sigbus, regardless of whether we were in kernel
|
|
* or user mode.
|
|
*/
|
|
info.si_signo = SIGBUS;
|
|
info.si_errno = 0;
|
|
info.si_code = BUS_ADRERR;
|
|
info.si_addr = (void *)address;
|
|
force_sig_info(SIGBUS, &info, tsk);
|
|
|
|
/* Kernel mode? Handle exceptions or die */
|
|
if (!user_mode(regs))
|
|
goto no_context;
|
|
return;
|
|
|
|
vmalloc_fault:
|
|
{
|
|
/*
|
|
* Synchronize this task's top level page-table
|
|
* with the 'reference' page table.
|
|
*
|
|
* Use current_pgd instead of tsk->active_mm->pgd
|
|
* since the latter might be unavailable if this
|
|
* code is executed in a misfortunately run irq
|
|
* (like inside schedule() between switch_mm and
|
|
* switch_to...).
|
|
*/
|
|
|
|
int offset = pgd_index(address);
|
|
pgd_t *pgd, *pgd_k;
|
|
pud_t *pud, *pud_k;
|
|
pmd_t *pmd, *pmd_k;
|
|
pte_t *pte_k;
|
|
|
|
pgd = (pgd_t *)per_cpu(current_pgd, smp_processor_id()) + offset;
|
|
pgd_k = init_mm.pgd + offset;
|
|
|
|
/* Since we're two-level, we don't need to do both
|
|
* set_pgd and set_pmd (they do the same thing). If
|
|
* we go three-level at some point, do the right thing
|
|
* with pgd_present and set_pgd here.
|
|
*
|
|
* Also, since the vmalloc area is global, we don't
|
|
* need to copy individual PTE's, it is enough to
|
|
* copy the pgd pointer into the pte page of the
|
|
* root task. If that is there, we'll find our pte if
|
|
* it exists.
|
|
*/
|
|
|
|
pud = pud_offset(pgd, address);
|
|
pud_k = pud_offset(pgd_k, address);
|
|
if (!pud_present(*pud_k))
|
|
goto no_context;
|
|
|
|
pmd = pmd_offset(pud, address);
|
|
pmd_k = pmd_offset(pud_k, address);
|
|
|
|
if (!pmd_present(*pmd_k))
|
|
goto bad_area_nosemaphore;
|
|
|
|
set_pmd(pmd, *pmd_k);
|
|
|
|
/* Make sure the actual PTE exists as well to
|
|
* catch kernel vmalloc-area accesses to non-mapped
|
|
* addresses. If we don't do this, this will just
|
|
* silently loop forever.
|
|
*/
|
|
|
|
pte_k = pte_offset_kernel(pmd_k, address);
|
|
if (!pte_present(*pte_k))
|
|
goto no_context;
|
|
|
|
return;
|
|
}
|
|
}
|
|
|
|
/* Find fixup code. */
|
|
int
|
|
find_fixup_code(struct pt_regs *regs)
|
|
{
|
|
const struct exception_table_entry *fixup;
|
|
/* in case of delay slot fault (v32) */
|
|
unsigned long ip = (instruction_pointer(regs) & ~0x1);
|
|
|
|
fixup = search_exception_tables(ip);
|
|
if (fixup != 0) {
|
|
/* Adjust the instruction pointer in the stackframe. */
|
|
instruction_pointer(regs) = fixup->fixup;
|
|
arch_fixup(regs);
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|