Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
1da177e4 LT |
2 | * Copyright (C) 1992, 1998 Linus Torvalds, Ingo Molnar |
3 | * | |
4 | * This file contains the lowest level x86-specific interrupt | |
5 | * entry, irq-stacks and irq statistics code. All the remaining | |
6 | * irq logic is done by the generic kernel/irq/ code and | |
7 | * by the x86-specific irq controller code. (e.g. i8259.c and | |
8 | * io_apic.c.) | |
9 | */ | |
10 | ||
1da177e4 LT |
11 | #include <linux/module.h> |
12 | #include <linux/seq_file.h> | |
13 | #include <linux/interrupt.h> | |
14 | #include <linux/kernel_stat.h> | |
f3705136 ZM |
15 | #include <linux/notifier.h> |
16 | #include <linux/cpu.h> | |
17 | #include <linux/delay.h> | |
72ade5f9 | 18 | #include <linux/uaccess.h> |
42f8faec | 19 | #include <linux/percpu.h> |
5c1eb089 | 20 | #include <linux/mm.h> |
1da177e4 | 21 | |
e05d723f | 22 | #include <asm/apic.h> |
e05d723f | 23 | |
f34e3b61 | 24 | DEFINE_PER_CPU_SHARED_ALIGNED(irq_cpustat_t, irq_stat); |
1da177e4 LT |
25 | EXPORT_PER_CPU_SYMBOL(irq_stat); |
26 | ||
7c3576d2 JF |
27 | DEFINE_PER_CPU(struct pt_regs *, irq_regs); |
28 | EXPORT_PER_CPU_SYMBOL(irq_regs); | |
29 | ||
de9b10af | 30 | #ifdef CONFIG_DEBUG_STACKOVERFLOW |
53b56502 IM |
31 | |
32 | int sysctl_panic_on_stackoverflow __read_mostly; | |
33 | ||
de9b10af TG |
34 | /* Debugging check for stack overflow: is there less than 1KB free? */ |
35 | static int check_stack_overflow(void) | |
36 | { | |
37 | long sp; | |
38 | ||
39 | __asm__ __volatile__("andl %%esp,%0" : | |
40 | "=r" (sp) : "0" (THREAD_SIZE - 1)); | |
41 | ||
42 | return sp < (sizeof(struct thread_info) + STACK_WARN); | |
43 | } | |
44 | ||
45 | static void print_stack_overflow(void) | |
46 | { | |
47 | printk(KERN_WARNING "low stack detected by irq handler\n"); | |
48 | dump_stack(); | |
55af7796 MH |
49 | if (sysctl_panic_on_stackoverflow) |
50 | panic("low stack detected by irq handler - check messages\n"); | |
de9b10af TG |
51 | } |
52 | ||
53 | #else | |
54 | static inline int check_stack_overflow(void) { return 0; } | |
55 | static inline void print_stack_overflow(void) { } | |
56 | #endif | |
57 | ||
198d208d SR |
58 | DEFINE_PER_CPU(struct irq_stack *, hardirq_stack); |
59 | DEFINE_PER_CPU(struct irq_stack *, softirq_stack); | |
1da177e4 | 60 | |
403d8efc | 61 | static void call_on_stack(void *func, void *stack) |
04b361ab | 62 | { |
403d8efc TG |
63 | asm volatile("xchgl %%ebx,%%esp \n" |
64 | "call *%%edi \n" | |
65 | "movl %%ebx,%%esp \n" | |
66 | : "=b" (stack) | |
67 | : "0" (stack), | |
68 | "D"(func) | |
69 | : "memory", "cc", "edx", "ecx", "eax"); | |
04b361ab | 70 | } |
1da177e4 | 71 | |
198d208d SR |
72 | static inline void *current_stack(void) |
73 | { | |
83653c16 | 74 | return (void *)(current_stack_pointer() & ~(THREAD_SIZE - 1)); |
198d208d SR |
75 | } |
76 | ||
de9b10af TG |
77 | static inline int |
78 | execute_on_irq_stack(int overflow, struct irq_desc *desc, int irq) | |
79 | { | |
198d208d | 80 | struct irq_stack *curstk, *irqstk; |
0788aa6a | 81 | u32 *isp, *prev_esp, arg1, arg2; |
1da177e4 | 82 | |
198d208d SR |
83 | curstk = (struct irq_stack *) current_stack(); |
84 | irqstk = __this_cpu_read(hardirq_stack); | |
1da177e4 LT |
85 | |
86 | /* | |
87 | * this is where we switch to the IRQ stack. However, if we are | |
88 | * already using the IRQ stack (because we interrupted a hardirq | |
89 | * handler) we can't do that and just have to keep using the | |
90 | * current stack (which is the irq stack already after all) | |
91 | */ | |
198d208d | 92 | if (unlikely(curstk == irqstk)) |
de9b10af | 93 | return 0; |
1da177e4 | 94 | |
198d208d SR |
95 | isp = (u32 *) ((char *)irqstk + sizeof(*irqstk)); |
96 | ||
97 | /* Save the next esp at the bottom of the stack */ | |
98 | prev_esp = (u32 *)irqstk; | |
83653c16 | 99 | *prev_esp = current_stack_pointer(); |
1da177e4 | 100 | |
de9b10af | 101 | if (unlikely(overflow)) |
403d8efc TG |
102 | call_on_stack(print_stack_overflow, isp); |
103 | ||
104 | asm volatile("xchgl %%ebx,%%esp \n" | |
105 | "call *%%edi \n" | |
106 | "movl %%ebx,%%esp \n" | |
107 | : "=a" (arg1), "=d" (arg2), "=b" (isp) | |
108 | : "0" (irq), "1" (desc), "2" (isp), | |
109 | "D" (desc->handle_irq) | |
110 | : "memory", "cc", "ecx"); | |
1da177e4 LT |
111 | return 1; |
112 | } | |
113 | ||
1da177e4 LT |
114 | /* |
115 | * allocate per-cpu stacks for hardirq and for softirq processing | |
116 | */ | |
148f9bb8 | 117 | void irq_ctx_init(int cpu) |
1da177e4 | 118 | { |
198d208d | 119 | struct irq_stack *irqstk; |
1da177e4 | 120 | |
198d208d | 121 | if (per_cpu(hardirq_stack, cpu)) |
1da177e4 LT |
122 | return; |
123 | ||
198d208d | 124 | irqstk = page_address(alloc_pages_node(cpu_to_node(cpu), |
38e7c572 TG |
125 | THREADINFO_GFP, |
126 | THREAD_SIZE_ORDER)); | |
198d208d | 127 | per_cpu(hardirq_stack, cpu) = irqstk; |
1da177e4 | 128 | |
198d208d | 129 | irqstk = page_address(alloc_pages_node(cpu_to_node(cpu), |
38e7c572 TG |
130 | THREADINFO_GFP, |
131 | THREAD_SIZE_ORDER)); | |
198d208d | 132 | per_cpu(softirq_stack, cpu) = irqstk; |
1da177e4 | 133 | |
403d8efc | 134 | printk(KERN_DEBUG "CPU %u irqstacks, hard=%p soft=%p\n", |
198d208d | 135 | cpu, per_cpu(hardirq_stack, cpu), per_cpu(softirq_stack, cpu)); |
1da177e4 LT |
136 | } |
137 | ||
7d65f4a6 | 138 | void do_softirq_own_stack(void) |
1da177e4 | 139 | { |
198d208d SR |
140 | struct thread_info *curstk; |
141 | struct irq_stack *irqstk; | |
0788aa6a | 142 | u32 *isp, *prev_esp; |
1da177e4 | 143 | |
198d208d SR |
144 | curstk = current_stack(); |
145 | irqstk = __this_cpu_read(softirq_stack); | |
1da177e4 | 146 | |
7d65f4a6 | 147 | /* build the stack frame on the softirq stack */ |
198d208d | 148 | isp = (u32 *) ((char *)irqstk + sizeof(*irqstk)); |
1da177e4 | 149 | |
0788aa6a | 150 | /* Push the previous esp onto the stack */ |
198d208d | 151 | prev_esp = (u32 *)irqstk; |
83653c16 | 152 | *prev_esp = current_stack_pointer(); |
0788aa6a | 153 | |
7d65f4a6 | 154 | call_on_stack(__do_softirq, isp); |
1da177e4 | 155 | } |
403d8efc | 156 | |
9b2b76a3 JF |
157 | bool handle_irq(unsigned irq, struct pt_regs *regs) |
158 | { | |
159 | struct irq_desc *desc; | |
160 | int overflow; | |
161 | ||
162 | overflow = check_stack_overflow(); | |
163 | ||
164 | desc = irq_to_desc(irq); | |
165 | if (unlikely(!desc)) | |
166 | return false; | |
167 | ||
986cb48c | 168 | if (user_mode_vm(regs) || !execute_on_irq_stack(overflow, desc, irq)) { |
9b2b76a3 JF |
169 | if (unlikely(overflow)) |
170 | print_stack_overflow(); | |
171 | desc->handle_irq(irq, desc); | |
172 | } | |
173 | ||
174 | return true; | |
175 | } |