arch/x86/kernel/irq_32.c

   1 /*
   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
  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>
  21
  22 #include <asm/apic.h>
  23
  24 #ifdef CONFIG_DEBUG_STACKOVERFLOW
  25
  26 int sysctl_panic_on_stackoverflow __read_mostly;
  27
  28 /* Debugging check for stack overflow: is there less than 1KB free? */
  29 static int check_stack_overflow(void)
  30 {
  31         long sp;
  32
  33         __asm__ __volatile__("andl %%esp,%0" :
  34                              "=r" (sp) : "0" (THREAD_SIZE - 1));
  35
  36         return sp < (sizeof(struct thread_info) + STACK_WARN);
  37 }
  38
  39 static void print_stack_overflow(void)
  40 {
  41         printk(KERN_WARNING "low stack detected by irq handler\n");
  42         dump_stack();
  43         if (sysctl_panic_on_stackoverflow)
  44                 panic("low stack detected by irq handler - check messages\n");
  45 }
  46
  47 #else
  48 static inline int check_stack_overflow(void) { return 0; }
  49 static inline void print_stack_overflow(void) { }
  50 #endif
  51
  52 DEFINE_PER_CPU(struct irq_stack *, hardirq_stack);
  53 DEFINE_PER_CPU(struct irq_stack *, softirq_stack);
  54
  55 static void call_on_stack(void *func, void *stack)
  56 {
  57         asm volatile("xchgl     %%ebx,%%esp     \n"
  58                      "call      *%%edi          \n"
  59                      "movl      %%ebx,%%esp     \n"
  60                      : "=b" (stack)
  61                      : "0" (stack),
  62                        "D"(func)
  63                      : "memory", "cc", "edx", "ecx", "eax");
  64 }
  65
  66 static inline void *current_stack(void)
  67 {
  68         return (void *)(current_stack_pointer() & ~(THREAD_SIZE - 1));
  69 }
  70
  71 static inline int
  72 execute_on_irq_stack(int overflow, struct irq_desc *desc, int irq)
  73 {
  74         struct irq_stack *curstk, *irqstk;
  75         u32 *isp, *prev_esp, arg1, arg2;
  76
  77         curstk = (struct irq_stack *) current_stack();
  78         irqstk = __this_cpu_read(hardirq_stack);
  79
  80         /*
  81          * this is where we switch to the IRQ stack. However, if we are
  82          * already using the IRQ stack (because we interrupted a hardirq
  83          * handler) we can't do that and just have to keep using the
  84          * current stack (which is the irq stack already after all)
  85          */
  86         if (unlikely(curstk == irqstk))
  87                 return 0;
  88
  89         isp = (u32 *) ((char *)irqstk + sizeof(*irqstk));
  90
  91         /* Save the next esp at the bottom of the stack */
  92         prev_esp = (u32 *)irqstk;
  93         *prev_esp = current_stack_pointer();
  94
  95         if (unlikely(overflow))
  96                 call_on_stack(print_stack_overflow, isp);
  97
  98         asm volatile("xchgl     %%ebx,%%esp     \n"
  99                      "call      *%%edi          \n"
 100                      "movl      %%ebx,%%esp     \n"
 101                      : "=a" (arg1), "=d" (arg2), "=b" (isp)
 102                      :  "0" (irq),   "1" (desc),  "2" (isp),
 103                         "D" (desc->handle_irq)
 104                      : "memory", "cc", "ecx");
 105         return 1;
 106 }
 107
 108 /*
 109  * allocate per-cpu stacks for hardirq and for softirq processing
 110  */
 111 void irq_ctx_init(int cpu)
 112 {
 113         struct irq_stack *irqstk;
 114
 115         if (per_cpu(hardirq_stack, cpu))
 116                 return;
 117
 118         irqstk = page_address(alloc_pages_node(cpu_to_node(cpu),
 119                                                THREADINFO_GFP,
 120                                                THREAD_SIZE_ORDER));
 121         per_cpu(hardirq_stack, cpu) = irqstk;
 122
 123         irqstk = page_address(alloc_pages_node(cpu_to_node(cpu),
 124                                                THREADINFO_GFP,
 125                                                THREAD_SIZE_ORDER));
 126         per_cpu(softirq_stack, cpu) = irqstk;
 127
 128         printk(KERN_DEBUG "CPU %u irqstacks, hard=%p soft=%p\n",
 129                cpu, per_cpu(hardirq_stack, cpu),  per_cpu(softirq_stack, cpu));
 130 }
 131
 132 void do_softirq_own_stack(void)
 133 {
 134         struct thread_info *curstk;
 135         struct irq_stack *irqstk;
 136         u32 *isp, *prev_esp;
 137
 138         curstk = current_stack();
 139         irqstk = __this_cpu_read(softirq_stack);
 140
 141         /* build the stack frame on the softirq stack */
 142         isp = (u32 *) ((char *)irqstk + sizeof(*irqstk));
 143
 144         /* Push the previous esp onto the stack */
 145         prev_esp = (u32 *)irqstk;
 146         *prev_esp = current_stack_pointer();
 147
 148         call_on_stack(__do_softirq, isp);
 149 }
 150
 151 bool handle_irq(unsigned irq, struct pt_regs *regs)
 152 {
 153         struct irq_desc *desc;
 154         int overflow;
 155
 156         overflow = check_stack_overflow();
 157
 158         desc = irq_to_desc(irq);
 159         if (unlikely(!desc))
 160                 return false;
 161
 162         if (user_mode(regs) || !execute_on_irq_stack(overflow, desc, irq)) {
 163                 if (unlikely(overflow))
 164                         print_stack_overflow();
 165                 desc->handle_irq(irq, desc);
 166         }
 167
 168         return true;
 169 }