mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-27 01:25:35 +07: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>
201 lines
5.3 KiB
C
201 lines
5.3 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _ASM_IA64_MMU_CONTEXT_H
|
|
#define _ASM_IA64_MMU_CONTEXT_H
|
|
|
|
/*
|
|
* Copyright (C) 1998-2002 Hewlett-Packard Co
|
|
* David Mosberger-Tang <davidm@hpl.hp.com>
|
|
*/
|
|
|
|
/*
|
|
* Routines to manage the allocation of task context numbers. Task context
|
|
* numbers are used to reduce or eliminate the need to perform TLB flushes
|
|
* due to context switches. Context numbers are implemented using ia-64
|
|
* region ids. Since the IA-64 TLB does not consider the region number when
|
|
* performing a TLB lookup, we need to assign a unique region id to each
|
|
* region in a process. We use the least significant three bits in aregion
|
|
* id for this purpose.
|
|
*/
|
|
|
|
#define IA64_REGION_ID_KERNEL 0 /* the kernel's region id (tlb.c depends on this being 0) */
|
|
|
|
#define ia64_rid(ctx,addr) (((ctx) << 3) | (addr >> 61))
|
|
|
|
# include <asm/page.h>
|
|
# ifndef __ASSEMBLY__
|
|
|
|
#include <linux/compiler.h>
|
|
#include <linux/percpu.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/mm_types.h>
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <asm/processor.h>
|
|
#include <asm-generic/mm_hooks.h>
|
|
|
|
struct ia64_ctx {
|
|
spinlock_t lock;
|
|
unsigned int next; /* next context number to use */
|
|
unsigned int limit; /* available free range */
|
|
unsigned int max_ctx; /* max. context value supported by all CPUs */
|
|
/* call wrap_mmu_context when next >= max */
|
|
unsigned long *bitmap; /* bitmap size is max_ctx+1 */
|
|
unsigned long *flushmap;/* pending rid to be flushed */
|
|
};
|
|
|
|
extern struct ia64_ctx ia64_ctx;
|
|
DECLARE_PER_CPU(u8, ia64_need_tlb_flush);
|
|
|
|
extern void mmu_context_init (void);
|
|
extern void wrap_mmu_context (struct mm_struct *mm);
|
|
|
|
static inline void
|
|
enter_lazy_tlb (struct mm_struct *mm, struct task_struct *tsk)
|
|
{
|
|
}
|
|
|
|
/*
|
|
* When the context counter wraps around all TLBs need to be flushed because
|
|
* an old context number might have been reused. This is signalled by the
|
|
* ia64_need_tlb_flush per-CPU variable, which is checked in the routine
|
|
* below. Called by activate_mm(). <efocht@ess.nec.de>
|
|
*/
|
|
static inline void
|
|
delayed_tlb_flush (void)
|
|
{
|
|
extern void local_flush_tlb_all (void);
|
|
unsigned long flags;
|
|
|
|
if (unlikely(__ia64_per_cpu_var(ia64_need_tlb_flush))) {
|
|
spin_lock_irqsave(&ia64_ctx.lock, flags);
|
|
if (__ia64_per_cpu_var(ia64_need_tlb_flush)) {
|
|
local_flush_tlb_all();
|
|
__ia64_per_cpu_var(ia64_need_tlb_flush) = 0;
|
|
}
|
|
spin_unlock_irqrestore(&ia64_ctx.lock, flags);
|
|
}
|
|
}
|
|
|
|
static inline nv_mm_context_t
|
|
get_mmu_context (struct mm_struct *mm)
|
|
{
|
|
unsigned long flags;
|
|
nv_mm_context_t context = mm->context;
|
|
|
|
if (likely(context))
|
|
goto out;
|
|
|
|
spin_lock_irqsave(&ia64_ctx.lock, flags);
|
|
/* re-check, now that we've got the lock: */
|
|
context = mm->context;
|
|
if (context == 0) {
|
|
cpumask_clear(mm_cpumask(mm));
|
|
if (ia64_ctx.next >= ia64_ctx.limit) {
|
|
ia64_ctx.next = find_next_zero_bit(ia64_ctx.bitmap,
|
|
ia64_ctx.max_ctx, ia64_ctx.next);
|
|
ia64_ctx.limit = find_next_bit(ia64_ctx.bitmap,
|
|
ia64_ctx.max_ctx, ia64_ctx.next);
|
|
if (ia64_ctx.next >= ia64_ctx.max_ctx)
|
|
wrap_mmu_context(mm);
|
|
}
|
|
mm->context = context = ia64_ctx.next++;
|
|
__set_bit(context, ia64_ctx.bitmap);
|
|
}
|
|
spin_unlock_irqrestore(&ia64_ctx.lock, flags);
|
|
out:
|
|
/*
|
|
* Ensure we're not starting to use "context" before any old
|
|
* uses of it are gone from our TLB.
|
|
*/
|
|
delayed_tlb_flush();
|
|
|
|
return context;
|
|
}
|
|
|
|
/*
|
|
* Initialize context number to some sane value. MM is guaranteed to be a
|
|
* brand-new address-space, so no TLB flushing is needed, ever.
|
|
*/
|
|
static inline int
|
|
init_new_context (struct task_struct *p, struct mm_struct *mm)
|
|
{
|
|
mm->context = 0;
|
|
return 0;
|
|
}
|
|
|
|
static inline void
|
|
destroy_context (struct mm_struct *mm)
|
|
{
|
|
/* Nothing to do. */
|
|
}
|
|
|
|
static inline void
|
|
reload_context (nv_mm_context_t context)
|
|
{
|
|
unsigned long rid;
|
|
unsigned long rid_incr = 0;
|
|
unsigned long rr0, rr1, rr2, rr3, rr4, old_rr4;
|
|
|
|
old_rr4 = ia64_get_rr(RGN_BASE(RGN_HPAGE));
|
|
rid = context << 3; /* make space for encoding the region number */
|
|
rid_incr = 1 << 8;
|
|
|
|
/* encode the region id, preferred page size, and VHPT enable bit: */
|
|
rr0 = (rid << 8) | (PAGE_SHIFT << 2) | 1;
|
|
rr1 = rr0 + 1*rid_incr;
|
|
rr2 = rr0 + 2*rid_incr;
|
|
rr3 = rr0 + 3*rid_incr;
|
|
rr4 = rr0 + 4*rid_incr;
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
rr4 = (rr4 & (~(0xfcUL))) | (old_rr4 & 0xfc);
|
|
|
|
# if RGN_HPAGE != 4
|
|
# error "reload_context assumes RGN_HPAGE is 4"
|
|
# endif
|
|
#endif
|
|
|
|
ia64_set_rr0_to_rr4(rr0, rr1, rr2, rr3, rr4);
|
|
ia64_srlz_i(); /* srlz.i implies srlz.d */
|
|
}
|
|
|
|
/*
|
|
* Must be called with preemption off
|
|
*/
|
|
static inline void
|
|
activate_context (struct mm_struct *mm)
|
|
{
|
|
nv_mm_context_t context;
|
|
|
|
do {
|
|
context = get_mmu_context(mm);
|
|
if (!cpumask_test_cpu(smp_processor_id(), mm_cpumask(mm)))
|
|
cpumask_set_cpu(smp_processor_id(), mm_cpumask(mm));
|
|
reload_context(context);
|
|
/*
|
|
* in the unlikely event of a TLB-flush by another thread,
|
|
* redo the load.
|
|
*/
|
|
} while (unlikely(context != mm->context));
|
|
}
|
|
|
|
#define deactivate_mm(tsk,mm) do { } while (0)
|
|
|
|
/*
|
|
* Switch from address space PREV to address space NEXT.
|
|
*/
|
|
static inline void
|
|
activate_mm (struct mm_struct *prev, struct mm_struct *next)
|
|
{
|
|
/*
|
|
* We may get interrupts here, but that's OK because interrupt
|
|
* handlers cannot touch user-space.
|
|
*/
|
|
ia64_set_kr(IA64_KR_PT_BASE, __pa(next->pgd));
|
|
activate_context(next);
|
|
}
|
|
|
|
#define switch_mm(prev_mm,next_mm,next_task) activate_mm(prev_mm, next_mm)
|
|
|
|
# endif /* ! __ASSEMBLY__ */
|
|
#endif /* _ASM_IA64_MMU_CONTEXT_H */
|