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>
311 lines
8.2 KiB
C
311 lines
8.2 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _ASM_IA64_TLB_H
|
|
#define _ASM_IA64_TLB_H
|
|
/*
|
|
* Based on <asm-generic/tlb.h>.
|
|
*
|
|
* Copyright (C) 2002-2003 Hewlett-Packard Co
|
|
* David Mosberger-Tang <davidm@hpl.hp.com>
|
|
*/
|
|
/*
|
|
* Removing a translation from a page table (including TLB-shootdown) is a four-step
|
|
* procedure:
|
|
*
|
|
* (1) Flush (virtual) caches --- ensures virtual memory is coherent with kernel memory
|
|
* (this is a no-op on ia64).
|
|
* (2) Clear the relevant portions of the page-table
|
|
* (3) Flush the TLBs --- ensures that stale content is gone from CPU TLBs
|
|
* (4) Release the pages that were freed up in step (2).
|
|
*
|
|
* Note that the ordering of these steps is crucial to avoid races on MP machines.
|
|
*
|
|
* The Linux kernel defines several platform-specific hooks for TLB-shootdown. When
|
|
* unmapping a portion of the virtual address space, these hooks are called according to
|
|
* the following template:
|
|
*
|
|
* tlb <- tlb_gather_mmu(mm, start, end); // start unmap for address space MM
|
|
* {
|
|
* for each vma that needs a shootdown do {
|
|
* tlb_start_vma(tlb, vma);
|
|
* for each page-table-entry PTE that needs to be removed do {
|
|
* tlb_remove_tlb_entry(tlb, pte, address);
|
|
* if (pte refers to a normal page) {
|
|
* tlb_remove_page(tlb, page);
|
|
* }
|
|
* }
|
|
* tlb_end_vma(tlb, vma);
|
|
* }
|
|
* }
|
|
* tlb_finish_mmu(tlb, start, end); // finish unmap for address space MM
|
|
*/
|
|
#include <linux/mm.h>
|
|
#include <linux/pagemap.h>
|
|
#include <linux/swap.h>
|
|
|
|
#include <asm/pgalloc.h>
|
|
#include <asm/processor.h>
|
|
#include <asm/tlbflush.h>
|
|
#include <asm/machvec.h>
|
|
|
|
/*
|
|
* If we can't allocate a page to make a big batch of page pointers
|
|
* to work on, then just handle a few from the on-stack structure.
|
|
*/
|
|
#define IA64_GATHER_BUNDLE 8
|
|
|
|
struct mmu_gather {
|
|
struct mm_struct *mm;
|
|
unsigned int nr;
|
|
unsigned int max;
|
|
unsigned char fullmm; /* non-zero means full mm flush */
|
|
unsigned char need_flush; /* really unmapped some PTEs? */
|
|
unsigned long start, end;
|
|
unsigned long start_addr;
|
|
unsigned long end_addr;
|
|
struct page **pages;
|
|
struct page *local[IA64_GATHER_BUNDLE];
|
|
};
|
|
|
|
struct ia64_tr_entry {
|
|
u64 ifa;
|
|
u64 itir;
|
|
u64 pte;
|
|
u64 rr;
|
|
}; /*Record for tr entry!*/
|
|
|
|
extern int ia64_itr_entry(u64 target_mask, u64 va, u64 pte, u64 log_size);
|
|
extern void ia64_ptr_entry(u64 target_mask, int slot);
|
|
|
|
extern struct ia64_tr_entry *ia64_idtrs[NR_CPUS];
|
|
|
|
/*
|
|
region register macros
|
|
*/
|
|
#define RR_TO_VE(val) (((val) >> 0) & 0x0000000000000001)
|
|
#define RR_VE(val) (((val) & 0x0000000000000001) << 0)
|
|
#define RR_VE_MASK 0x0000000000000001L
|
|
#define RR_VE_SHIFT 0
|
|
#define RR_TO_PS(val) (((val) >> 2) & 0x000000000000003f)
|
|
#define RR_PS(val) (((val) & 0x000000000000003f) << 2)
|
|
#define RR_PS_MASK 0x00000000000000fcL
|
|
#define RR_PS_SHIFT 2
|
|
#define RR_RID_MASK 0x00000000ffffff00L
|
|
#define RR_TO_RID(val) ((val >> 8) & 0xffffff)
|
|
|
|
static inline void
|
|
ia64_tlb_flush_mmu_tlbonly(struct mmu_gather *tlb, unsigned long start, unsigned long end)
|
|
{
|
|
tlb->need_flush = 0;
|
|
|
|
if (tlb->fullmm) {
|
|
/*
|
|
* Tearing down the entire address space. This happens both as a result
|
|
* of exit() and execve(). The latter case necessitates the call to
|
|
* flush_tlb_mm() here.
|
|
*/
|
|
flush_tlb_mm(tlb->mm);
|
|
} else if (unlikely (end - start >= 1024*1024*1024*1024UL
|
|
|| REGION_NUMBER(start) != REGION_NUMBER(end - 1)))
|
|
{
|
|
/*
|
|
* If we flush more than a tera-byte or across regions, we're probably
|
|
* better off just flushing the entire TLB(s). This should be very rare
|
|
* and is not worth optimizing for.
|
|
*/
|
|
flush_tlb_all();
|
|
} else {
|
|
/*
|
|
* XXX fix me: flush_tlb_range() should take an mm pointer instead of a
|
|
* vma pointer.
|
|
*/
|
|
struct vm_area_struct vma;
|
|
|
|
vma.vm_mm = tlb->mm;
|
|
/* flush the address range from the tlb: */
|
|
flush_tlb_range(&vma, start, end);
|
|
/* now flush the virt. page-table area mapping the address range: */
|
|
flush_tlb_range(&vma, ia64_thash(start), ia64_thash(end));
|
|
}
|
|
|
|
}
|
|
|
|
static inline void
|
|
ia64_tlb_flush_mmu_free(struct mmu_gather *tlb)
|
|
{
|
|
unsigned long i;
|
|
unsigned int nr;
|
|
|
|
/* lastly, release the freed pages */
|
|
nr = tlb->nr;
|
|
|
|
tlb->nr = 0;
|
|
tlb->start_addr = ~0UL;
|
|
for (i = 0; i < nr; ++i)
|
|
free_page_and_swap_cache(tlb->pages[i]);
|
|
}
|
|
|
|
/*
|
|
* Flush the TLB for address range START to END and, if not in fast mode, release the
|
|
* freed pages that where gathered up to this point.
|
|
*/
|
|
static inline void
|
|
ia64_tlb_flush_mmu (struct mmu_gather *tlb, unsigned long start, unsigned long end)
|
|
{
|
|
if (!tlb->need_flush)
|
|
return;
|
|
ia64_tlb_flush_mmu_tlbonly(tlb, start, end);
|
|
ia64_tlb_flush_mmu_free(tlb);
|
|
}
|
|
|
|
static inline void __tlb_alloc_page(struct mmu_gather *tlb)
|
|
{
|
|
unsigned long addr = __get_free_pages(GFP_NOWAIT | __GFP_NOWARN, 0);
|
|
|
|
if (addr) {
|
|
tlb->pages = (void *)addr;
|
|
tlb->max = PAGE_SIZE / sizeof(void *);
|
|
}
|
|
}
|
|
|
|
|
|
static inline void
|
|
arch_tlb_gather_mmu(struct mmu_gather *tlb, struct mm_struct *mm,
|
|
unsigned long start, unsigned long end)
|
|
{
|
|
tlb->mm = mm;
|
|
tlb->max = ARRAY_SIZE(tlb->local);
|
|
tlb->pages = tlb->local;
|
|
tlb->nr = 0;
|
|
tlb->fullmm = !(start | (end+1));
|
|
tlb->start = start;
|
|
tlb->end = end;
|
|
tlb->start_addr = ~0UL;
|
|
}
|
|
|
|
/*
|
|
* Called at the end of the shootdown operation to free up any resources that were
|
|
* collected.
|
|
*/
|
|
static inline void
|
|
arch_tlb_finish_mmu(struct mmu_gather *tlb,
|
|
unsigned long start, unsigned long end, bool force)
|
|
{
|
|
if (force)
|
|
tlb->need_flush = 1;
|
|
/*
|
|
* Note: tlb->nr may be 0 at this point, so we can't rely on tlb->start_addr and
|
|
* tlb->end_addr.
|
|
*/
|
|
ia64_tlb_flush_mmu(tlb, start, end);
|
|
|
|
/* keep the page table cache within bounds */
|
|
check_pgt_cache();
|
|
|
|
if (tlb->pages != tlb->local)
|
|
free_pages((unsigned long)tlb->pages, 0);
|
|
}
|
|
|
|
/*
|
|
* Logically, this routine frees PAGE. On MP machines, the actual freeing of the page
|
|
* must be delayed until after the TLB has been flushed (see comments at the beginning of
|
|
* this file).
|
|
*/
|
|
static inline bool __tlb_remove_page(struct mmu_gather *tlb, struct page *page)
|
|
{
|
|
tlb->need_flush = 1;
|
|
|
|
if (!tlb->nr && tlb->pages == tlb->local)
|
|
__tlb_alloc_page(tlb);
|
|
|
|
tlb->pages[tlb->nr++] = page;
|
|
VM_WARN_ON(tlb->nr > tlb->max);
|
|
if (tlb->nr == tlb->max)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
static inline void tlb_flush_mmu_tlbonly(struct mmu_gather *tlb)
|
|
{
|
|
ia64_tlb_flush_mmu_tlbonly(tlb, tlb->start_addr, tlb->end_addr);
|
|
}
|
|
|
|
static inline void tlb_flush_mmu_free(struct mmu_gather *tlb)
|
|
{
|
|
ia64_tlb_flush_mmu_free(tlb);
|
|
}
|
|
|
|
static inline void tlb_flush_mmu(struct mmu_gather *tlb)
|
|
{
|
|
ia64_tlb_flush_mmu(tlb, tlb->start_addr, tlb->end_addr);
|
|
}
|
|
|
|
static inline void tlb_remove_page(struct mmu_gather *tlb, struct page *page)
|
|
{
|
|
if (__tlb_remove_page(tlb, page))
|
|
tlb_flush_mmu(tlb);
|
|
}
|
|
|
|
static inline bool __tlb_remove_page_size(struct mmu_gather *tlb,
|
|
struct page *page, int page_size)
|
|
{
|
|
return __tlb_remove_page(tlb, page);
|
|
}
|
|
|
|
static inline void tlb_remove_page_size(struct mmu_gather *tlb,
|
|
struct page *page, int page_size)
|
|
{
|
|
return tlb_remove_page(tlb, page);
|
|
}
|
|
|
|
/*
|
|
* Remove TLB entry for PTE mapped at virtual address ADDRESS. This is called for any
|
|
* PTE, not just those pointing to (normal) physical memory.
|
|
*/
|
|
static inline void
|
|
__tlb_remove_tlb_entry (struct mmu_gather *tlb, pte_t *ptep, unsigned long address)
|
|
{
|
|
if (tlb->start_addr == ~0UL)
|
|
tlb->start_addr = address;
|
|
tlb->end_addr = address + PAGE_SIZE;
|
|
}
|
|
|
|
#define tlb_migrate_finish(mm) platform_tlb_migrate_finish(mm)
|
|
|
|
#define tlb_start_vma(tlb, vma) do { } while (0)
|
|
#define tlb_end_vma(tlb, vma) do { } while (0)
|
|
|
|
#define tlb_remove_tlb_entry(tlb, ptep, addr) \
|
|
do { \
|
|
tlb->need_flush = 1; \
|
|
__tlb_remove_tlb_entry(tlb, ptep, addr); \
|
|
} while (0)
|
|
|
|
#define tlb_remove_huge_tlb_entry(h, tlb, ptep, address) \
|
|
tlb_remove_tlb_entry(tlb, ptep, address)
|
|
|
|
#define tlb_remove_check_page_size_change tlb_remove_check_page_size_change
|
|
static inline void tlb_remove_check_page_size_change(struct mmu_gather *tlb,
|
|
unsigned int page_size)
|
|
{
|
|
}
|
|
|
|
#define pte_free_tlb(tlb, ptep, address) \
|
|
do { \
|
|
tlb->need_flush = 1; \
|
|
__pte_free_tlb(tlb, ptep, address); \
|
|
} while (0)
|
|
|
|
#define pmd_free_tlb(tlb, ptep, address) \
|
|
do { \
|
|
tlb->need_flush = 1; \
|
|
__pmd_free_tlb(tlb, ptep, address); \
|
|
} while (0)
|
|
|
|
#define pud_free_tlb(tlb, pudp, address) \
|
|
do { \
|
|
tlb->need_flush = 1; \
|
|
__pud_free_tlb(tlb, pudp, address); \
|
|
} while (0)
|
|
|
|
#endif /* _ASM_IA64_TLB_H */
|