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 */
|
2008-10-23 12:26:29 +07:00
|
|
|
#ifndef _ASM_X86_DESC_H
|
|
|
|
#define _ASM_X86_DESC_H
|
2008-01-30 19:31:13 +07:00
|
|
|
|
|
|
|
#include <asm/desc_defs.h>
|
|
|
|
#include <asm/ldt.h>
|
2008-01-30 19:31:14 +07:00
|
|
|
#include <asm/mmu.h>
|
2017-03-15 00:05:07 +07:00
|
|
|
#include <asm/fixmap.h>
|
2017-08-28 13:47:18 +07:00
|
|
|
#include <asm/irq_vectors.h>
|
2017-12-21 00:51:31 +07:00
|
|
|
#include <asm/cpu_entry_area.h>
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
#include <linux/smp.h>
|
2012-05-11 14:35:27 +07:00
|
|
|
#include <linux/percpu.h>
|
2008-01-30 19:31:13 +07:00
|
|
|
|
2011-05-27 14:29:32 +07:00
|
|
|
static inline void fill_ldt(struct desc_struct *desc, const struct user_desc *info)
|
|
|
|
{
|
|
|
|
desc->limit0 = info->limit & 0x0ffff;
|
|
|
|
|
|
|
|
desc->base0 = (info->base_addr & 0x0000ffff);
|
|
|
|
desc->base1 = (info->base_addr & 0x00ff0000) >> 16;
|
|
|
|
|
|
|
|
desc->type = (info->read_exec_only ^ 1) << 1;
|
|
|
|
desc->type |= info->contents << 2;
|
2017-12-16 02:35:11 +07:00
|
|
|
/* Set the ACCESS bit so it can be mapped RO */
|
|
|
|
desc->type |= 1;
|
2011-05-27 14:29:32 +07:00
|
|
|
|
|
|
|
desc->s = 1;
|
|
|
|
desc->dpl = 0x3;
|
|
|
|
desc->p = info->seg_not_present ^ 1;
|
2017-08-28 13:47:41 +07:00
|
|
|
desc->limit1 = (info->limit & 0xf0000) >> 16;
|
2011-05-27 14:29:32 +07:00
|
|
|
desc->avl = info->useable;
|
|
|
|
desc->d = info->seg_32bit;
|
|
|
|
desc->g = info->limit_in_pages;
|
|
|
|
|
|
|
|
desc->base2 = (info->base_addr & 0xff000000) >> 24;
|
2008-07-27 22:42:32 +07:00
|
|
|
/*
|
2011-08-03 20:31:53 +07:00
|
|
|
* Don't allow setting of the lm bit. It would confuse
|
|
|
|
* user_64bit_mode and would get overridden by sysret anyway.
|
2008-07-27 22:42:32 +07:00
|
|
|
*/
|
2011-05-27 14:29:32 +07:00
|
|
|
desc->l = 0;
|
2008-01-30 19:31:13 +07:00
|
|
|
}
|
|
|
|
|
2008-05-29 06:19:53 +07:00
|
|
|
struct gdt_page {
|
|
|
|
struct desc_struct gdt[GDT_ENTRIES];
|
|
|
|
} __attribute__((aligned(PAGE_SIZE)));
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2009-04-22 05:00:24 +07:00
|
|
|
DECLARE_PER_CPU_PAGE_ALIGNED(struct gdt_page, gdt_page);
|
2008-05-29 06:19:53 +07:00
|
|
|
|
2017-03-15 00:05:07 +07:00
|
|
|
/* Provide the original GDT */
|
|
|
|
static inline struct desc_struct *get_cpu_gdt_rw(unsigned int cpu)
|
2008-05-29 06:19:53 +07:00
|
|
|
{
|
|
|
|
return per_cpu(gdt_page, cpu).gdt;
|
|
|
|
}
|
|
|
|
|
2017-03-15 00:05:07 +07:00
|
|
|
/* Provide the current original GDT */
|
|
|
|
static inline struct desc_struct *get_current_gdt_rw(void)
|
|
|
|
{
|
|
|
|
return this_cpu_ptr(&gdt_page)->gdt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Provide the fixmap address of the remapped GDT */
|
|
|
|
static inline struct desc_struct *get_cpu_gdt_ro(int cpu)
|
|
|
|
{
|
2017-12-04 21:07:15 +07:00
|
|
|
return (struct desc_struct *)&get_cpu_entry_area(cpu)->gdt;
|
2017-03-15 00:05:07 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Provide the current read-only GDT */
|
|
|
|
static inline struct desc_struct *get_current_gdt_ro(void)
|
|
|
|
{
|
|
|
|
return get_cpu_gdt_ro(smp_processor_id());
|
|
|
|
}
|
|
|
|
|
2017-03-23 04:32:30 +07:00
|
|
|
/* Provide the physical address of the GDT page. */
|
|
|
|
static inline phys_addr_t get_cpu_gdt_paddr(unsigned int cpu)
|
|
|
|
{
|
|
|
|
return per_cpu_ptr_to_phys(get_cpu_gdt_rw(cpu));
|
|
|
|
}
|
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
static inline void pack_gate(gate_desc *gate, unsigned type, unsigned long func,
|
|
|
|
unsigned dpl, unsigned ist, unsigned seg)
|
|
|
|
{
|
2017-08-28 13:47:37 +07:00
|
|
|
gate->offset_low = (u16) func;
|
|
|
|
gate->bits.p = 1;
|
|
|
|
gate->bits.dpl = dpl;
|
|
|
|
gate->bits.zero = 0;
|
|
|
|
gate->bits.type = type;
|
|
|
|
gate->offset_middle = (u16) (func >> 16);
|
|
|
|
#ifdef CONFIG_X86_64
|
2011-05-27 14:29:32 +07:00
|
|
|
gate->segment = __KERNEL_CS;
|
2017-08-28 13:47:37 +07:00
|
|
|
gate->bits.ist = ist;
|
|
|
|
gate->reserved = 0;
|
|
|
|
gate->offset_high = (u32) (func >> 32);
|
2008-01-30 19:31:14 +07:00
|
|
|
#else
|
2017-08-28 13:47:37 +07:00
|
|
|
gate->segment = seg;
|
|
|
|
gate->bits.ist = 0;
|
2008-01-30 19:31:14 +07:00
|
|
|
#endif
|
2017-08-28 13:47:37 +07:00
|
|
|
}
|
2008-01-30 19:31:14 +07:00
|
|
|
|
2008-01-30 19:31:27 +07:00
|
|
|
static inline int desc_empty(const void *ptr)
|
|
|
|
{
|
|
|
|
const u32 *desc = ptr;
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2008-01-30 19:31:27 +07:00
|
|
|
return !(desc[0] | desc[1]);
|
|
|
|
}
|
|
|
|
|
2018-08-28 14:40:23 +07:00
|
|
|
#ifdef CONFIG_PARAVIRT_XXL
|
2008-01-30 19:31:14 +07:00
|
|
|
#include <asm/paravirt.h>
|
|
|
|
#else
|
2011-05-27 14:29:32 +07:00
|
|
|
#define load_TR_desc() native_load_tr_desc()
|
|
|
|
#define load_gdt(dtr) native_load_gdt(dtr)
|
|
|
|
#define load_idt(dtr) native_load_idt(dtr)
|
|
|
|
#define load_tr(tr) asm volatile("ltr %0"::"m" (tr))
|
|
|
|
#define load_ldt(ldt) asm volatile("lldt %0"::"m" (ldt))
|
|
|
|
|
|
|
|
#define store_gdt(dtr) native_store_gdt(dtr)
|
|
|
|
#define store_tr(tr) (tr = native_store_tr())
|
|
|
|
|
|
|
|
#define load_TLS(t, cpu) native_load_tls(t, cpu)
|
|
|
|
#define set_ldt native_set_ldt
|
|
|
|
|
|
|
|
#define write_ldt_entry(dt, entry, desc) native_write_ldt_entry(dt, entry, desc)
|
|
|
|
#define write_gdt_entry(dt, entry, desc, type) native_write_gdt_entry(dt, entry, desc, type)
|
|
|
|
#define write_idt_entry(dt, entry, g) native_write_idt_entry(dt, entry, g)
|
2008-07-24 04:21:18 +07:00
|
|
|
|
|
|
|
static inline void paravirt_alloc_ldt(struct desc_struct *ldt, unsigned entries)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void paravirt_free_ldt(struct desc_struct *ldt, unsigned entries)
|
|
|
|
{
|
|
|
|
}
|
2018-08-28 14:40:23 +07:00
|
|
|
#endif /* CONFIG_PARAVIRT_XXL */
|
2008-01-30 19:31:14 +07:00
|
|
|
|
2009-03-11 20:43:49 +07:00
|
|
|
#define store_ldt(ldt) asm("sldt %0" : "=m"(ldt))
|
|
|
|
|
2011-05-27 14:29:32 +07:00
|
|
|
static inline void native_write_idt_entry(gate_desc *idt, int entry, const gate_desc *gate)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
|
|
|
memcpy(&idt[entry], gate, sizeof(*gate));
|
|
|
|
}
|
|
|
|
|
2011-05-27 14:29:32 +07:00
|
|
|
static inline void native_write_ldt_entry(struct desc_struct *ldt, int entry, const void *desc)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
|
|
|
memcpy(&ldt[entry], desc, 8);
|
|
|
|
}
|
|
|
|
|
2011-05-27 14:29:32 +07:00
|
|
|
static inline void
|
|
|
|
native_write_gdt_entry(struct desc_struct *gdt, int entry, const void *desc, int type)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
|
|
|
unsigned int size;
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
switch (type) {
|
2011-05-27 14:29:32 +07:00
|
|
|
case DESC_TSS: size = sizeof(tss_desc); break;
|
|
|
|
case DESC_LDT: size = sizeof(ldt_desc); break;
|
|
|
|
default: size = sizeof(*gdt); break;
|
2008-01-30 19:31:14 +07:00
|
|
|
}
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
memcpy(&gdt[entry], desc, size);
|
|
|
|
}
|
|
|
|
|
2017-08-28 13:47:37 +07:00
|
|
|
static inline void set_tssldt_descriptor(void *d, unsigned long addr,
|
|
|
|
unsigned type, unsigned size)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
2017-08-28 13:47:42 +07:00
|
|
|
struct ldttss_desc *desc = d;
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2008-01-30 19:31:20 +07:00
|
|
|
memset(desc, 0, sizeof(*desc));
|
2011-05-27 14:29:32 +07:00
|
|
|
|
2017-08-28 13:47:42 +07:00
|
|
|
desc->limit0 = (u16) size;
|
2017-08-28 13:47:37 +07:00
|
|
|
desc->base0 = (u16) addr;
|
|
|
|
desc->base1 = (addr >> 16) & 0xFF;
|
2011-05-27 14:29:32 +07:00
|
|
|
desc->type = type;
|
|
|
|
desc->p = 1;
|
|
|
|
desc->limit1 = (size >> 16) & 0xF;
|
2017-08-28 13:47:37 +07:00
|
|
|
desc->base2 = (addr >> 24) & 0xFF;
|
2017-08-28 13:47:42 +07:00
|
|
|
#ifdef CONFIG_X86_64
|
2017-08-28 13:47:37 +07:00
|
|
|
desc->base3 = (u32) (addr >> 32);
|
2008-01-30 19:31:14 +07:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2017-12-04 21:07:17 +07:00
|
|
|
static inline void __set_tss_desc(unsigned cpu, unsigned int entry, struct x86_hw_tss *addr)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
2017-03-15 00:05:07 +07:00
|
|
|
struct desc_struct *d = get_cpu_gdt_rw(cpu);
|
2008-01-30 19:31:14 +07:00
|
|
|
tss_desc tss;
|
|
|
|
|
2008-01-30 19:31:20 +07:00
|
|
|
set_tssldt_descriptor(&tss, (unsigned long)addr, DESC_TSS,
|
2017-02-20 23:56:09 +07:00
|
|
|
__KERNEL_TSS_LIMIT);
|
2008-01-30 19:31:14 +07:00
|
|
|
write_gdt_entry(d, entry, &tss, DESC_TSS);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define set_tss_desc(cpu, addr) __set_tss_desc(cpu, GDT_ENTRY_TSS, addr)
|
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
static inline void native_set_ldt(const void *addr, unsigned int entries)
|
|
|
|
{
|
|
|
|
if (likely(entries == 0))
|
2008-03-23 15:01:58 +07:00
|
|
|
asm volatile("lldt %w0"::"q" (0));
|
2008-01-30 19:31:14 +07:00
|
|
|
else {
|
|
|
|
unsigned cpu = smp_processor_id();
|
|
|
|
ldt_desc ldt;
|
|
|
|
|
2008-07-11 23:04:46 +07:00
|
|
|
set_tssldt_descriptor(&ldt, (unsigned long)addr, DESC_LDT,
|
|
|
|
entries * LDT_ENTRY_SIZE - 1);
|
2017-03-15 00:05:07 +07:00
|
|
|
write_gdt_entry(get_cpu_gdt_rw(cpu), GDT_ENTRY_LDT,
|
2008-01-30 19:31:14 +07:00
|
|
|
&ldt, DESC_LDT);
|
2008-03-23 15:01:58 +07:00
|
|
|
asm volatile("lldt %w0"::"q" (GDT_ENTRY_LDT*8));
|
2008-01-30 19:31:14 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-15 00:05:08 +07:00
|
|
|
static inline void native_load_gdt(const struct desc_ptr *dtr)
|
|
|
|
{
|
|
|
|
asm volatile("lgdt %0"::"m" (*dtr));
|
|
|
|
}
|
|
|
|
|
2020-04-06 20:55:06 +07:00
|
|
|
static __always_inline void native_load_idt(const struct desc_ptr *dtr)
|
2017-03-15 00:05:08 +07:00
|
|
|
{
|
|
|
|
asm volatile("lidt %0"::"m" (*dtr));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_store_gdt(struct desc_ptr *dtr)
|
|
|
|
{
|
|
|
|
asm volatile("sgdt %0":"=m" (*dtr));
|
|
|
|
}
|
|
|
|
|
2017-09-04 17:25:27 +07:00
|
|
|
static inline void store_idt(struct desc_ptr *dtr)
|
2017-03-15 00:05:08 +07:00
|
|
|
{
|
|
|
|
asm volatile("sidt %0":"=m" (*dtr));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The LTR instruction marks the TSS GDT entry as busy. On 64-bit, the GDT is
|
|
|
|
* a read-only remapping. To prevent a page fault, the GDT is switched to the
|
|
|
|
* original writeable version when needed.
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_X86_64
|
2008-01-30 19:31:14 +07:00
|
|
|
static inline void native_load_tr_desc(void)
|
|
|
|
{
|
2017-03-15 00:05:08 +07:00
|
|
|
struct desc_ptr gdt;
|
|
|
|
int cpu = raw_smp_processor_id();
|
|
|
|
bool restore = 0;
|
|
|
|
struct desc_struct *fixmap_gdt;
|
|
|
|
|
|
|
|
native_store_gdt(&gdt);
|
|
|
|
fixmap_gdt = get_cpu_gdt_ro(cpu);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the current GDT is the read-only fixmap, swap to the original
|
|
|
|
* writeable version. Swap back at the end.
|
|
|
|
*/
|
|
|
|
if (gdt.address == (unsigned long)fixmap_gdt) {
|
|
|
|
load_direct_gdt(cpu);
|
|
|
|
restore = 1;
|
|
|
|
}
|
2008-01-30 19:31:14 +07:00
|
|
|
asm volatile("ltr %w0"::"q" (GDT_ENTRY_TSS*8));
|
2017-03-15 00:05:08 +07:00
|
|
|
if (restore)
|
|
|
|
load_fixmap_gdt(cpu);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static inline void native_load_tr_desc(void)
|
|
|
|
{
|
|
|
|
asm volatile("ltr %w0"::"q" (GDT_ENTRY_TSS*8));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static inline unsigned long native_store_tr(void)
|
|
|
|
{
|
|
|
|
unsigned long tr;
|
|
|
|
|
|
|
|
asm volatile("str %0":"=r" (tr));
|
|
|
|
|
|
|
|
return tr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void native_load_tls(struct thread_struct *t, unsigned int cpu)
|
|
|
|
{
|
|
|
|
struct desc_struct *gdt = get_cpu_gdt_rw(cpu);
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for (i = 0; i < GDT_ENTRY_TLS_ENTRIES; i++)
|
|
|
|
gdt[GDT_ENTRY_TLS_MIN + i] = t->tls_array[i];
|
2008-01-30 19:31:14 +07:00
|
|
|
}
|
|
|
|
|
2017-02-22 22:36:16 +07:00
|
|
|
DECLARE_PER_CPU(bool, __tss_limit_invalid);
|
|
|
|
|
2017-02-20 23:56:14 +07:00
|
|
|
static inline void force_reload_TR(void)
|
|
|
|
{
|
2017-03-15 00:05:07 +07:00
|
|
|
struct desc_struct *d = get_current_gdt_rw();
|
2017-02-20 23:56:14 +07:00
|
|
|
tss_desc tss;
|
|
|
|
|
|
|
|
memcpy(&tss, &d[GDT_ENTRY_TSS], sizeof(tss_desc));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* LTR requires an available TSS, and the TSS is currently
|
|
|
|
* busy. Make it be available so that LTR will work.
|
|
|
|
*/
|
|
|
|
tss.type = DESC_TSS;
|
|
|
|
write_gdt_entry(d, GDT_ENTRY_TSS, &tss, DESC_TSS);
|
|
|
|
|
|
|
|
load_TR_desc();
|
2017-02-22 22:36:16 +07:00
|
|
|
this_cpu_write(__tss_limit_invalid, false);
|
2017-02-20 23:56:14 +07:00
|
|
|
}
|
|
|
|
|
2017-02-22 22:36:16 +07:00
|
|
|
/*
|
|
|
|
* Call this if you need the TSS limit to be correct, which should be the case
|
|
|
|
* if and only if you have TIF_IO_BITMAP set or you're switching to a task
|
|
|
|
* with TIF_IO_BITMAP set.
|
|
|
|
*/
|
|
|
|
static inline void refresh_tss_limit(void)
|
2017-02-20 23:56:14 +07:00
|
|
|
{
|
|
|
|
DEBUG_LOCKS_WARN_ON(preemptible());
|
|
|
|
|
2017-02-22 22:36:16 +07:00
|
|
|
if (unlikely(this_cpu_read(__tss_limit_invalid)))
|
2017-02-20 23:56:14 +07:00
|
|
|
force_reload_TR();
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If you do something evil that corrupts the cached TSS limit (I'm looking
|
|
|
|
* at you, VMX exits), call this function.
|
|
|
|
*
|
|
|
|
* The optimization here is that the TSS limit only matters for Linux if the
|
|
|
|
* IO bitmap is in use. If the TSS limit gets forced to its minimum value,
|
|
|
|
* everything works except that IO bitmap will be ignored and all CPL 3 IO
|
|
|
|
* instructions will #GP, which is exactly what we want for normal tasks.
|
|
|
|
*/
|
|
|
|
static inline void invalidate_tss_limit(void)
|
|
|
|
{
|
|
|
|
DEBUG_LOCKS_WARN_ON(preemptible());
|
|
|
|
|
|
|
|
if (unlikely(test_thread_flag(TIF_IO_BITMAP)))
|
|
|
|
force_reload_TR();
|
|
|
|
else
|
2017-02-22 22:36:16 +07:00
|
|
|
this_cpu_write(__tss_limit_invalid, true);
|
2017-02-20 23:56:14 +07:00
|
|
|
}
|
|
|
|
|
2015-01-23 02:27:58 +07:00
|
|
|
/* This intentionally ignores lm, since 32-bit apps don't have that field. */
|
|
|
|
#define LDT_empty(info) \
|
2008-03-23 15:01:58 +07:00
|
|
|
((info)->base_addr == 0 && \
|
|
|
|
(info)->limit == 0 && \
|
|
|
|
(info)->contents == 0 && \
|
|
|
|
(info)->read_exec_only == 1 && \
|
|
|
|
(info)->seg_32bit == 0 && \
|
|
|
|
(info)->limit_in_pages == 0 && \
|
|
|
|
(info)->seg_not_present == 1 && \
|
|
|
|
(info)->useable == 0)
|
2008-01-30 19:31:14 +07:00
|
|
|
|
x86, tls: Interpret an all-zero struct user_desc as "no segment"
The Witcher 2 did something like this to allocate a TLS segment index:
struct user_desc u_info;
bzero(&u_info, sizeof(u_info));
u_info.entry_number = (uint32_t)-1;
syscall(SYS_set_thread_area, &u_info);
Strictly speaking, this code was never correct. It should have set
read_exec_only and seg_not_present to 1 to indicate that it wanted
to find a free slot without putting anything there, or it should
have put something sensible in the TLS slot if it wanted to allocate
a TLS entry for real. The actual effect of this code was to
allocate a bogus segment that could be used to exploit espfix.
The set_thread_area hardening patches changed the behavior, causing
set_thread_area to return -EINVAL and crashing the game.
This changes set_thread_area to interpret this as a request to find
a free slot and to leave it empty, which isn't *quite* what the game
expects but should be close enough to keep it working. In
particular, using the code above to allocate two segments will
allocate the same segment both times.
According to FrostbittenKing on Github, this fixes The Witcher 2.
If this somehow still causes problems, we could instead allocate
a limit==0 32-bit data segment, but that seems rather ugly to me.
Fixes: 41bdc78544b8 x86/tls: Validate TLS entries to protect espfix
Signed-off-by: Andy Lutomirski <luto@amacapital.net>
Cc: stable@vger.kernel.org
Cc: torvalds@linux-foundation.org
Link: http://lkml.kernel.org/r/0cb251abe1ff0958b8e468a9a9a905b80ae3a746.1421954363.git.luto@amacapital.net
Signed-off-by: Thomas Gleixner <tglx@linutronix.de>
2015-01-23 02:27:59 +07:00
|
|
|
/* Lots of programs expect an all-zero user_desc to mean "no segment at all". */
|
|
|
|
static inline bool LDT_zero(const struct user_desc *info)
|
|
|
|
{
|
|
|
|
return (info->base_addr == 0 &&
|
|
|
|
info->limit == 0 &&
|
|
|
|
info->contents == 0 &&
|
|
|
|
info->read_exec_only == 0 &&
|
|
|
|
info->seg_32bit == 0 &&
|
|
|
|
info->limit_in_pages == 0 &&
|
|
|
|
info->seg_not_present == 0 &&
|
|
|
|
info->useable == 0);
|
|
|
|
}
|
|
|
|
|
2008-01-30 19:31:14 +07:00
|
|
|
static inline void clear_LDT(void)
|
|
|
|
{
|
|
|
|
set_ldt(NULL, 0);
|
|
|
|
}
|
|
|
|
|
2008-01-30 19:31:51 +07:00
|
|
|
static inline unsigned long get_desc_base(const struct desc_struct *desc)
|
2008-01-30 19:31:14 +07:00
|
|
|
{
|
2009-11-05 17:47:08 +07:00
|
|
|
return (unsigned)(desc->base0 | ((desc->base1) << 16) | ((desc->base2) << 24));
|
2008-01-30 19:31:14 +07:00
|
|
|
}
|
2008-01-30 19:31:51 +07:00
|
|
|
|
2009-07-18 22:11:06 +07:00
|
|
|
static inline void set_desc_base(struct desc_struct *desc, unsigned long base)
|
|
|
|
{
|
|
|
|
desc->base0 = base & 0xffff;
|
|
|
|
desc->base1 = (base >> 16) & 0xff;
|
|
|
|
desc->base2 = (base >> 24) & 0xff;
|
|
|
|
}
|
|
|
|
|
2008-01-30 19:31:51 +07:00
|
|
|
static inline unsigned long get_desc_limit(const struct desc_struct *desc)
|
|
|
|
{
|
2017-08-28 13:47:41 +07:00
|
|
|
return desc->limit0 | (desc->limit1 << 16);
|
2008-01-30 19:31:51 +07:00
|
|
|
}
|
|
|
|
|
2009-07-18 22:11:06 +07:00
|
|
|
static inline void set_desc_limit(struct desc_struct *desc, unsigned long limit)
|
|
|
|
{
|
|
|
|
desc->limit0 = limit & 0xffff;
|
2017-08-28 13:47:41 +07:00
|
|
|
desc->limit1 = (limit >> 16) & 0xf;
|
2009-07-18 22:11:06 +07:00
|
|
|
}
|
|
|
|
|
2017-08-28 13:47:57 +07:00
|
|
|
void alloc_intr_gate(unsigned int n, const void *addr);
|
2008-01-30 19:31:14 +07:00
|
|
|
|
2017-09-14 04:29:26 +07:00
|
|
|
extern unsigned long system_vectors[];
|
2008-04-16 03:36:56 +07:00
|
|
|
|
2020-05-28 21:53:20 +07:00
|
|
|
extern void load_current_idt(void);
|
2017-08-28 13:47:47 +07:00
|
|
|
extern void idt_setup_early_handler(void);
|
|
|
|
extern void idt_setup_early_traps(void);
|
2017-08-28 13:47:53 +07:00
|
|
|
extern void idt_setup_traps(void);
|
2017-08-28 13:47:54 +07:00
|
|
|
extern void idt_setup_apic_and_irq_gates(void);
|
2020-05-28 21:53:20 +07:00
|
|
|
extern bool idt_is_f00f_address(unsigned long address);
|
2017-08-28 13:47:47 +07:00
|
|
|
|
|
|
|
#ifdef CONFIG_X86_64
|
|
|
|
extern void idt_setup_early_pf(void);
|
2017-08-28 13:47:52 +07:00
|
|
|
extern void idt_setup_ist_traps(void);
|
2017-08-28 13:47:47 +07:00
|
|
|
#else
|
|
|
|
static inline void idt_setup_early_pf(void) { }
|
2017-08-28 13:47:52 +07:00
|
|
|
static inline void idt_setup_ist_traps(void) { }
|
2017-08-28 13:47:47 +07:00
|
|
|
#endif
|
|
|
|
|
2017-08-28 13:47:46 +07:00
|
|
|
extern void idt_invalidate(void *addr);
|
|
|
|
|
2008-10-23 12:26:29 +07:00
|
|
|
#endif /* _ASM_X86_DESC_H */
|