traps.c 30 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205
  1. /*
  2. * linux/arch/x86-64/traps.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. * Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
  6. *
  7. * Pentium III FXSR, SSE support
  8. * Gareth Hughes <gareth@valinux.com>, May 2000
  9. */
  10. /*
  11. * 'Traps.c' handles hardware traps and faults after we have saved some
  12. * state in 'entry.S'.
  13. */
  14. #include <linux/sched.h>
  15. #include <linux/kernel.h>
  16. #include <linux/string.h>
  17. #include <linux/errno.h>
  18. #include <linux/ptrace.h>
  19. #include <linux/timer.h>
  20. #include <linux/mm.h>
  21. #include <linux/init.h>
  22. #include <linux/delay.h>
  23. #include <linux/spinlock.h>
  24. #include <linux/interrupt.h>
  25. #include <linux/kallsyms.h>
  26. #include <linux/module.h>
  27. #include <linux/moduleparam.h>
  28. #include <linux/nmi.h>
  29. #include <linux/kprobes.h>
  30. #include <linux/kexec.h>
  31. #include <linux/unwind.h>
  32. #include <asm/system.h>
  33. #include <asm/uaccess.h>
  34. #include <asm/io.h>
  35. #include <asm/atomic.h>
  36. #include <asm/debugreg.h>
  37. #include <asm/desc.h>
  38. #include <asm/i387.h>
  39. #include <asm/kdebug.h>
  40. #include <asm/processor.h>
  41. #include <asm/unwind.h>
  42. #include <asm/smp.h>
  43. #include <asm/pgalloc.h>
  44. #include <asm/pda.h>
  45. #include <asm/proto.h>
  46. #include <asm/nmi.h>
  47. #include <asm/stacktrace.h>
  48. asmlinkage void divide_error(void);
  49. asmlinkage void debug(void);
  50. asmlinkage void nmi(void);
  51. asmlinkage void int3(void);
  52. asmlinkage void overflow(void);
  53. asmlinkage void bounds(void);
  54. asmlinkage void invalid_op(void);
  55. asmlinkage void device_not_available(void);
  56. asmlinkage void double_fault(void);
  57. asmlinkage void coprocessor_segment_overrun(void);
  58. asmlinkage void invalid_TSS(void);
  59. asmlinkage void segment_not_present(void);
  60. asmlinkage void stack_segment(void);
  61. asmlinkage void general_protection(void);
  62. asmlinkage void page_fault(void);
  63. asmlinkage void coprocessor_error(void);
  64. asmlinkage void simd_coprocessor_error(void);
  65. asmlinkage void reserved(void);
  66. asmlinkage void alignment_check(void);
  67. asmlinkage void machine_check(void);
  68. asmlinkage void spurious_interrupt_bug(void);
  69. ATOMIC_NOTIFIER_HEAD(die_chain);
  70. EXPORT_SYMBOL(die_chain);
  71. int register_die_notifier(struct notifier_block *nb)
  72. {
  73. vmalloc_sync_all();
  74. return atomic_notifier_chain_register(&die_chain, nb);
  75. }
  76. EXPORT_SYMBOL(register_die_notifier); /* used modular by kdb */
  77. int unregister_die_notifier(struct notifier_block *nb)
  78. {
  79. return atomic_notifier_chain_unregister(&die_chain, nb);
  80. }
  81. EXPORT_SYMBOL(unregister_die_notifier); /* used modular by kdb */
  82. static inline void conditional_sti(struct pt_regs *regs)
  83. {
  84. if (regs->eflags & X86_EFLAGS_IF)
  85. local_irq_enable();
  86. }
  87. static inline void preempt_conditional_sti(struct pt_regs *regs)
  88. {
  89. preempt_disable();
  90. if (regs->eflags & X86_EFLAGS_IF)
  91. local_irq_enable();
  92. }
  93. static inline void preempt_conditional_cli(struct pt_regs *regs)
  94. {
  95. if (regs->eflags & X86_EFLAGS_IF)
  96. local_irq_disable();
  97. /* Make sure to not schedule here because we could be running
  98. on an exception stack. */
  99. preempt_enable_no_resched();
  100. }
  101. static int kstack_depth_to_print = 12;
  102. #ifdef CONFIG_STACK_UNWIND
  103. static int call_trace = 1;
  104. #else
  105. #define call_trace (-1)
  106. #endif
  107. #ifdef CONFIG_KALLSYMS
  108. void printk_address(unsigned long address)
  109. {
  110. unsigned long offset = 0, symsize;
  111. const char *symname;
  112. char *modname;
  113. char *delim = ":";
  114. char namebuf[128];
  115. symname = kallsyms_lookup(address, &symsize, &offset,
  116. &modname, namebuf);
  117. if (!symname) {
  118. printk(" [<%016lx>]\n", address);
  119. return;
  120. }
  121. if (!modname)
  122. modname = delim = "";
  123. printk(" [<%016lx>] %s%s%s%s+0x%lx/0x%lx\n",
  124. address, delim, modname, delim, symname, offset, symsize);
  125. }
  126. #else
  127. void printk_address(unsigned long address)
  128. {
  129. printk(" [<%016lx>]\n", address);
  130. }
  131. #endif
  132. static unsigned long *in_exception_stack(unsigned cpu, unsigned long stack,
  133. unsigned *usedp, char **idp)
  134. {
  135. static char ids[][8] = {
  136. [DEBUG_STACK - 1] = "#DB",
  137. [NMI_STACK - 1] = "NMI",
  138. [DOUBLEFAULT_STACK - 1] = "#DF",
  139. [STACKFAULT_STACK - 1] = "#SS",
  140. [MCE_STACK - 1] = "#MC",
  141. #if DEBUG_STKSZ > EXCEPTION_STKSZ
  142. [N_EXCEPTION_STACKS ... N_EXCEPTION_STACKS + DEBUG_STKSZ / EXCEPTION_STKSZ - 2] = "#DB[?]"
  143. #endif
  144. };
  145. unsigned k;
  146. /*
  147. * Iterate over all exception stacks, and figure out whether
  148. * 'stack' is in one of them:
  149. */
  150. for (k = 0; k < N_EXCEPTION_STACKS; k++) {
  151. unsigned long end = per_cpu(orig_ist, cpu).ist[k];
  152. /*
  153. * Is 'stack' above this exception frame's end?
  154. * If yes then skip to the next frame.
  155. */
  156. if (stack >= end)
  157. continue;
  158. /*
  159. * Is 'stack' above this exception frame's start address?
  160. * If yes then we found the right frame.
  161. */
  162. if (stack >= end - EXCEPTION_STKSZ) {
  163. /*
  164. * Make sure we only iterate through an exception
  165. * stack once. If it comes up for the second time
  166. * then there's something wrong going on - just
  167. * break out and return NULL:
  168. */
  169. if (*usedp & (1U << k))
  170. break;
  171. *usedp |= 1U << k;
  172. *idp = ids[k];
  173. return (unsigned long *)end;
  174. }
  175. /*
  176. * If this is a debug stack, and if it has a larger size than
  177. * the usual exception stacks, then 'stack' might still
  178. * be within the lower portion of the debug stack:
  179. */
  180. #if DEBUG_STKSZ > EXCEPTION_STKSZ
  181. if (k == DEBUG_STACK - 1 && stack >= end - DEBUG_STKSZ) {
  182. unsigned j = N_EXCEPTION_STACKS - 1;
  183. /*
  184. * Black magic. A large debug stack is composed of
  185. * multiple exception stack entries, which we
  186. * iterate through now. Dont look:
  187. */
  188. do {
  189. ++j;
  190. end -= EXCEPTION_STKSZ;
  191. ids[j][4] = '1' + (j - N_EXCEPTION_STACKS);
  192. } while (stack < end - EXCEPTION_STKSZ);
  193. if (*usedp & (1U << j))
  194. break;
  195. *usedp |= 1U << j;
  196. *idp = ids[j];
  197. return (unsigned long *)end;
  198. }
  199. #endif
  200. }
  201. return NULL;
  202. }
  203. struct ops_and_data {
  204. struct stacktrace_ops *ops;
  205. void *data;
  206. };
  207. static int dump_trace_unwind(struct unwind_frame_info *info, void *context)
  208. {
  209. struct ops_and_data *oad = (struct ops_and_data *)context;
  210. int n = 0;
  211. while (unwind(info) == 0 && UNW_PC(info)) {
  212. n++;
  213. oad->ops->address(oad->data, UNW_PC(info));
  214. if (arch_unw_user_mode(info))
  215. break;
  216. }
  217. return n;
  218. }
  219. /*
  220. * x86-64 can have upto three kernel stacks:
  221. * process stack
  222. * interrupt stack
  223. * severe exception (double fault, nmi, stack fault, debug, mce) hardware stack
  224. */
  225. void dump_trace(struct task_struct *tsk, struct pt_regs *regs, unsigned long * stack,
  226. struct stacktrace_ops *ops, void *data)
  227. {
  228. const unsigned cpu = smp_processor_id();
  229. unsigned long *irqstack_end = (unsigned long *)cpu_pda(cpu)->irqstackptr;
  230. unsigned used = 0;
  231. if (!tsk)
  232. tsk = current;
  233. if (call_trace >= 0) {
  234. int unw_ret = 0;
  235. struct unwind_frame_info info;
  236. struct ops_and_data oad = { .ops = ops, .data = data };
  237. if (regs) {
  238. if (unwind_init_frame_info(&info, tsk, regs) == 0)
  239. unw_ret = dump_trace_unwind(&info, &oad);
  240. } else if (tsk == current)
  241. unw_ret = unwind_init_running(&info, dump_trace_unwind, &oad);
  242. else {
  243. if (unwind_init_blocked(&info, tsk) == 0)
  244. unw_ret = dump_trace_unwind(&info, &oad);
  245. }
  246. if (unw_ret > 0) {
  247. if (call_trace == 1 && !arch_unw_user_mode(&info)) {
  248. ops->warning_symbol(data, "DWARF2 unwinder stuck at %s\n",
  249. UNW_PC(&info));
  250. if ((long)UNW_SP(&info) < 0) {
  251. ops->warning(data, "Leftover inexact backtrace:\n");
  252. stack = (unsigned long *)UNW_SP(&info);
  253. if (!stack)
  254. return;
  255. } else
  256. ops->warning(data, "Full inexact backtrace again:\n");
  257. } else if (call_trace >= 1)
  258. return;
  259. else
  260. ops->warning(data, "Full inexact backtrace again:\n");
  261. } else
  262. ops->warning(data, "Inexact backtrace:\n");
  263. }
  264. if (!stack) {
  265. unsigned long dummy;
  266. stack = &dummy;
  267. if (tsk && tsk != current)
  268. stack = (unsigned long *)tsk->thread.rsp;
  269. }
  270. /*
  271. * Align the stack pointer on word boundary, later loops
  272. * rely on that (and corruption / debug info bugs can cause
  273. * unaligned values here):
  274. */
  275. stack = (unsigned long *)((unsigned long)stack & ~(sizeof(long)-1));
  276. /*
  277. * Print function call entries within a stack. 'cond' is the
  278. * "end of stackframe" condition, that the 'stack++'
  279. * iteration will eventually trigger.
  280. */
  281. #define HANDLE_STACK(cond) \
  282. do while (cond) { \
  283. unsigned long addr = *stack++; \
  284. if (oops_in_progress ? \
  285. __kernel_text_address(addr) : \
  286. kernel_text_address(addr)) { \
  287. /* \
  288. * If the address is either in the text segment of the \
  289. * kernel, or in the region which contains vmalloc'ed \
  290. * memory, it *may* be the address of a calling \
  291. * routine; if so, print it so that someone tracing \
  292. * down the cause of the crash will be able to figure \
  293. * out the call path that was taken. \
  294. */ \
  295. ops->address(data, addr); \
  296. } \
  297. } while (0)
  298. /*
  299. * Print function call entries in all stacks, starting at the
  300. * current stack address. If the stacks consist of nested
  301. * exceptions
  302. */
  303. for (;;) {
  304. char *id;
  305. unsigned long *estack_end;
  306. estack_end = in_exception_stack(cpu, (unsigned long)stack,
  307. &used, &id);
  308. if (estack_end) {
  309. if (ops->stack(data, id) < 0)
  310. break;
  311. HANDLE_STACK (stack < estack_end);
  312. ops->stack(data, "<EOE>");
  313. /*
  314. * We link to the next stack via the
  315. * second-to-last pointer (index -2 to end) in the
  316. * exception stack:
  317. */
  318. stack = (unsigned long *) estack_end[-2];
  319. continue;
  320. }
  321. if (irqstack_end) {
  322. unsigned long *irqstack;
  323. irqstack = irqstack_end -
  324. (IRQSTACKSIZE - 64) / sizeof(*irqstack);
  325. if (stack >= irqstack && stack < irqstack_end) {
  326. if (ops->stack(data, "IRQ") < 0)
  327. break;
  328. HANDLE_STACK (stack < irqstack_end);
  329. /*
  330. * We link to the next stack (which would be
  331. * the process stack normally) the last
  332. * pointer (index -1 to end) in the IRQ stack:
  333. */
  334. stack = (unsigned long *) (irqstack_end[-1]);
  335. irqstack_end = NULL;
  336. ops->stack(data, "EOI");
  337. continue;
  338. }
  339. }
  340. break;
  341. }
  342. /*
  343. * This handles the process stack:
  344. */
  345. HANDLE_STACK (((long) stack & (THREAD_SIZE-1)) != 0);
  346. #undef HANDLE_STACK
  347. }
  348. EXPORT_SYMBOL(dump_trace);
  349. static void
  350. print_trace_warning_symbol(void *data, char *msg, unsigned long symbol)
  351. {
  352. print_symbol(msg, symbol);
  353. printk("\n");
  354. }
  355. static void print_trace_warning(void *data, char *msg)
  356. {
  357. printk("%s\n", msg);
  358. }
  359. static int print_trace_stack(void *data, char *name)
  360. {
  361. printk(" <%s> ", name);
  362. return 0;
  363. }
  364. static void print_trace_address(void *data, unsigned long addr)
  365. {
  366. printk_address(addr);
  367. }
  368. static struct stacktrace_ops print_trace_ops = {
  369. .warning = print_trace_warning,
  370. .warning_symbol = print_trace_warning_symbol,
  371. .stack = print_trace_stack,
  372. .address = print_trace_address,
  373. };
  374. void
  375. show_trace(struct task_struct *tsk, struct pt_regs *regs, unsigned long *stack)
  376. {
  377. printk("\nCall Trace:\n");
  378. dump_trace(tsk, regs, stack, &print_trace_ops, NULL);
  379. printk("\n");
  380. }
  381. static void
  382. _show_stack(struct task_struct *tsk, struct pt_regs *regs, unsigned long *rsp)
  383. {
  384. unsigned long *stack;
  385. int i;
  386. const int cpu = smp_processor_id();
  387. unsigned long *irqstack_end = (unsigned long *) (cpu_pda(cpu)->irqstackptr);
  388. unsigned long *irqstack = (unsigned long *) (cpu_pda(cpu)->irqstackptr - IRQSTACKSIZE);
  389. // debugging aid: "show_stack(NULL, NULL);" prints the
  390. // back trace for this cpu.
  391. if (rsp == NULL) {
  392. if (tsk)
  393. rsp = (unsigned long *)tsk->thread.rsp;
  394. else
  395. rsp = (unsigned long *)&rsp;
  396. }
  397. stack = rsp;
  398. for(i=0; i < kstack_depth_to_print; i++) {
  399. if (stack >= irqstack && stack <= irqstack_end) {
  400. if (stack == irqstack_end) {
  401. stack = (unsigned long *) (irqstack_end[-1]);
  402. printk(" <EOI> ");
  403. }
  404. } else {
  405. if (((long) stack & (THREAD_SIZE-1)) == 0)
  406. break;
  407. }
  408. if (i && ((i % 4) == 0))
  409. printk("\n");
  410. printk(" %016lx", *stack++);
  411. touch_nmi_watchdog();
  412. }
  413. show_trace(tsk, regs, rsp);
  414. }
  415. void show_stack(struct task_struct *tsk, unsigned long * rsp)
  416. {
  417. _show_stack(tsk, NULL, rsp);
  418. }
  419. /*
  420. * The architecture-independent dump_stack generator
  421. */
  422. void dump_stack(void)
  423. {
  424. unsigned long dummy;
  425. show_trace(NULL, NULL, &dummy);
  426. }
  427. EXPORT_SYMBOL(dump_stack);
  428. void show_registers(struct pt_regs *regs)
  429. {
  430. int i;
  431. int in_kernel = !user_mode(regs);
  432. unsigned long rsp;
  433. const int cpu = smp_processor_id();
  434. struct task_struct *cur = cpu_pda(cpu)->pcurrent;
  435. rsp = regs->rsp;
  436. printk("CPU %d ", cpu);
  437. __show_regs(regs);
  438. printk("Process %s (pid: %d, threadinfo %p, task %p)\n",
  439. cur->comm, cur->pid, task_thread_info(cur), cur);
  440. /*
  441. * When in-kernel, we also print out the stack and code at the
  442. * time of the fault..
  443. */
  444. if (in_kernel) {
  445. printk("Stack: ");
  446. _show_stack(NULL, regs, (unsigned long*)rsp);
  447. printk("\nCode: ");
  448. if (regs->rip < PAGE_OFFSET)
  449. goto bad;
  450. for (i=0; i<20; i++) {
  451. unsigned char c;
  452. if (__get_user(c, &((unsigned char*)regs->rip)[i])) {
  453. bad:
  454. printk(" Bad RIP value.");
  455. break;
  456. }
  457. printk("%02x ", c);
  458. }
  459. }
  460. printk("\n");
  461. }
  462. void handle_BUG(struct pt_regs *regs)
  463. {
  464. struct bug_frame f;
  465. long len;
  466. const char *prefix = "";
  467. if (user_mode(regs))
  468. return;
  469. if (__copy_from_user(&f, (const void __user *) regs->rip,
  470. sizeof(struct bug_frame)))
  471. return;
  472. if (f.filename >= 0 ||
  473. f.ud2[0] != 0x0f || f.ud2[1] != 0x0b)
  474. return;
  475. len = __strnlen_user((char *)(long)f.filename, PATH_MAX) - 1;
  476. if (len < 0 || len >= PATH_MAX)
  477. f.filename = (int)(long)"unmapped filename";
  478. else if (len > 50) {
  479. f.filename += len - 50;
  480. prefix = "...";
  481. }
  482. printk("----------- [cut here ] --------- [please bite here ] ---------\n");
  483. printk(KERN_ALERT "Kernel BUG at %s%.50s:%d\n", prefix, (char *)(long)f.filename, f.line);
  484. }
  485. #ifdef CONFIG_BUG
  486. void out_of_line_bug(void)
  487. {
  488. BUG();
  489. }
  490. EXPORT_SYMBOL(out_of_line_bug);
  491. #endif
  492. static DEFINE_SPINLOCK(die_lock);
  493. static int die_owner = -1;
  494. static unsigned int die_nest_count;
  495. unsigned __kprobes long oops_begin(void)
  496. {
  497. int cpu = smp_processor_id();
  498. unsigned long flags;
  499. oops_enter();
  500. /* racy, but better than risking deadlock. */
  501. local_irq_save(flags);
  502. if (!spin_trylock(&die_lock)) {
  503. if (cpu == die_owner)
  504. /* nested oops. should stop eventually */;
  505. else
  506. spin_lock(&die_lock);
  507. }
  508. die_nest_count++;
  509. die_owner = cpu;
  510. console_verbose();
  511. bust_spinlocks(1);
  512. return flags;
  513. }
  514. void __kprobes oops_end(unsigned long flags)
  515. {
  516. die_owner = -1;
  517. bust_spinlocks(0);
  518. die_nest_count--;
  519. if (die_nest_count)
  520. /* We still own the lock */
  521. local_irq_restore(flags);
  522. else
  523. /* Nest count reaches zero, release the lock. */
  524. spin_unlock_irqrestore(&die_lock, flags);
  525. if (panic_on_oops)
  526. panic("Fatal exception");
  527. oops_exit();
  528. }
  529. void __kprobes __die(const char * str, struct pt_regs * regs, long err)
  530. {
  531. static int die_counter;
  532. printk(KERN_EMERG "%s: %04lx [%u] ", str, err & 0xffff,++die_counter);
  533. #ifdef CONFIG_PREEMPT
  534. printk("PREEMPT ");
  535. #endif
  536. #ifdef CONFIG_SMP
  537. printk("SMP ");
  538. #endif
  539. #ifdef CONFIG_DEBUG_PAGEALLOC
  540. printk("DEBUG_PAGEALLOC");
  541. #endif
  542. printk("\n");
  543. notify_die(DIE_OOPS, str, regs, err, current->thread.trap_no, SIGSEGV);
  544. show_registers(regs);
  545. /* Executive summary in case the oops scrolled away */
  546. printk(KERN_ALERT "RIP ");
  547. printk_address(regs->rip);
  548. printk(" RSP <%016lx>\n", regs->rsp);
  549. if (kexec_should_crash(current))
  550. crash_kexec(regs);
  551. }
  552. void die(const char * str, struct pt_regs * regs, long err)
  553. {
  554. unsigned long flags = oops_begin();
  555. handle_BUG(regs);
  556. __die(str, regs, err);
  557. oops_end(flags);
  558. do_exit(SIGSEGV);
  559. }
  560. void __kprobes die_nmi(char *str, struct pt_regs *regs, int do_panic)
  561. {
  562. unsigned long flags = oops_begin();
  563. /*
  564. * We are in trouble anyway, lets at least try
  565. * to get a message out.
  566. */
  567. printk(str, smp_processor_id());
  568. show_registers(regs);
  569. if (kexec_should_crash(current))
  570. crash_kexec(regs);
  571. if (do_panic || panic_on_oops)
  572. panic("Non maskable interrupt");
  573. oops_end(flags);
  574. nmi_exit();
  575. local_irq_enable();
  576. do_exit(SIGSEGV);
  577. }
  578. static void __kprobes do_trap(int trapnr, int signr, char *str,
  579. struct pt_regs * regs, long error_code,
  580. siginfo_t *info)
  581. {
  582. struct task_struct *tsk = current;
  583. tsk->thread.error_code = error_code;
  584. tsk->thread.trap_no = trapnr;
  585. if (user_mode(regs)) {
  586. if (exception_trace && unhandled_signal(tsk, signr))
  587. printk(KERN_INFO
  588. "%s[%d] trap %s rip:%lx rsp:%lx error:%lx\n",
  589. tsk->comm, tsk->pid, str,
  590. regs->rip, regs->rsp, error_code);
  591. if (info)
  592. force_sig_info(signr, info, tsk);
  593. else
  594. force_sig(signr, tsk);
  595. return;
  596. }
  597. /* kernel trap */
  598. {
  599. const struct exception_table_entry *fixup;
  600. fixup = search_exception_tables(regs->rip);
  601. if (fixup)
  602. regs->rip = fixup->fixup;
  603. else
  604. die(str, regs, error_code);
  605. return;
  606. }
  607. }
  608. #define DO_ERROR(trapnr, signr, str, name) \
  609. asmlinkage void do_##name(struct pt_regs * regs, long error_code) \
  610. { \
  611. if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
  612. == NOTIFY_STOP) \
  613. return; \
  614. conditional_sti(regs); \
  615. do_trap(trapnr, signr, str, regs, error_code, NULL); \
  616. }
  617. #define DO_ERROR_INFO(trapnr, signr, str, name, sicode, siaddr) \
  618. asmlinkage void do_##name(struct pt_regs * regs, long error_code) \
  619. { \
  620. siginfo_t info; \
  621. info.si_signo = signr; \
  622. info.si_errno = 0; \
  623. info.si_code = sicode; \
  624. info.si_addr = (void __user *)siaddr; \
  625. if (notify_die(DIE_TRAP, str, regs, error_code, trapnr, signr) \
  626. == NOTIFY_STOP) \
  627. return; \
  628. conditional_sti(regs); \
  629. do_trap(trapnr, signr, str, regs, error_code, &info); \
  630. }
  631. DO_ERROR_INFO( 0, SIGFPE, "divide error", divide_error, FPE_INTDIV, regs->rip)
  632. DO_ERROR( 4, SIGSEGV, "overflow", overflow)
  633. DO_ERROR( 5, SIGSEGV, "bounds", bounds)
  634. DO_ERROR_INFO( 6, SIGILL, "invalid opcode", invalid_op, ILL_ILLOPN, regs->rip)
  635. DO_ERROR( 7, SIGSEGV, "device not available", device_not_available)
  636. DO_ERROR( 9, SIGFPE, "coprocessor segment overrun", coprocessor_segment_overrun)
  637. DO_ERROR(10, SIGSEGV, "invalid TSS", invalid_TSS)
  638. DO_ERROR(11, SIGBUS, "segment not present", segment_not_present)
  639. DO_ERROR_INFO(17, SIGBUS, "alignment check", alignment_check, BUS_ADRALN, 0)
  640. DO_ERROR(18, SIGSEGV, "reserved", reserved)
  641. /* Runs on IST stack */
  642. asmlinkage void do_stack_segment(struct pt_regs *regs, long error_code)
  643. {
  644. if (notify_die(DIE_TRAP, "stack segment", regs, error_code,
  645. 12, SIGBUS) == NOTIFY_STOP)
  646. return;
  647. preempt_conditional_sti(regs);
  648. do_trap(12, SIGBUS, "stack segment", regs, error_code, NULL);
  649. preempt_conditional_cli(regs);
  650. }
  651. asmlinkage void do_double_fault(struct pt_regs * regs, long error_code)
  652. {
  653. static const char str[] = "double fault";
  654. struct task_struct *tsk = current;
  655. /* Return not checked because double check cannot be ignored */
  656. notify_die(DIE_TRAP, str, regs, error_code, 8, SIGSEGV);
  657. tsk->thread.error_code = error_code;
  658. tsk->thread.trap_no = 8;
  659. /* This is always a kernel trap and never fixable (and thus must
  660. never return). */
  661. for (;;)
  662. die(str, regs, error_code);
  663. }
  664. asmlinkage void __kprobes do_general_protection(struct pt_regs * regs,
  665. long error_code)
  666. {
  667. struct task_struct *tsk = current;
  668. conditional_sti(regs);
  669. tsk->thread.error_code = error_code;
  670. tsk->thread.trap_no = 13;
  671. if (user_mode(regs)) {
  672. if (exception_trace && unhandled_signal(tsk, SIGSEGV))
  673. printk(KERN_INFO
  674. "%s[%d] general protection rip:%lx rsp:%lx error:%lx\n",
  675. tsk->comm, tsk->pid,
  676. regs->rip, regs->rsp, error_code);
  677. force_sig(SIGSEGV, tsk);
  678. return;
  679. }
  680. /* kernel gp */
  681. {
  682. const struct exception_table_entry *fixup;
  683. fixup = search_exception_tables(regs->rip);
  684. if (fixup) {
  685. regs->rip = fixup->fixup;
  686. return;
  687. }
  688. if (notify_die(DIE_GPF, "general protection fault", regs,
  689. error_code, 13, SIGSEGV) == NOTIFY_STOP)
  690. return;
  691. die("general protection fault", regs, error_code);
  692. }
  693. }
  694. static __kprobes void
  695. mem_parity_error(unsigned char reason, struct pt_regs * regs)
  696. {
  697. printk(KERN_EMERG "Uhhuh. NMI received for unknown reason %02x.\n",
  698. reason);
  699. printk(KERN_EMERG "You probably have a hardware problem with your "
  700. "RAM chips\n");
  701. if (panic_on_unrecovered_nmi)
  702. panic("NMI: Not continuing");
  703. printk(KERN_EMERG "Dazed and confused, but trying to continue\n");
  704. /* Clear and disable the memory parity error line. */
  705. reason = (reason & 0xf) | 4;
  706. outb(reason, 0x61);
  707. }
  708. static __kprobes void
  709. io_check_error(unsigned char reason, struct pt_regs * regs)
  710. {
  711. printk("NMI: IOCK error (debug interrupt?)\n");
  712. show_registers(regs);
  713. /* Re-enable the IOCK line, wait for a few seconds */
  714. reason = (reason & 0xf) | 8;
  715. outb(reason, 0x61);
  716. mdelay(2000);
  717. reason &= ~8;
  718. outb(reason, 0x61);
  719. }
  720. static __kprobes void
  721. unknown_nmi_error(unsigned char reason, struct pt_regs * regs)
  722. {
  723. printk(KERN_EMERG "Uhhuh. NMI received for unknown reason %02x.\n",
  724. reason);
  725. printk(KERN_EMERG "Do you have a strange power saving mode enabled?\n");
  726. if (panic_on_unrecovered_nmi)
  727. panic("NMI: Not continuing");
  728. printk(KERN_EMERG "Dazed and confused, but trying to continue\n");
  729. }
  730. /* Runs on IST stack. This code must keep interrupts off all the time.
  731. Nested NMIs are prevented by the CPU. */
  732. asmlinkage __kprobes void default_do_nmi(struct pt_regs *regs)
  733. {
  734. unsigned char reason = 0;
  735. int cpu;
  736. cpu = smp_processor_id();
  737. /* Only the BSP gets external NMIs from the system. */
  738. if (!cpu)
  739. reason = get_nmi_reason();
  740. if (!(reason & 0xc0)) {
  741. if (notify_die(DIE_NMI_IPI, "nmi_ipi", regs, reason, 2, SIGINT)
  742. == NOTIFY_STOP)
  743. return;
  744. /*
  745. * Ok, so this is none of the documented NMI sources,
  746. * so it must be the NMI watchdog.
  747. */
  748. if (nmi_watchdog_tick(regs,reason))
  749. return;
  750. if (!do_nmi_callback(regs,cpu))
  751. unknown_nmi_error(reason, regs);
  752. return;
  753. }
  754. if (notify_die(DIE_NMI, "nmi", regs, reason, 2, SIGINT) == NOTIFY_STOP)
  755. return;
  756. /* AK: following checks seem to be broken on modern chipsets. FIXME */
  757. if (reason & 0x80)
  758. mem_parity_error(reason, regs);
  759. if (reason & 0x40)
  760. io_check_error(reason, regs);
  761. }
  762. /* runs on IST stack. */
  763. asmlinkage void __kprobes do_int3(struct pt_regs * regs, long error_code)
  764. {
  765. if (notify_die(DIE_INT3, "int3", regs, error_code, 3, SIGTRAP) == NOTIFY_STOP) {
  766. return;
  767. }
  768. preempt_conditional_sti(regs);
  769. do_trap(3, SIGTRAP, "int3", regs, error_code, NULL);
  770. preempt_conditional_cli(regs);
  771. }
  772. /* Help handler running on IST stack to switch back to user stack
  773. for scheduling or signal handling. The actual stack switch is done in
  774. entry.S */
  775. asmlinkage __kprobes struct pt_regs *sync_regs(struct pt_regs *eregs)
  776. {
  777. struct pt_regs *regs = eregs;
  778. /* Did already sync */
  779. if (eregs == (struct pt_regs *)eregs->rsp)
  780. ;
  781. /* Exception from user space */
  782. else if (user_mode(eregs))
  783. regs = task_pt_regs(current);
  784. /* Exception from kernel and interrupts are enabled. Move to
  785. kernel process stack. */
  786. else if (eregs->eflags & X86_EFLAGS_IF)
  787. regs = (struct pt_regs *)(eregs->rsp -= sizeof(struct pt_regs));
  788. if (eregs != regs)
  789. *regs = *eregs;
  790. return regs;
  791. }
  792. /* runs on IST stack. */
  793. asmlinkage void __kprobes do_debug(struct pt_regs * regs,
  794. unsigned long error_code)
  795. {
  796. unsigned long condition;
  797. struct task_struct *tsk = current;
  798. siginfo_t info;
  799. get_debugreg(condition, 6);
  800. if (notify_die(DIE_DEBUG, "debug", regs, condition, error_code,
  801. SIGTRAP) == NOTIFY_STOP)
  802. return;
  803. preempt_conditional_sti(regs);
  804. /* Mask out spurious debug traps due to lazy DR7 setting */
  805. if (condition & (DR_TRAP0|DR_TRAP1|DR_TRAP2|DR_TRAP3)) {
  806. if (!tsk->thread.debugreg7) {
  807. goto clear_dr7;
  808. }
  809. }
  810. tsk->thread.debugreg6 = condition;
  811. /* Mask out spurious TF errors due to lazy TF clearing */
  812. if (condition & DR_STEP) {
  813. /*
  814. * The TF error should be masked out only if the current
  815. * process is not traced and if the TRAP flag has been set
  816. * previously by a tracing process (condition detected by
  817. * the PT_DTRACE flag); remember that the i386 TRAP flag
  818. * can be modified by the process itself in user mode,
  819. * allowing programs to debug themselves without the ptrace()
  820. * interface.
  821. */
  822. if (!user_mode(regs))
  823. goto clear_TF_reenable;
  824. /*
  825. * Was the TF flag set by a debugger? If so, clear it now,
  826. * so that register information is correct.
  827. */
  828. if (tsk->ptrace & PT_DTRACE) {
  829. regs->eflags &= ~TF_MASK;
  830. tsk->ptrace &= ~PT_DTRACE;
  831. }
  832. }
  833. /* Ok, finally something we can handle */
  834. tsk->thread.trap_no = 1;
  835. tsk->thread.error_code = error_code;
  836. info.si_signo = SIGTRAP;
  837. info.si_errno = 0;
  838. info.si_code = TRAP_BRKPT;
  839. info.si_addr = user_mode(regs) ? (void __user *)regs->rip : NULL;
  840. force_sig_info(SIGTRAP, &info, tsk);
  841. clear_dr7:
  842. set_debugreg(0UL, 7);
  843. preempt_conditional_cli(regs);
  844. return;
  845. clear_TF_reenable:
  846. set_tsk_thread_flag(tsk, TIF_SINGLESTEP);
  847. regs->eflags &= ~TF_MASK;
  848. preempt_conditional_cli(regs);
  849. }
  850. static int kernel_math_error(struct pt_regs *regs, const char *str, int trapnr)
  851. {
  852. const struct exception_table_entry *fixup;
  853. fixup = search_exception_tables(regs->rip);
  854. if (fixup) {
  855. regs->rip = fixup->fixup;
  856. return 1;
  857. }
  858. notify_die(DIE_GPF, str, regs, 0, trapnr, SIGFPE);
  859. /* Illegal floating point operation in the kernel */
  860. current->thread.trap_no = trapnr;
  861. die(str, regs, 0);
  862. return 0;
  863. }
  864. /*
  865. * Note that we play around with the 'TS' bit in an attempt to get
  866. * the correct behaviour even in the presence of the asynchronous
  867. * IRQ13 behaviour
  868. */
  869. asmlinkage void do_coprocessor_error(struct pt_regs *regs)
  870. {
  871. void __user *rip = (void __user *)(regs->rip);
  872. struct task_struct * task;
  873. siginfo_t info;
  874. unsigned short cwd, swd;
  875. conditional_sti(regs);
  876. if (!user_mode(regs) &&
  877. kernel_math_error(regs, "kernel x87 math error", 16))
  878. return;
  879. /*
  880. * Save the info for the exception handler and clear the error.
  881. */
  882. task = current;
  883. save_init_fpu(task);
  884. task->thread.trap_no = 16;
  885. task->thread.error_code = 0;
  886. info.si_signo = SIGFPE;
  887. info.si_errno = 0;
  888. info.si_code = __SI_FAULT;
  889. info.si_addr = rip;
  890. /*
  891. * (~cwd & swd) will mask out exceptions that are not set to unmasked
  892. * status. 0x3f is the exception bits in these regs, 0x200 is the
  893. * C1 reg you need in case of a stack fault, 0x040 is the stack
  894. * fault bit. We should only be taking one exception at a time,
  895. * so if this combination doesn't produce any single exception,
  896. * then we have a bad program that isn't synchronizing its FPU usage
  897. * and it will suffer the consequences since we won't be able to
  898. * fully reproduce the context of the exception
  899. */
  900. cwd = get_fpu_cwd(task);
  901. swd = get_fpu_swd(task);
  902. switch (swd & ~cwd & 0x3f) {
  903. case 0x000:
  904. default:
  905. break;
  906. case 0x001: /* Invalid Op */
  907. /*
  908. * swd & 0x240 == 0x040: Stack Underflow
  909. * swd & 0x240 == 0x240: Stack Overflow
  910. * User must clear the SF bit (0x40) if set
  911. */
  912. info.si_code = FPE_FLTINV;
  913. break;
  914. case 0x002: /* Denormalize */
  915. case 0x010: /* Underflow */
  916. info.si_code = FPE_FLTUND;
  917. break;
  918. case 0x004: /* Zero Divide */
  919. info.si_code = FPE_FLTDIV;
  920. break;
  921. case 0x008: /* Overflow */
  922. info.si_code = FPE_FLTOVF;
  923. break;
  924. case 0x020: /* Precision */
  925. info.si_code = FPE_FLTRES;
  926. break;
  927. }
  928. force_sig_info(SIGFPE, &info, task);
  929. }
  930. asmlinkage void bad_intr(void)
  931. {
  932. printk("bad interrupt");
  933. }
  934. asmlinkage void do_simd_coprocessor_error(struct pt_regs *regs)
  935. {
  936. void __user *rip = (void __user *)(regs->rip);
  937. struct task_struct * task;
  938. siginfo_t info;
  939. unsigned short mxcsr;
  940. conditional_sti(regs);
  941. if (!user_mode(regs) &&
  942. kernel_math_error(regs, "kernel simd math error", 19))
  943. return;
  944. /*
  945. * Save the info for the exception handler and clear the error.
  946. */
  947. task = current;
  948. save_init_fpu(task);
  949. task->thread.trap_no = 19;
  950. task->thread.error_code = 0;
  951. info.si_signo = SIGFPE;
  952. info.si_errno = 0;
  953. info.si_code = __SI_FAULT;
  954. info.si_addr = rip;
  955. /*
  956. * The SIMD FPU exceptions are handled a little differently, as there
  957. * is only a single status/control register. Thus, to determine which
  958. * unmasked exception was caught we must mask the exception mask bits
  959. * at 0x1f80, and then use these to mask the exception bits at 0x3f.
  960. */
  961. mxcsr = get_fpu_mxcsr(task);
  962. switch (~((mxcsr & 0x1f80) >> 7) & (mxcsr & 0x3f)) {
  963. case 0x000:
  964. default:
  965. break;
  966. case 0x001: /* Invalid Op */
  967. info.si_code = FPE_FLTINV;
  968. break;
  969. case 0x002: /* Denormalize */
  970. case 0x010: /* Underflow */
  971. info.si_code = FPE_FLTUND;
  972. break;
  973. case 0x004: /* Zero Divide */
  974. info.si_code = FPE_FLTDIV;
  975. break;
  976. case 0x008: /* Overflow */
  977. info.si_code = FPE_FLTOVF;
  978. break;
  979. case 0x020: /* Precision */
  980. info.si_code = FPE_FLTRES;
  981. break;
  982. }
  983. force_sig_info(SIGFPE, &info, task);
  984. }
  985. asmlinkage void do_spurious_interrupt_bug(struct pt_regs * regs)
  986. {
  987. }
  988. asmlinkage void __attribute__((weak)) smp_thermal_interrupt(void)
  989. {
  990. }
  991. asmlinkage void __attribute__((weak)) mce_threshold_interrupt(void)
  992. {
  993. }
  994. /*
  995. * 'math_state_restore()' saves the current math information in the
  996. * old math state array, and gets the new ones from the current task
  997. *
  998. * Careful.. There are problems with IBM-designed IRQ13 behaviour.
  999. * Don't touch unless you *really* know how it works.
  1000. */
  1001. asmlinkage void math_state_restore(void)
  1002. {
  1003. struct task_struct *me = current;
  1004. clts(); /* Allow maths ops (or we recurse) */
  1005. if (!used_math())
  1006. init_fpu(me);
  1007. restore_fpu_checking(&me->thread.i387.fxsave);
  1008. task_thread_info(me)->status |= TS_USEDFPU;
  1009. me->fpu_counter++;
  1010. }
  1011. void __init trap_init(void)
  1012. {
  1013. set_intr_gate(0,&divide_error);
  1014. set_intr_gate_ist(1,&debug,DEBUG_STACK);
  1015. set_intr_gate_ist(2,&nmi,NMI_STACK);
  1016. set_system_gate_ist(3,&int3,DEBUG_STACK); /* int3 can be called from all */
  1017. set_system_gate(4,&overflow); /* int4 can be called from all */
  1018. set_intr_gate(5,&bounds);
  1019. set_intr_gate(6,&invalid_op);
  1020. set_intr_gate(7,&device_not_available);
  1021. set_intr_gate_ist(8,&double_fault, DOUBLEFAULT_STACK);
  1022. set_intr_gate(9,&coprocessor_segment_overrun);
  1023. set_intr_gate(10,&invalid_TSS);
  1024. set_intr_gate(11,&segment_not_present);
  1025. set_intr_gate_ist(12,&stack_segment,STACKFAULT_STACK);
  1026. set_intr_gate(13,&general_protection);
  1027. set_intr_gate(14,&page_fault);
  1028. set_intr_gate(15,&spurious_interrupt_bug);
  1029. set_intr_gate(16,&coprocessor_error);
  1030. set_intr_gate(17,&alignment_check);
  1031. #ifdef CONFIG_X86_MCE
  1032. set_intr_gate_ist(18,&machine_check, MCE_STACK);
  1033. #endif
  1034. set_intr_gate(19,&simd_coprocessor_error);
  1035. #ifdef CONFIG_IA32_EMULATION
  1036. set_system_gate(IA32_SYSCALL_VECTOR, ia32_syscall);
  1037. #endif
  1038. /*
  1039. * Should be a barrier for any external CPU state.
  1040. */
  1041. cpu_init();
  1042. }
  1043. static int __init oops_setup(char *s)
  1044. {
  1045. if (!s)
  1046. return -EINVAL;
  1047. if (!strcmp(s, "panic"))
  1048. panic_on_oops = 1;
  1049. return 0;
  1050. }
  1051. early_param("oops", oops_setup);
  1052. static int __init kstack_setup(char *s)
  1053. {
  1054. if (!s)
  1055. return -EINVAL;
  1056. kstack_depth_to_print = simple_strtoul(s,NULL,0);
  1057. return 0;
  1058. }
  1059. early_param("kstack", kstack_setup);
  1060. #ifdef CONFIG_STACK_UNWIND
  1061. static int __init call_trace_setup(char *s)
  1062. {
  1063. if (!s)
  1064. return -EINVAL;
  1065. if (strcmp(s, "old") == 0)
  1066. call_trace = -1;
  1067. else if (strcmp(s, "both") == 0)
  1068. call_trace = 0;
  1069. else if (strcmp(s, "newfallback") == 0)
  1070. call_trace = 1;
  1071. else if (strcmp(s, "new") == 0)
  1072. call_trace = 2;
  1073. return 0;
  1074. }
  1075. early_param("call_trace", call_trace_setup);
  1076. #endif