sysrq.c 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
  1. /*
  2. * Copyright (C) 2001 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
  3. * Copyright (C) 2013 Richard Weinberger <richrd@nod.at>
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2 as
  7. * published by the Free Software Foundation.
  8. */
  9. #include <linux/kallsyms.h>
  10. #include <linux/kernel.h>
  11. #include <linux/module.h>
  12. #include <linux/sched.h>
  13. #include <linux/sched/debug.h>
  14. #include <linux/sched/task_stack.h>
  15. #include <asm/sysrq.h>
  16. #include <asm/stacktrace.h>
  17. #include <os.h>
  18. static void _print_addr(void *data, unsigned long address, int reliable)
  19. {
  20. pr_info(" [<%08lx>] %s%pF\n", address, reliable ? "" : "? ",
  21. (void *)address);
  22. }
  23. static const struct stacktrace_ops stackops = {
  24. .address = _print_addr
  25. };
  26. void show_stack(struct task_struct *task, unsigned long *stack)
  27. {
  28. unsigned long *sp = stack;
  29. struct pt_regs *segv_regs = current->thread.segv_regs;
  30. int i;
  31. if (!segv_regs && os_is_signal_stack()) {
  32. pr_err("Received SIGSEGV in SIGSEGV handler,"
  33. " aborting stack trace!\n");
  34. return;
  35. }
  36. if (!stack)
  37. sp = get_stack_pointer(task, segv_regs);
  38. pr_info("Stack:\n");
  39. stack = sp;
  40. for (i = 0; i < 3 * STACKSLOTS_PER_LINE; i++) {
  41. if (kstack_end(stack))
  42. break;
  43. if (i && ((i % STACKSLOTS_PER_LINE) == 0))
  44. pr_cont("\n");
  45. pr_cont(" %08lx", *stack++);
  46. }
  47. pr_cont("\n");
  48. pr_info("Call Trace:\n");
  49. dump_trace(current, &stackops, NULL);
  50. pr_info("\n");
  51. }