mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-29 15:43:59 +08:00
117ed45485
All stack types on x86 64-bit have guard pages now. So there is no point in executing probabilistic overflow checks as the guard pages are a accurate and reliable overflow prevention. Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Signed-off-by: Borislav Petkov <bp@suse.de> Cc: "H. Peter Anvin" <hpa@zytor.com> Cc: Andy Lutomirski <luto@kernel.org> Cc: Ingo Molnar <mingo@redhat.com> Cc: Josh Poimboeuf <jpoimboe@redhat.com> Cc: Nicolai Stange <nstange@suse.de> Cc: Sean Christopherson <sean.j.christopherson@intel.com> Cc: x86-ml <x86@kernel.org> Link: https://lkml.kernel.org/r/20190414160146.466354762@linutronix.de
82 lines
1.9 KiB
C
82 lines
1.9 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* Copyright (C) 1992, 1998 Linus Torvalds, Ingo Molnar
|
|
*
|
|
* This file contains the lowest level x86_64-specific interrupt
|
|
* entry and irq statistics code. All the remaining irq logic is
|
|
* done by the generic kernel/irq/ code and in the
|
|
* x86_64-specific irq controller code. (e.g. i8259.c and
|
|
* io_apic.c.)
|
|
*/
|
|
|
|
#include <linux/kernel_stat.h>
|
|
#include <linux/interrupt.h>
|
|
#include <linux/irq.h>
|
|
#include <linux/seq_file.h>
|
|
#include <linux/delay.h>
|
|
#include <linux/ftrace.h>
|
|
#include <linux/uaccess.h>
|
|
#include <linux/smp.h>
|
|
#include <linux/sched/task_stack.h>
|
|
|
|
#include <asm/cpu_entry_area.h>
|
|
#include <asm/io_apic.h>
|
|
#include <asm/apic.h>
|
|
|
|
DEFINE_PER_CPU_PAGE_ALIGNED(struct irq_stack, irq_stack_backing_store) __visible;
|
|
DECLARE_INIT_PER_CPU(irq_stack_backing_store);
|
|
|
|
bool handle_irq(struct irq_desc *desc, struct pt_regs *regs)
|
|
{
|
|
if (IS_ERR_OR_NULL(desc))
|
|
return false;
|
|
|
|
generic_handle_irq_desc(desc);
|
|
return true;
|
|
}
|
|
|
|
#ifdef CONFIG_VMAP_STACK
|
|
/*
|
|
* VMAP the backing store with guard pages
|
|
*/
|
|
static int map_irq_stack(unsigned int cpu)
|
|
{
|
|
char *stack = (char *)per_cpu_ptr(&irq_stack_backing_store, cpu);
|
|
struct page *pages[IRQ_STACK_SIZE / PAGE_SIZE];
|
|
void *va;
|
|
int i;
|
|
|
|
for (i = 0; i < IRQ_STACK_SIZE / PAGE_SIZE; i++) {
|
|
phys_addr_t pa = per_cpu_ptr_to_phys(stack + (i << PAGE_SHIFT));
|
|
|
|
pages[i] = pfn_to_page(pa >> PAGE_SHIFT);
|
|
}
|
|
|
|
va = vmap(pages, IRQ_STACK_SIZE / PAGE_SIZE, GFP_KERNEL, PAGE_KERNEL);
|
|
if (!va)
|
|
return -ENOMEM;
|
|
|
|
per_cpu(hardirq_stack_ptr, cpu) = va + IRQ_STACK_SIZE;
|
|
return 0;
|
|
}
|
|
#else
|
|
/*
|
|
* If VMAP stacks are disabled due to KASAN, just use the per cpu
|
|
* backing store without guard pages.
|
|
*/
|
|
static int map_irq_stack(unsigned int cpu)
|
|
{
|
|
void *va = per_cpu_ptr(&irq_stack_backing_store, cpu);
|
|
|
|
per_cpu(hardirq_stack_ptr, cpu) = va + IRQ_STACK_SIZE;
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
int irq_init_percpu_irqstack(unsigned int cpu)
|
|
{
|
|
if (per_cpu(hardirq_stack_ptr, cpu))
|
|
return 0;
|
|
return map_irq_stack(cpu);
|
|
}
|