License cleanup: add SPDX GPL-2.0 license identifier to files with no license
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>
2017-11-01 21:07:57 +07:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-17 05:20:36 +07:00
|
|
|
/*---------------------------------------------------------------------------+
|
|
|
|
| fpu_system.h |
|
|
|
|
| |
|
|
|
|
| Copyright (C) 1992,1994,1997 |
|
|
|
|
| W. Metzenthen, 22 Parker St, Ormond, Vic 3163, |
|
|
|
|
| Australia. E-mail billm@suburbia.net |
|
|
|
|
| |
|
|
|
|
+---------------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
#ifndef _FPU_SYSTEM_H
|
|
|
|
#define _FPU_SYSTEM_H
|
|
|
|
|
|
|
|
/* system dependent definitions */
|
|
|
|
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
|
2015-08-07 00:54:34 +07:00
|
|
|
#include <asm/desc.h>
|
|
|
|
#include <asm/mmu_context.h>
|
|
|
|
|
|
|
|
static inline struct desc_struct FPU_get_ldt_descriptor(unsigned seg)
|
|
|
|
{
|
|
|
|
static struct desc_struct zero_desc;
|
|
|
|
struct desc_struct ret = zero_desc;
|
|
|
|
|
|
|
|
#ifdef CONFIG_MODIFY_LDT_SYSCALL
|
|
|
|
seg >>= 3;
|
|
|
|
mutex_lock(¤t->mm->context.lock);
|
2017-06-07 00:31:16 +07:00
|
|
|
if (current->mm->context.ldt && seg < current->mm->context.ldt->nr_entries)
|
2015-08-07 00:54:34 +07:00
|
|
|
ret = current->mm->context.ldt->entries[seg];
|
|
|
|
mutex_unlock(¤t->mm->context.lock);
|
|
|
|
#endif
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-08-28 13:47:39 +07:00
|
|
|
#define SEG_TYPE_WRITABLE (1U << 1)
|
|
|
|
#define SEG_TYPE_EXPANDS_DOWN (1U << 2)
|
|
|
|
#define SEG_TYPE_EXECUTE (1U << 3)
|
|
|
|
#define SEG_TYPE_EXPAND_MASK (SEG_TYPE_EXPANDS_DOWN | SEG_TYPE_EXECUTE)
|
|
|
|
#define SEG_TYPE_EXECUTE_MASK (SEG_TYPE_WRITABLE | SEG_TYPE_EXECUTE)
|
|
|
|
|
|
|
|
static inline unsigned long seg_get_base(struct desc_struct *d)
|
|
|
|
{
|
|
|
|
unsigned long base = (unsigned long)d->base2 << 24;
|
|
|
|
|
|
|
|
return base | ((unsigned long)d->base1 << 16) | d->base0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long seg_get_limit(struct desc_struct *d)
|
|
|
|
{
|
2017-08-28 13:47:41 +07:00
|
|
|
return ((unsigned long)d->limit1 << 16) | d->limit0;
|
2017-08-28 13:47:39 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned long seg_get_granularity(struct desc_struct *d)
|
|
|
|
{
|
|
|
|
return d->g ? 4096 : 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool seg_expands_down(struct desc_struct *d)
|
|
|
|
{
|
|
|
|
return (d->type & SEG_TYPE_EXPAND_MASK) == SEG_TYPE_EXPANDS_DOWN;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool seg_execute_only(struct desc_struct *d)
|
|
|
|
{
|
|
|
|
return (d->type & SEG_TYPE_EXECUTE_MASK) == SEG_TYPE_EXECUTE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool seg_writable(struct desc_struct *d)
|
|
|
|
{
|
|
|
|
return (d->type & SEG_TYPE_EXECUTE_MASK) == SEG_TYPE_WRITABLE;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
x86/fpu: Simplify FPU handling by embedding the fpstate in task_struct (again)
So 6 years ago we made the FPU fpstate dynamically allocated:
aa283f49276e ("x86, fpu: lazy allocation of FPU area - v5")
61c4628b5386 ("x86, fpu: split FPU state from task struct - v5")
In hindsight this was a mistake:
- it complicated context allocation failure handling, such as:
/* kthread execs. TODO: cleanup this horror. */
if (WARN_ON(fpstate_alloc_init(fpu)))
force_sig(SIGKILL, tsk);
- it caused us to enable irqs in fpu__restore():
local_irq_enable();
/*
* does a slab alloc which can sleep
*/
if (fpstate_alloc_init(fpu)) {
/*
* ran out of memory!
*/
do_group_exit(SIGKILL);
return;
}
local_irq_disable();
- it (slightly) slowed down task creation/destruction by adding
slab allocation/free pattens.
- it made access to context contents (slightly) slower by adding
one more pointer dereference.
The motivation for the dynamic allocation was two-fold:
- reduce memory consumption by non-FPU tasks
- allocate and handle only the necessary amount of context for
various XSAVE processors that have varying hardware frame
sizes.
These days, with glibc using SSE memcpy by default and GCC optimizing
for SSE/AVX by default, the scope of FPU using apps on an x86 system is
much larger than it was 6 years ago.
For example on a freshly installed Fedora 21 desktop system, with a
recent kernel, all non-kthread tasks have used the FPU shortly after
bootup.
Also, even modern embedded x86 CPUs try to support the latest vector
instruction set - so they'll too often use the larger xstate frame
sizes.
So remove the dynamic allocation complication by embedding the FPU
fpstate in task_struct again. This should make the FPU a lot more
accessible to all sorts of atomic contexts.
We could still optimize for the xstate frame size in the future,
by moving the state structure to the last element of task_struct,
and allocating only a part of that.
This change is kept minimal by still keeping the ctx_alloc()/free()
routines (that now do nothing substantial) - we'll remove them in
the following patches.
Reviewed-by: Borislav Petkov <bp@alien8.de>
Cc: Andy Lutomirski <luto@amacapital.net>
Cc: Dave Hansen <dave.hansen@linux.intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2015-04-27 09:19:39 +07:00
|
|
|
#define I387 (¤t->thread.fpu.state)
|
2008-03-11 05:28:04 +07:00
|
|
|
#define FPU_info (I387->soft.info)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2009-02-09 20:17:39 +07:00
|
|
|
#define FPU_CS (*(unsigned short *) &(FPU_info->regs->cs))
|
|
|
|
#define FPU_SS (*(unsigned short *) &(FPU_info->regs->ss))
|
|
|
|
#define FPU_DS (*(unsigned short *) &(FPU_info->regs->ds))
|
|
|
|
#define FPU_EAX (FPU_info->regs->ax)
|
|
|
|
#define FPU_EFLAGS (FPU_info->regs->flags)
|
|
|
|
#define FPU_EIP (FPU_info->regs->ip)
|
2005-04-17 05:20:36 +07:00
|
|
|
#define FPU_ORIG_EIP (FPU_info->___orig_eip)
|
|
|
|
|
2008-03-11 05:28:04 +07:00
|
|
|
#define FPU_lookahead (I387->soft.lookahead)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* nz if ip_offset and cs_selector are not to be set for the current
|
|
|
|
instruction. */
|
2008-03-11 05:28:04 +07:00
|
|
|
#define no_ip_update (*(u_char *)&(I387->soft.no_update))
|
|
|
|
#define FPU_rm (*(u_char *)&(I387->soft.rm))
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* Number of bytes of data which can be legally accessed by the current
|
|
|
|
instruction. This only needs to hold a number <= 108, so a byte will do. */
|
2008-03-11 05:28:04 +07:00
|
|
|
#define access_limit (*(u_char *)&(I387->soft.alimit))
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-03-11 05:28:04 +07:00
|
|
|
#define partial_status (I387->soft.swd)
|
|
|
|
#define control_word (I387->soft.cwd)
|
|
|
|
#define fpu_tag_word (I387->soft.twd)
|
|
|
|
#define registers (I387->soft.st_space)
|
|
|
|
#define top (I387->soft.ftop)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2008-03-11 05:28:04 +07:00
|
|
|
#define instruction_address (*(struct address *)&I387->soft.fip)
|
|
|
|
#define operand_address (*(struct address *)&I387->soft.foo)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
#define FPU_access_ok(x,y,z) if ( !access_ok(x,y,z) ) \
|
|
|
|
math_abort(FPU_info,SIGSEGV)
|
2006-12-07 08:14:00 +07:00
|
|
|
#define FPU_abort math_abort(FPU_info, SIGSEGV)
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
#undef FPU_IGNORE_CODE_SEGV
|
|
|
|
#ifdef FPU_IGNORE_CODE_SEGV
|
|
|
|
/* access_ok() is very expensive, and causes the emulator to run
|
|
|
|
about 20% slower if applied to the code. Anyway, errors due to bad
|
|
|
|
code addresses should be much rarer than errors due to bad data
|
|
|
|
addresses. */
|
|
|
|
#define FPU_code_access_ok(z)
|
|
|
|
#else
|
|
|
|
/* A simpler test than access_ok() can probably be done for
|
|
|
|
FPU_code_access_ok() because the only possible error is to step
|
|
|
|
past the upper boundary of a legal code area. */
|
|
|
|
#define FPU_code_access_ok(z) FPU_access_ok(VERIFY_READ,(void __user *)FPU_EIP,z)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define FPU_get_user(x,y) get_user((x),(y))
|
|
|
|
#define FPU_put_user(x,y) put_user((x),(y))
|
|
|
|
|
|
|
|
#endif
|