x86: Use this_cpu_ops to optimize code
[linux-2.6.git] / arch / x86 / kernel / irq_32.c
blob48ff6dcffa02774d4921331011dbcf6fe9070bc3
1 /*
2 * Copyright (C) 1992, 1998 Linus Torvalds, Ingo Molnar
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 */
11 #include <linux/module.h>
12 #include <linux/seq_file.h>
13 #include <linux/interrupt.h>
14 #include <linux/kernel_stat.h>
15 #include <linux/notifier.h>
16 #include <linux/cpu.h>
17 #include <linux/delay.h>
18 #include <linux/uaccess.h>
19 #include <linux/percpu.h>
20 #include <linux/mm.h>
22 #include <asm/apic.h>
24 DEFINE_PER_CPU_SHARED_ALIGNED(irq_cpustat_t, irq_stat);
25 EXPORT_PER_CPU_SYMBOL(irq_stat);
27 DEFINE_PER_CPU(struct pt_regs *, irq_regs);
28 EXPORT_PER_CPU_SYMBOL(irq_regs);
30 #ifdef CONFIG_DEBUG_STACKOVERFLOW
31 /* Debugging check for stack overflow: is there less than 1KB free? */
32 static int check_stack_overflow(void)
34 long sp;
36 __asm__ __volatile__("andl %%esp,%0" :
37 "=r" (sp) : "0" (THREAD_SIZE - 1));
39 return sp < (sizeof(struct thread_info) + STACK_WARN);
42 static void print_stack_overflow(void)
44 printk(KERN_WARNING "low stack detected by irq handler\n");
45 dump_stack();
48 #else
49 static inline int check_stack_overflow(void) { return 0; }
50 static inline void print_stack_overflow(void) { }
51 #endif
54 * per-CPU IRQ handling contexts (thread information and stack)
56 union irq_ctx {
57 struct thread_info tinfo;
58 u32 stack[THREAD_SIZE/sizeof(u32)];
59 } __attribute__((aligned(THREAD_SIZE)));
61 static DEFINE_PER_CPU(union irq_ctx *, hardirq_ctx);
62 static DEFINE_PER_CPU(union irq_ctx *, softirq_ctx);
64 static void call_on_stack(void *func, void *stack)
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");
75 static inline int
76 execute_on_irq_stack(int overflow, struct irq_desc *desc, int irq)
78 union irq_ctx *curctx, *irqctx;
79 u32 *isp, arg1, arg2;
81 curctx = (union irq_ctx *) current_thread_info();
82 irqctx = __this_cpu_read(hardirq_ctx);
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)
90 if (unlikely(curctx == irqctx))
91 return 0;
93 /* build the stack frame on the IRQ stack */
94 isp = (u32 *) ((char *)irqctx + sizeof(*irqctx));
95 irqctx->tinfo.task = curctx->tinfo.task;
96 irqctx->tinfo.previous_esp = current_stack_pointer;
99 * Copy the softirq bits in preempt_count so that the
100 * softirq checks work in the hardirq context.
102 irqctx->tinfo.preempt_count =
103 (irqctx->tinfo.preempt_count & ~SOFTIRQ_MASK) |
104 (curctx->tinfo.preempt_count & SOFTIRQ_MASK);
106 if (unlikely(overflow))
107 call_on_stack(print_stack_overflow, isp);
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");
116 return 1;
120 * allocate per-cpu stacks for hardirq and for softirq processing
122 void __cpuinit irq_ctx_init(int cpu)
124 union irq_ctx *irqctx;
126 if (per_cpu(hardirq_ctx, cpu))
127 return;
129 irqctx = page_address(alloc_pages_node(cpu_to_node(cpu),
130 THREAD_FLAGS,
131 THREAD_ORDER));
132 irqctx->tinfo.task = NULL;
133 irqctx->tinfo.exec_domain = NULL;
134 irqctx->tinfo.cpu = cpu;
135 irqctx->tinfo.preempt_count = HARDIRQ_OFFSET;
136 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
138 per_cpu(hardirq_ctx, cpu) = irqctx;
140 irqctx = page_address(alloc_pages_node(cpu_to_node(cpu),
141 THREAD_FLAGS,
142 THREAD_ORDER));
143 irqctx->tinfo.task = NULL;
144 irqctx->tinfo.exec_domain = NULL;
145 irqctx->tinfo.cpu = cpu;
146 irqctx->tinfo.preempt_count = 0;
147 irqctx->tinfo.addr_limit = MAKE_MM_SEG(0);
149 per_cpu(softirq_ctx, cpu) = irqctx;
151 printk(KERN_DEBUG "CPU %u irqstacks, hard=%p soft=%p\n",
152 cpu, per_cpu(hardirq_ctx, cpu), per_cpu(softirq_ctx, cpu));
155 asmlinkage void do_softirq(void)
157 unsigned long flags;
158 struct thread_info *curctx;
159 union irq_ctx *irqctx;
160 u32 *isp;
162 if (in_interrupt())
163 return;
165 local_irq_save(flags);
167 if (local_softirq_pending()) {
168 curctx = current_thread_info();
169 irqctx = __this_cpu_read(softirq_ctx);
170 irqctx->tinfo.task = curctx->task;
171 irqctx->tinfo.previous_esp = current_stack_pointer;
173 /* build the stack frame on the softirq stack */
174 isp = (u32 *) ((char *)irqctx + sizeof(*irqctx));
176 call_on_stack(__do_softirq, isp);
178 * Shouldnt happen, we returned above if in_interrupt():
180 WARN_ON_ONCE(softirq_count());
183 local_irq_restore(flags);
186 bool handle_irq(unsigned irq, struct pt_regs *regs)
188 struct irq_desc *desc;
189 int overflow;
191 overflow = check_stack_overflow();
193 desc = irq_to_desc(irq);
194 if (unlikely(!desc))
195 return false;
197 if (!execute_on_irq_stack(overflow, desc, irq)) {
198 if (unlikely(overflow))
199 print_stack_overflow();
200 desc->handle_irq(irq, desc);
203 return true;