mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-26 10:49:33 +00:00
![Greg Kroah-Hartman](/assets/img/avatar_default.png)
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>
251 lines
7.1 KiB
C
251 lines
7.1 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _METAG_CACHEFLUSH_H
|
|
#define _METAG_CACHEFLUSH_H
|
|
|
|
#include <linux/mm.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/io.h>
|
|
|
|
#include <asm/l2cache.h>
|
|
#include <asm/metag_isa.h>
|
|
#include <asm/metag_mem.h>
|
|
|
|
void metag_cache_probe(void);
|
|
|
|
void metag_data_cache_flush_all(const void *start);
|
|
void metag_code_cache_flush_all(const void *start);
|
|
|
|
/*
|
|
* Routines to flush physical cache lines that may be used to cache data or code
|
|
* normally accessed via the linear address range supplied. The region flushed
|
|
* must either lie in local or global address space determined by the top bit of
|
|
* the pStart address. If Bytes is >= 4K then the whole of the related cache
|
|
* state will be flushed rather than a limited range.
|
|
*/
|
|
void metag_data_cache_flush(const void *start, int bytes);
|
|
void metag_code_cache_flush(const void *start, int bytes);
|
|
|
|
#ifdef CONFIG_METAG_META12
|
|
|
|
/* Write through, virtually tagged, split I/D cache. */
|
|
|
|
static inline void __flush_cache_all(void)
|
|
{
|
|
metag_code_cache_flush_all((void *) PAGE_OFFSET);
|
|
metag_data_cache_flush_all((void *) PAGE_OFFSET);
|
|
}
|
|
|
|
#define flush_cache_all() __flush_cache_all()
|
|
|
|
/* flush the entire user address space referenced in this mm structure */
|
|
static inline void flush_cache_mm(struct mm_struct *mm)
|
|
{
|
|
if (mm == current->mm)
|
|
__flush_cache_all();
|
|
}
|
|
|
|
#define flush_cache_dup_mm(mm) flush_cache_mm(mm)
|
|
|
|
/* flush a range of addresses from this mm */
|
|
static inline void flush_cache_range(struct vm_area_struct *vma,
|
|
unsigned long start, unsigned long end)
|
|
{
|
|
flush_cache_mm(vma->vm_mm);
|
|
}
|
|
|
|
static inline void flush_cache_page(struct vm_area_struct *vma,
|
|
unsigned long vmaddr, unsigned long pfn)
|
|
{
|
|
flush_cache_mm(vma->vm_mm);
|
|
}
|
|
|
|
#define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE 1
|
|
static inline void flush_dcache_page(struct page *page)
|
|
{
|
|
metag_data_cache_flush_all((void *) PAGE_OFFSET);
|
|
}
|
|
|
|
#define flush_dcache_mmap_lock(mapping) do { } while (0)
|
|
#define flush_dcache_mmap_unlock(mapping) do { } while (0)
|
|
|
|
static inline void flush_icache_page(struct vm_area_struct *vma,
|
|
struct page *page)
|
|
{
|
|
metag_code_cache_flush(page_to_virt(page), PAGE_SIZE);
|
|
}
|
|
|
|
static inline void flush_cache_vmap(unsigned long start, unsigned long end)
|
|
{
|
|
metag_data_cache_flush_all((void *) PAGE_OFFSET);
|
|
}
|
|
|
|
static inline void flush_cache_vunmap(unsigned long start, unsigned long end)
|
|
{
|
|
metag_data_cache_flush_all((void *) PAGE_OFFSET);
|
|
}
|
|
|
|
#else
|
|
|
|
/* Write through, physically tagged, split I/D cache. */
|
|
|
|
#define flush_cache_all() do { } while (0)
|
|
#define flush_cache_mm(mm) do { } while (0)
|
|
#define flush_cache_dup_mm(mm) do { } while (0)
|
|
#define flush_cache_range(vma, start, end) do { } while (0)
|
|
#define flush_cache_page(vma, vmaddr, pfn) do { } while (0)
|
|
#define flush_dcache_mmap_lock(mapping) do { } while (0)
|
|
#define flush_dcache_mmap_unlock(mapping) do { } while (0)
|
|
#define flush_icache_page(vma, pg) do { } while (0)
|
|
#define flush_cache_vmap(start, end) do { } while (0)
|
|
#define flush_cache_vunmap(start, end) do { } while (0)
|
|
|
|
#define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE 1
|
|
static inline void flush_dcache_page(struct page *page)
|
|
{
|
|
/* FIXME: We can do better than this. All we are trying to do is
|
|
* make the i-cache coherent, we should use the PG_arch_1 bit like
|
|
* e.g. powerpc.
|
|
*/
|
|
#ifdef CONFIG_SMP
|
|
metag_out32(1, SYSC_ICACHE_FLUSH);
|
|
#else
|
|
metag_code_cache_flush_all((void *) PAGE_OFFSET);
|
|
#endif
|
|
}
|
|
|
|
#endif
|
|
|
|
/* Push n pages at kernel virtual address and clear the icache */
|
|
static inline void flush_icache_range(unsigned long address,
|
|
unsigned long endaddr)
|
|
{
|
|
#ifdef CONFIG_SMP
|
|
metag_out32(1, SYSC_ICACHE_FLUSH);
|
|
#else
|
|
metag_code_cache_flush((void *) address, endaddr - address);
|
|
#endif
|
|
}
|
|
|
|
static inline void flush_cache_sigtramp(unsigned long addr, int size)
|
|
{
|
|
/*
|
|
* Flush the icache in case there was previously some code
|
|
* fetched from this address, perhaps a previous sigtramp.
|
|
*
|
|
* We don't need to flush the dcache, it's write through and
|
|
* we just wrote the sigtramp code through it.
|
|
*/
|
|
#ifdef CONFIG_SMP
|
|
metag_out32(1, SYSC_ICACHE_FLUSH);
|
|
#else
|
|
metag_code_cache_flush((void *) addr, size);
|
|
#endif
|
|
}
|
|
|
|
#ifdef CONFIG_METAG_L2C
|
|
|
|
/*
|
|
* Perform a single specific CACHEWD operation on an address, masking lower bits
|
|
* of address first.
|
|
*/
|
|
static inline void cachewd_line(void *addr, unsigned int data)
|
|
{
|
|
unsigned long masked = (unsigned long)addr & -0x40;
|
|
__builtin_meta2_cachewd((void *)masked, data);
|
|
}
|
|
|
|
/* Perform a certain CACHEW op on each cache line in a range */
|
|
static inline void cachew_region_op(void *start, unsigned long size,
|
|
unsigned int op)
|
|
{
|
|
unsigned long offset = (unsigned long)start & 0x3f;
|
|
int i;
|
|
if (offset) {
|
|
size += offset;
|
|
start -= offset;
|
|
}
|
|
i = (size - 1) >> 6;
|
|
do {
|
|
__builtin_meta2_cachewd(start, op);
|
|
start += 0x40;
|
|
} while (i--);
|
|
}
|
|
|
|
/* prevent write fence and flushbacks being reordered in L2 */
|
|
static inline void l2c_fence_flush(void *addr)
|
|
{
|
|
/*
|
|
* Synchronise by reading back and re-flushing.
|
|
* It is assumed this access will miss, as the caller should have just
|
|
* flushed the cache line.
|
|
*/
|
|
(void)(volatile u8 *)addr;
|
|
cachewd_line(addr, CACHEW_FLUSH_L1D_L2);
|
|
}
|
|
|
|
/* prevent write fence and writebacks being reordered in L2 */
|
|
static inline void l2c_fence(void *addr)
|
|
{
|
|
/*
|
|
* A write back has occurred, but not necessarily an invalidate, so the
|
|
* readback in l2c_fence_flush() would hit in the cache and have no
|
|
* effect. Therefore fully flush the line first.
|
|
*/
|
|
cachewd_line(addr, CACHEW_FLUSH_L1D_L2);
|
|
l2c_fence_flush(addr);
|
|
}
|
|
|
|
/* Used to keep memory consistent when doing DMA. */
|
|
static inline void flush_dcache_region(void *start, unsigned long size)
|
|
{
|
|
/* metag_data_cache_flush won't flush L2 cache lines if size >= 4096 */
|
|
if (meta_l2c_is_enabled()) {
|
|
cachew_region_op(start, size, CACHEW_FLUSH_L1D_L2);
|
|
if (meta_l2c_is_writeback())
|
|
l2c_fence_flush(start + size - 1);
|
|
} else {
|
|
metag_data_cache_flush(start, size);
|
|
}
|
|
}
|
|
|
|
/* Write back dirty lines to memory (or do nothing if no writeback caches) */
|
|
static inline void writeback_dcache_region(void *start, unsigned long size)
|
|
{
|
|
if (meta_l2c_is_enabled() && meta_l2c_is_writeback()) {
|
|
cachew_region_op(start, size, CACHEW_WRITEBACK_L1D_L2);
|
|
l2c_fence(start + size - 1);
|
|
}
|
|
}
|
|
|
|
/* Invalidate (may also write back if necessary) */
|
|
static inline void invalidate_dcache_region(void *start, unsigned long size)
|
|
{
|
|
if (meta_l2c_is_enabled())
|
|
cachew_region_op(start, size, CACHEW_INVALIDATE_L1D_L2);
|
|
else
|
|
metag_data_cache_flush(start, size);
|
|
}
|
|
#else
|
|
#define flush_dcache_region(s, l) metag_data_cache_flush((s), (l))
|
|
#define writeback_dcache_region(s, l) do {} while (0)
|
|
#define invalidate_dcache_region(s, l) flush_dcache_region((s), (l))
|
|
#endif
|
|
|
|
static inline void copy_to_user_page(struct vm_area_struct *vma,
|
|
struct page *page, unsigned long vaddr,
|
|
void *dst, const void *src,
|
|
unsigned long len)
|
|
{
|
|
memcpy(dst, src, len);
|
|
flush_icache_range((unsigned long)dst, (unsigned long)dst + len);
|
|
}
|
|
|
|
static inline void copy_from_user_page(struct vm_area_struct *vma,
|
|
struct page *page, unsigned long vaddr,
|
|
void *dst, const void *src,
|
|
unsigned long len)
|
|
{
|
|
memcpy(dst, src, len);
|
|
}
|
|
|
|
#endif /* _METAG_CACHEFLUSH_H */
|