x86: Clear irqstack thread_info
[linux-block.git] / arch / x86 / kernel / irq_32.c
CommitLineData
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 24DEFINE_PER_CPU_SHARED_ALIGNED(irq_cpustat_t, irq_stat);
1da177e4
LT
25EXPORT_PER_CPU_SYMBOL(irq_stat);
26
7c3576d2
JF
27DEFINE_PER_CPU(struct pt_regs *, irq_regs);
28EXPORT_PER_CPU_SYMBOL(irq_regs);
29
de9b10af
TG
30#ifdef CONFIG_DEBUG_STACKOVERFLOW
31/* Debugging check for stack overflow: is there less than 1KB free? */
32static int check_stack_overflow(void)
33{
34 long sp;
35
36 __asm__ __volatile__("andl %%esp,%0" :
37 "=r" (sp) : "0" (THREAD_SIZE - 1));
38
39 return sp < (sizeof(struct thread_info) + STACK_WARN);
40}
41
42static void print_stack_overflow(void)
43{
44 printk(KERN_WARNING "low stack detected by irq handler\n");
45 dump_stack();
46}
47
48#else
49static inline int check_stack_overflow(void) { return 0; }
50static inline void print_stack_overflow(void) { }
51#endif
52
1da177e4
LT
53/*
54 * per-CPU IRQ handling contexts (thread information and stack)
55 */
56union irq_ctx {
57 struct thread_info tinfo;
58 u32 stack[THREAD_SIZE/sizeof(u32)];
25897374 59} __attribute__((aligned(THREAD_SIZE)));
1da177e4 60
42f8faec
LJ
61static DEFINE_PER_CPU(union irq_ctx *, hardirq_ctx);
62static DEFINE_PER_CPU(union irq_ctx *, softirq_ctx);
1da177e4 63
403d8efc 64static void call_on_stack(void *func, void *stack)
04b361ab 65{
403d8efc
TG
66 asm volatile("xchgl %%ebx,%%esp \n"
67 "call *%%edi \n"
68 "movl %%ebx,%%esp \n"
69 : "=b" (stack)
70 : "0" (stack),
71 "D"(func)
72 : "memory", "cc", "edx", "ecx", "eax");
04b361ab 73}
1da177e4 74
de9b10af
TG
75static inline int
76execute_on_irq_stack(int overflow, struct irq_desc *desc, int irq)
77{
78 union irq_ctx *curctx, *irqctx;
403d8efc 79 u32 *isp, arg1, arg2;
1da177e4
LT
80
81 curctx = (union irq_ctx *) current_thread_info();
42f8faec 82 irqctx = __get_cpu_var(hardirq_ctx);
1da177e4
LT
83
84 /*
85 * this is where we switch to the IRQ stack. However, if we are
86 * already using the IRQ stack (because we interrupted a hardirq
87 * handler) we can't do that and just have to keep using the
88 * current stack (which is the irq stack already after all)
89 */
de9b10af
TG
90 if (unlikely(curctx == irqctx))
91 return 0;
1da177e4 92
de9b10af 93 /* build the stack frame on the IRQ stack */
72ade5f9 94 isp = (u32 *) ((char *)irqctx + sizeof(*irqctx));
de9b10af
TG
95 irqctx->tinfo.task = curctx->tinfo.task;
96 irqctx->tinfo.previous_esp = current_stack_pointer;
1da177e4 97
de9b10af
TG
98 /*
99 * Copy the softirq bits in preempt_count so that the
100 * softirq checks work in the hardirq context.
101 */
102 irqctx->tinfo.preempt_count =
103 (irqctx->tinfo.preempt_count & ~SOFTIRQ_MASK) |
104 (curctx->tinfo.preempt_count & SOFTIRQ_MASK);
105
106 if (unlikely(overflow))
403d8efc
TG
107 call_on_stack(print_stack_overflow, isp);
108
109 asm volatile("xchgl %%ebx,%%esp \n"
110 "call *%%edi \n"
111 "movl %%ebx,%%esp \n"
112 : "=a" (arg1), "=d" (arg2), "=b" (isp)
113 : "0" (irq), "1" (desc), "2" (isp),
114 "D" (desc->handle_irq)
115 : "memory", "cc", "ecx");
1da177e4
LT
116 return 1;
117}
118
1da177e4
LT
119/*
120 * allocate per-cpu stacks for hardirq and for softirq processing
121 */
403d8efc 122void __cpuinit irq_ctx_init(int cpu)
1da177e4
LT
123{
124 union irq_ctx *irqctx;
125
42f8faec 126 if (per_cpu(hardirq_ctx, cpu))
1da177e4
LT
127 return;
128
5c1eb089
ED
129 irqctx = page_address(alloc_pages_node(cpu_to_node(cpu),
130 THREAD_FLAGS,
131 THREAD_ORDER));
7b698ea3 132 memset(&irqctx->tinfo, 0, sizeof(struct thread_info));
403d8efc
TG
133 irqctx->tinfo.cpu = cpu;
134 irqctx->tinfo.preempt_count = HARDIRQ_OFFSET;
135 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
1da177e4 136
42f8faec 137 per_cpu(hardirq_ctx, cpu) = irqctx;
1da177e4 138
5c1eb089
ED
139 irqctx = page_address(alloc_pages_node(cpu_to_node(cpu),
140 THREAD_FLAGS,
141 THREAD_ORDER));
7b698ea3 142 memset(&irqctx->tinfo, 0, sizeof(struct thread_info));
403d8efc 143 irqctx->tinfo.cpu = cpu;
403d8efc 144 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
1da177e4 145
42f8faec 146 per_cpu(softirq_ctx, cpu) = irqctx;
1da177e4 147
403d8efc 148 printk(KERN_DEBUG "CPU %u irqstacks, hard=%p soft=%p\n",
42f8faec 149 cpu, per_cpu(hardirq_ctx, cpu), per_cpu(softirq_ctx, cpu));
1da177e4
LT
150}
151
1da177e4
LT
152asmlinkage void do_softirq(void)
153{
154 unsigned long flags;
155 struct thread_info *curctx;
156 union irq_ctx *irqctx;
157 u32 *isp;
158
159 if (in_interrupt())
160 return;
161
162 local_irq_save(flags);
163
164 if (local_softirq_pending()) {
165 curctx = current_thread_info();
42f8faec 166 irqctx = __get_cpu_var(softirq_ctx);
1da177e4
LT
167 irqctx->tinfo.task = curctx->task;
168 irqctx->tinfo.previous_esp = current_stack_pointer;
169
170 /* build the stack frame on the softirq stack */
72ade5f9 171 isp = (u32 *) ((char *)irqctx + sizeof(*irqctx));
1da177e4 172
403d8efc 173 call_on_stack(__do_softirq, isp);
55f327fa
IM
174 /*
175 * Shouldnt happen, we returned above if in_interrupt():
403d8efc 176 */
55f327fa 177 WARN_ON_ONCE(softirq_count());
1da177e4
LT
178 }
179
180 local_irq_restore(flags);
181}
403d8efc 182
9b2b76a3
JF
183bool handle_irq(unsigned irq, struct pt_regs *regs)
184{
185 struct irq_desc *desc;
186 int overflow;
187
188 overflow = check_stack_overflow();
189
190 desc = irq_to_desc(irq);
191 if (unlikely(!desc))
192 return false;
193
194 if (!execute_on_irq_stack(overflow, desc, irq)) {
195 if (unlikely(overflow))
196 print_stack_overflow();
197 desc->handle_irq(irq, desc);
198 }
199
200 return true;
201}