dumpstack.c 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366
  1. /*
  2. * Copyright (C) 1991, 1992 Linus Torvalds
  3. * Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
  4. */
  5. #include <linux/kallsyms.h>
  6. #include <linux/kprobes.h>
  7. #include <linux/uaccess.h>
  8. #include <linux/utsname.h>
  9. #include <linux/hardirq.h>
  10. #include <linux/kdebug.h>
  11. #include <linux/module.h>
  12. #include <linux/ptrace.h>
  13. #include <linux/ftrace.h>
  14. #include <linux/kexec.h>
  15. #include <linux/bug.h>
  16. #include <linux/nmi.h>
  17. #include <linux/sysfs.h>
  18. #include <asm/stacktrace.h>
  19. int panic_on_unrecovered_nmi;
  20. int panic_on_io_nmi;
  21. unsigned int code_bytes = 64;
  22. int kstack_depth_to_print = 3 * STACKSLOTS_PER_LINE;
  23. static int die_counter;
  24. static void printk_stack_address(unsigned long address, int reliable,
  25. void *data)
  26. {
  27. printk("%s [<%p>] %s%pB\n",
  28. (char *)data, (void *)address, reliable ? "" : "? ",
  29. (void *)address);
  30. }
  31. void printk_address(unsigned long address)
  32. {
  33. pr_cont(" [<%p>] %pS\n", (void *)address, (void *)address);
  34. }
  35. #ifdef CONFIG_FUNCTION_GRAPH_TRACER
  36. static void
  37. print_ftrace_graph_addr(unsigned long addr, void *data,
  38. const struct stacktrace_ops *ops,
  39. struct task_struct *task, int *graph)
  40. {
  41. unsigned long ret_addr;
  42. int index;
  43. if (addr != (unsigned long)return_to_handler)
  44. return;
  45. index = task->curr_ret_stack;
  46. if (!task->ret_stack || index < *graph)
  47. return;
  48. index -= *graph;
  49. ret_addr = task->ret_stack[index].ret;
  50. ops->address(data, ret_addr, 1);
  51. (*graph)++;
  52. }
  53. #else
  54. static inline void
  55. print_ftrace_graph_addr(unsigned long addr, void *data,
  56. const struct stacktrace_ops *ops,
  57. struct task_struct *task, int *graph)
  58. { }
  59. #endif
  60. /*
  61. * x86-64 can have up to three kernel stacks:
  62. * process stack
  63. * interrupt stack
  64. * severe exception (double fault, nmi, stack fault, debug, mce) hardware stack
  65. */
  66. static inline int valid_stack_ptr(struct task_struct *task,
  67. void *p, unsigned int size, void *end)
  68. {
  69. void *t = task_stack_page(task);
  70. if (end) {
  71. if (p < end && p >= (end-THREAD_SIZE))
  72. return 1;
  73. else
  74. return 0;
  75. }
  76. return p >= t && p < t + THREAD_SIZE - size;
  77. }
  78. unsigned long
  79. print_context_stack(struct task_struct *task,
  80. unsigned long *stack, unsigned long bp,
  81. const struct stacktrace_ops *ops, void *data,
  82. unsigned long *end, int *graph)
  83. {
  84. struct stack_frame *frame = (struct stack_frame *)bp;
  85. /*
  86. * If we overflowed the stack into a guard page, jump back to the
  87. * bottom of the usable stack.
  88. */
  89. if ((unsigned long)task_stack_page(task) - (unsigned long)stack <
  90. PAGE_SIZE)
  91. stack = (unsigned long *)task_stack_page(task);
  92. while (valid_stack_ptr(task, stack, sizeof(*stack), end)) {
  93. unsigned long addr;
  94. addr = *stack;
  95. if (__kernel_text_address(addr)) {
  96. if ((unsigned long) stack == bp + sizeof(long)) {
  97. ops->address(data, addr, 1);
  98. frame = frame->next_frame;
  99. bp = (unsigned long) frame;
  100. } else {
  101. ops->address(data, addr, 0);
  102. }
  103. print_ftrace_graph_addr(addr, data, ops, task, graph);
  104. }
  105. stack++;
  106. }
  107. return bp;
  108. }
  109. EXPORT_SYMBOL_GPL(print_context_stack);
  110. unsigned long
  111. print_context_stack_bp(struct task_struct *task,
  112. unsigned long *stack, unsigned long bp,
  113. const struct stacktrace_ops *ops, void *data,
  114. unsigned long *end, int *graph)
  115. {
  116. struct stack_frame *frame = (struct stack_frame *)bp;
  117. unsigned long *ret_addr = &frame->return_address;
  118. while (valid_stack_ptr(task, ret_addr, sizeof(*ret_addr), end)) {
  119. unsigned long addr = *ret_addr;
  120. if (!__kernel_text_address(addr))
  121. break;
  122. if (ops->address(data, addr, 1))
  123. break;
  124. frame = frame->next_frame;
  125. ret_addr = &frame->return_address;
  126. print_ftrace_graph_addr(addr, data, ops, task, graph);
  127. }
  128. return (unsigned long)frame;
  129. }
  130. EXPORT_SYMBOL_GPL(print_context_stack_bp);
  131. static int print_trace_stack(void *data, char *name)
  132. {
  133. printk("%s <%s> ", (char *)data, name);
  134. return 0;
  135. }
  136. /*
  137. * Print one address/symbol entries per line.
  138. */
  139. static int print_trace_address(void *data, unsigned long addr, int reliable)
  140. {
  141. touch_nmi_watchdog();
  142. printk_stack_address(addr, reliable, data);
  143. return 0;
  144. }
  145. static const struct stacktrace_ops print_trace_ops = {
  146. .stack = print_trace_stack,
  147. .address = print_trace_address,
  148. .walk_stack = print_context_stack,
  149. };
  150. void
  151. show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs,
  152. unsigned long *stack, unsigned long bp, char *log_lvl)
  153. {
  154. printk("%sCall Trace:\n", log_lvl);
  155. dump_trace(task, regs, stack, bp, &print_trace_ops, log_lvl);
  156. }
  157. void show_trace(struct task_struct *task, struct pt_regs *regs,
  158. unsigned long *stack, unsigned long bp)
  159. {
  160. show_trace_log_lvl(task, regs, stack, bp, "");
  161. }
  162. void show_stack(struct task_struct *task, unsigned long *sp)
  163. {
  164. unsigned long bp = 0;
  165. unsigned long stack;
  166. /*
  167. * Stack frames below this one aren't interesting. Don't show them
  168. * if we're printing for %current.
  169. */
  170. if (!sp && (!task || task == current)) {
  171. sp = &stack;
  172. bp = stack_frame(current, NULL);
  173. }
  174. show_stack_log_lvl(task, NULL, sp, bp, "");
  175. }
  176. void show_stack_regs(struct pt_regs *regs)
  177. {
  178. show_stack_log_lvl(current, regs, (unsigned long *)regs->sp, regs->bp, "");
  179. }
  180. static arch_spinlock_t die_lock = __ARCH_SPIN_LOCK_UNLOCKED;
  181. static int die_owner = -1;
  182. static unsigned int die_nest_count;
  183. unsigned long oops_begin(void)
  184. {
  185. int cpu;
  186. unsigned long flags;
  187. oops_enter();
  188. /* racy, but better than risking deadlock. */
  189. raw_local_irq_save(flags);
  190. cpu = smp_processor_id();
  191. if (!arch_spin_trylock(&die_lock)) {
  192. if (cpu == die_owner)
  193. /* nested oops. should stop eventually */;
  194. else
  195. arch_spin_lock(&die_lock);
  196. }
  197. die_nest_count++;
  198. die_owner = cpu;
  199. console_verbose();
  200. bust_spinlocks(1);
  201. return flags;
  202. }
  203. EXPORT_SYMBOL_GPL(oops_begin);
  204. NOKPROBE_SYMBOL(oops_begin);
  205. void __noreturn rewind_stack_do_exit(int signr);
  206. void oops_end(unsigned long flags, struct pt_regs *regs, int signr)
  207. {
  208. if (regs && kexec_should_crash(current))
  209. crash_kexec(regs);
  210. bust_spinlocks(0);
  211. die_owner = -1;
  212. add_taint(TAINT_DIE, LOCKDEP_NOW_UNRELIABLE);
  213. die_nest_count--;
  214. if (!die_nest_count)
  215. /* Nest count reaches zero, release the lock. */
  216. arch_spin_unlock(&die_lock);
  217. raw_local_irq_restore(flags);
  218. oops_exit();
  219. if (!signr)
  220. return;
  221. if (in_interrupt())
  222. panic("Fatal exception in interrupt");
  223. if (panic_on_oops)
  224. panic("Fatal exception");
  225. /*
  226. * We're not going to return, but we might be on an IST stack or
  227. * have very little stack space left. Rewind the stack and kill
  228. * the task.
  229. */
  230. rewind_stack_do_exit(signr);
  231. }
  232. NOKPROBE_SYMBOL(oops_end);
  233. int __die(const char *str, struct pt_regs *regs, long err)
  234. {
  235. #ifdef CONFIG_X86_32
  236. unsigned short ss;
  237. unsigned long sp;
  238. #endif
  239. printk(KERN_DEFAULT
  240. "%s: %04lx [#%d]%s%s%s%s\n", str, err & 0xffff, ++die_counter,
  241. IS_ENABLED(CONFIG_PREEMPT) ? " PREEMPT" : "",
  242. IS_ENABLED(CONFIG_SMP) ? " SMP" : "",
  243. debug_pagealloc_enabled() ? " DEBUG_PAGEALLOC" : "",
  244. IS_ENABLED(CONFIG_KASAN) ? " KASAN" : "");
  245. if (notify_die(DIE_OOPS, str, regs, err,
  246. current->thread.trap_nr, SIGSEGV) == NOTIFY_STOP)
  247. return 1;
  248. print_modules();
  249. show_regs(regs);
  250. #ifdef CONFIG_X86_32
  251. if (user_mode(regs)) {
  252. sp = regs->sp;
  253. ss = regs->ss & 0xffff;
  254. } else {
  255. sp = kernel_stack_pointer(regs);
  256. savesegment(ss, ss);
  257. }
  258. printk(KERN_EMERG "EIP: [<%08lx>] ", regs->ip);
  259. print_symbol("%s", regs->ip);
  260. printk(" SS:ESP %04x:%08lx\n", ss, sp);
  261. #else
  262. /* Executive summary in case the oops scrolled away */
  263. printk(KERN_ALERT "RIP ");
  264. printk_address(regs->ip);
  265. printk(" RSP <%016lx>\n", regs->sp);
  266. #endif
  267. return 0;
  268. }
  269. NOKPROBE_SYMBOL(__die);
  270. /*
  271. * This is gone through when something in the kernel has done something bad
  272. * and is about to be terminated:
  273. */
  274. void die(const char *str, struct pt_regs *regs, long err)
  275. {
  276. unsigned long flags = oops_begin();
  277. int sig = SIGSEGV;
  278. if (!user_mode(regs))
  279. report_bug(regs->ip, regs);
  280. if (__die(str, regs, err))
  281. sig = 0;
  282. oops_end(flags, regs, sig);
  283. }
  284. static int __init kstack_setup(char *s)
  285. {
  286. ssize_t ret;
  287. unsigned long val;
  288. if (!s)
  289. return -EINVAL;
  290. ret = kstrtoul(s, 0, &val);
  291. if (ret)
  292. return ret;
  293. kstack_depth_to_print = val;
  294. return 0;
  295. }
  296. early_param("kstack", kstack_setup);
  297. static int __init code_bytes_setup(char *s)
  298. {
  299. ssize_t ret;
  300. unsigned long val;
  301. if (!s)
  302. return -EINVAL;
  303. ret = kstrtoul(s, 0, &val);
  304. if (ret)
  305. return ret;
  306. code_bytes = val;
  307. if (code_bytes > 8192)
  308. code_bytes = 8192;
  309. return 1;
  310. }
  311. __setup("code_bytes=", code_bytes_setup);