stack.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517
  1. /*
  2. * Copyright 2010 Tilera Corporation. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License
  6. * as published by the Free Software Foundation, version 2.
  7. *
  8. * This program is distributed in the hope that it will be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
  11. * NON INFRINGEMENT. See the GNU General Public License for
  12. * more details.
  13. */
  14. #include <linux/sched.h>
  15. #include <linux/kernel.h>
  16. #include <linux/kprobes.h>
  17. #include <linux/module.h>
  18. #include <linux/pfn.h>
  19. #include <linux/kallsyms.h>
  20. #include <linux/stacktrace.h>
  21. #include <linux/uaccess.h>
  22. #include <linux/mmzone.h>
  23. #include <linux/dcache.h>
  24. #include <linux/fs.h>
  25. #include <linux/string.h>
  26. #include <asm/backtrace.h>
  27. #include <asm/page.h>
  28. #include <asm/ucontext.h>
  29. #include <asm/switch_to.h>
  30. #include <asm/sigframe.h>
  31. #include <asm/stack.h>
  32. #include <asm/vdso.h>
  33. #include <arch/abi.h>
  34. #include <arch/interrupts.h>
  35. #define KBT_ONGOING 0 /* Backtrace still ongoing */
  36. #define KBT_DONE 1 /* Backtrace cleanly completed */
  37. #define KBT_RUNNING 2 /* Can't run backtrace on a running task */
  38. #define KBT_LOOP 3 /* Backtrace entered a loop */
  39. /* Is address on the specified kernel stack? */
  40. static int in_kernel_stack(struct KBacktraceIterator *kbt, unsigned long sp)
  41. {
  42. ulong kstack_base = (ulong) kbt->task->stack;
  43. if (kstack_base == 0) /* corrupt task pointer; just follow stack... */
  44. return sp >= PAGE_OFFSET && sp < (unsigned long)high_memory;
  45. return sp >= kstack_base && sp < kstack_base + THREAD_SIZE;
  46. }
  47. /* Callback for backtracer; basically a glorified memcpy */
  48. static bool read_memory_func(void *result, unsigned long address,
  49. unsigned int size, void *vkbt)
  50. {
  51. int retval;
  52. struct KBacktraceIterator *kbt = (struct KBacktraceIterator *)vkbt;
  53. if (address == 0)
  54. return 0;
  55. if (__kernel_text_address(address)) {
  56. /* OK to read kernel code. */
  57. } else if (address >= PAGE_OFFSET) {
  58. /* We only tolerate kernel-space reads of this task's stack */
  59. if (!in_kernel_stack(kbt, address))
  60. return 0;
  61. } else if (!kbt->is_current) {
  62. return 0; /* can't read from other user address spaces */
  63. }
  64. pagefault_disable();
  65. retval = __copy_from_user_inatomic(result,
  66. (void __user __force *)address,
  67. size);
  68. pagefault_enable();
  69. return (retval == 0);
  70. }
  71. /* Return a pt_regs pointer for a valid fault handler frame */
  72. static struct pt_regs *valid_fault_handler(struct KBacktraceIterator* kbt)
  73. {
  74. const char *fault = NULL; /* happy compiler */
  75. char fault_buf[64];
  76. unsigned long sp = kbt->it.sp;
  77. struct pt_regs *p;
  78. if (sp % sizeof(long) != 0)
  79. return NULL;
  80. if (!in_kernel_stack(kbt, sp))
  81. return NULL;
  82. if (!in_kernel_stack(kbt, sp + C_ABI_SAVE_AREA_SIZE + PTREGS_SIZE-1))
  83. return NULL;
  84. p = (struct pt_regs *)(sp + C_ABI_SAVE_AREA_SIZE);
  85. if (p->faultnum == INT_SWINT_1 || p->faultnum == INT_SWINT_1_SIGRETURN)
  86. fault = "syscall";
  87. else {
  88. if (kbt->verbose) { /* else we aren't going to use it */
  89. snprintf(fault_buf, sizeof(fault_buf),
  90. "interrupt %ld", p->faultnum);
  91. fault = fault_buf;
  92. }
  93. }
  94. if (EX1_PL(p->ex1) == KERNEL_PL &&
  95. __kernel_text_address(p->pc) &&
  96. in_kernel_stack(kbt, p->sp) &&
  97. p->sp >= sp) {
  98. if (kbt->verbose)
  99. pr_err(" <%s while in kernel mode>\n", fault);
  100. } else if (user_mode(p) &&
  101. p->sp < PAGE_OFFSET && p->sp != 0) {
  102. if (kbt->verbose)
  103. pr_err(" <%s while in user mode>\n", fault);
  104. } else if (kbt->verbose) {
  105. pr_err(" (odd fault: pc %#lx, sp %#lx, ex1 %#lx?)\n",
  106. p->pc, p->sp, p->ex1);
  107. p = NULL;
  108. }
  109. if (!kbt->profile || ((1ULL << p->faultnum) & QUEUED_INTERRUPTS) == 0)
  110. return p;
  111. return NULL;
  112. }
  113. /* Is the pc pointing to a sigreturn trampoline? */
  114. static int is_sigreturn(unsigned long pc)
  115. {
  116. return current->mm && (pc == VDSO_SYM(&__vdso_rt_sigreturn));
  117. }
  118. /* Return a pt_regs pointer for a valid signal handler frame */
  119. static struct pt_regs *valid_sigframe(struct KBacktraceIterator* kbt,
  120. struct rt_sigframe* kframe)
  121. {
  122. BacktraceIterator *b = &kbt->it;
  123. if (is_sigreturn(b->pc) && b->sp < PAGE_OFFSET &&
  124. b->sp % sizeof(long) == 0) {
  125. int retval;
  126. pagefault_disable();
  127. retval = __copy_from_user_inatomic(
  128. kframe, (void __user __force *)b->sp,
  129. sizeof(*kframe));
  130. pagefault_enable();
  131. if (retval != 0 ||
  132. (unsigned int)(kframe->info.si_signo) >= _NSIG)
  133. return NULL;
  134. if (kbt->verbose) {
  135. pr_err(" <received signal %d>\n",
  136. kframe->info.si_signo);
  137. }
  138. return (struct pt_regs *)&kframe->uc.uc_mcontext;
  139. }
  140. return NULL;
  141. }
  142. static int KBacktraceIterator_is_sigreturn(struct KBacktraceIterator *kbt)
  143. {
  144. return is_sigreturn(kbt->it.pc);
  145. }
  146. static int KBacktraceIterator_restart(struct KBacktraceIterator *kbt)
  147. {
  148. struct pt_regs *p;
  149. struct rt_sigframe kframe;
  150. p = valid_fault_handler(kbt);
  151. if (p == NULL)
  152. p = valid_sigframe(kbt, &kframe);
  153. if (p == NULL)
  154. return 0;
  155. backtrace_init(&kbt->it, read_memory_func, kbt,
  156. p->pc, p->lr, p->sp, p->regs[52]);
  157. kbt->new_context = 1;
  158. return 1;
  159. }
  160. /* Find a frame that isn't a sigreturn, if there is one. */
  161. static int KBacktraceIterator_next_item_inclusive(
  162. struct KBacktraceIterator *kbt)
  163. {
  164. for (;;) {
  165. do {
  166. if (!KBacktraceIterator_is_sigreturn(kbt))
  167. return KBT_ONGOING;
  168. } while (backtrace_next(&kbt->it));
  169. if (!KBacktraceIterator_restart(kbt))
  170. return KBT_DONE;
  171. }
  172. }
  173. /*
  174. * If the current sp is on a page different than what we recorded
  175. * as the top-of-kernel-stack last time we context switched, we have
  176. * probably blown the stack, and nothing is going to work out well.
  177. * If we can at least get out a warning, that may help the debug,
  178. * though we probably won't be able to backtrace into the code that
  179. * actually did the recursive damage.
  180. */
  181. static void validate_stack(struct pt_regs *regs)
  182. {
  183. int cpu = raw_smp_processor_id();
  184. unsigned long ksp0 = get_current_ksp0();
  185. unsigned long ksp0_base = ksp0 & -THREAD_SIZE;
  186. unsigned long sp = stack_pointer;
  187. if (EX1_PL(regs->ex1) == KERNEL_PL && regs->sp >= ksp0) {
  188. pr_err("WARNING: cpu %d: kernel stack %#lx..%#lx underrun!\n"
  189. " sp %#lx (%#lx in caller), caller pc %#lx, lr %#lx\n",
  190. cpu, ksp0_base, ksp0, sp, regs->sp, regs->pc, regs->lr);
  191. }
  192. else if (sp < ksp0_base + sizeof(struct thread_info)) {
  193. pr_err("WARNING: cpu %d: kernel stack %#lx..%#lx overrun!\n"
  194. " sp %#lx (%#lx in caller), caller pc %#lx, lr %#lx\n",
  195. cpu, ksp0_base, ksp0, sp, regs->sp, regs->pc, regs->lr);
  196. }
  197. }
  198. void KBacktraceIterator_init(struct KBacktraceIterator *kbt,
  199. struct task_struct *t, struct pt_regs *regs)
  200. {
  201. unsigned long pc, lr, sp, r52;
  202. int is_current;
  203. /*
  204. * Set up callback information. We grab the kernel stack base
  205. * so we will allow reads of that address range.
  206. */
  207. is_current = (t == NULL || t == current);
  208. kbt->is_current = is_current;
  209. if (is_current)
  210. t = validate_current();
  211. kbt->task = t;
  212. kbt->verbose = 0; /* override in caller if desired */
  213. kbt->profile = 0; /* override in caller if desired */
  214. kbt->end = KBT_ONGOING;
  215. kbt->new_context = 1;
  216. if (is_current)
  217. validate_stack(regs);
  218. if (regs == NULL) {
  219. if (is_current || t->state == TASK_RUNNING) {
  220. /* Can't do this; we need registers */
  221. kbt->end = KBT_RUNNING;
  222. return;
  223. }
  224. pc = get_switch_to_pc();
  225. lr = t->thread.pc;
  226. sp = t->thread.ksp;
  227. r52 = 0;
  228. } else {
  229. pc = regs->pc;
  230. lr = regs->lr;
  231. sp = regs->sp;
  232. r52 = regs->regs[52];
  233. }
  234. backtrace_init(&kbt->it, read_memory_func, kbt, pc, lr, sp, r52);
  235. kbt->end = KBacktraceIterator_next_item_inclusive(kbt);
  236. }
  237. EXPORT_SYMBOL(KBacktraceIterator_init);
  238. int KBacktraceIterator_end(struct KBacktraceIterator *kbt)
  239. {
  240. return kbt->end != KBT_ONGOING;
  241. }
  242. EXPORT_SYMBOL(KBacktraceIterator_end);
  243. void KBacktraceIterator_next(struct KBacktraceIterator *kbt)
  244. {
  245. unsigned long old_pc = kbt->it.pc, old_sp = kbt->it.sp;
  246. kbt->new_context = 0;
  247. if (!backtrace_next(&kbt->it) && !KBacktraceIterator_restart(kbt)) {
  248. kbt->end = KBT_DONE;
  249. return;
  250. }
  251. kbt->end = KBacktraceIterator_next_item_inclusive(kbt);
  252. if (old_pc == kbt->it.pc && old_sp == kbt->it.sp) {
  253. /* Trapped in a loop; give up. */
  254. kbt->end = KBT_LOOP;
  255. }
  256. }
  257. EXPORT_SYMBOL(KBacktraceIterator_next);
  258. static void describe_addr(struct KBacktraceIterator *kbt,
  259. unsigned long address,
  260. int have_mmap_sem, char *buf, size_t bufsize)
  261. {
  262. struct vm_area_struct *vma;
  263. size_t namelen, remaining;
  264. unsigned long size, offset, adjust;
  265. char *p, *modname;
  266. const char *name;
  267. int rc;
  268. /*
  269. * Look one byte back for every caller frame (i.e. those that
  270. * aren't a new context) so we look up symbol data for the
  271. * call itself, not the following instruction, which may be on
  272. * a different line (or in a different function).
  273. */
  274. adjust = !kbt->new_context;
  275. address -= adjust;
  276. if (address >= PAGE_OFFSET) {
  277. /* Handle kernel symbols. */
  278. BUG_ON(bufsize < KSYM_NAME_LEN);
  279. name = kallsyms_lookup(address, &size, &offset,
  280. &modname, buf);
  281. if (name == NULL) {
  282. buf[0] = '\0';
  283. return;
  284. }
  285. namelen = strlen(buf);
  286. remaining = (bufsize - 1) - namelen;
  287. p = buf + namelen;
  288. rc = snprintf(p, remaining, "+%#lx/%#lx ",
  289. offset + adjust, size);
  290. if (modname && rc < remaining)
  291. snprintf(p + rc, remaining - rc, "[%s] ", modname);
  292. buf[bufsize-1] = '\0';
  293. return;
  294. }
  295. /* If we don't have the mmap_sem, we can't show any more info. */
  296. buf[0] = '\0';
  297. if (!have_mmap_sem)
  298. return;
  299. /* Find vma info. */
  300. vma = find_vma(kbt->task->mm, address);
  301. if (vma == NULL || address < vma->vm_start) {
  302. snprintf(buf, bufsize, "[unmapped address] ");
  303. return;
  304. }
  305. if (vma->vm_file) {
  306. p = d_path(&vma->vm_file->f_path, buf, bufsize);
  307. if (IS_ERR(p))
  308. p = "?";
  309. name = kbasename(p);
  310. } else {
  311. name = "anon";
  312. }
  313. /* Generate a string description of the vma info. */
  314. namelen = strlen(name);
  315. remaining = (bufsize - 1) - namelen;
  316. memmove(buf, name, namelen);
  317. snprintf(buf + namelen, remaining, "[%lx+%lx] ",
  318. vma->vm_start, vma->vm_end - vma->vm_start);
  319. }
  320. /*
  321. * Avoid possible crash recursion during backtrace. If it happens, it
  322. * makes it easy to lose the actual root cause of the failure, so we
  323. * put a simple guard on all the backtrace loops.
  324. */
  325. static bool start_backtrace(void)
  326. {
  327. if (current->thread.in_backtrace) {
  328. pr_err("Backtrace requested while in backtrace!\n");
  329. return false;
  330. }
  331. current->thread.in_backtrace = true;
  332. return true;
  333. }
  334. static void end_backtrace(void)
  335. {
  336. current->thread.in_backtrace = false;
  337. }
  338. /*
  339. * This method wraps the backtracer's more generic support.
  340. * It is only invoked from the architecture-specific code; show_stack()
  341. * and dump_stack() (in entry.S) are architecture-independent entry points.
  342. */
  343. void tile_show_stack(struct KBacktraceIterator *kbt, int headers)
  344. {
  345. int i;
  346. int have_mmap_sem = 0;
  347. if (!start_backtrace())
  348. return;
  349. if (headers) {
  350. /*
  351. * Add a blank line since if we are called from panic(),
  352. * then bust_spinlocks() spit out a space in front of us
  353. * and it will mess up our KERN_ERR.
  354. */
  355. pr_err("\n");
  356. pr_err("Starting stack dump of tid %d, pid %d (%s)"
  357. " on cpu %d at cycle %lld\n",
  358. kbt->task->pid, kbt->task->tgid, kbt->task->comm,
  359. raw_smp_processor_id(), get_cycles());
  360. }
  361. kbt->verbose = 1;
  362. i = 0;
  363. for (; !KBacktraceIterator_end(kbt); KBacktraceIterator_next(kbt)) {
  364. char namebuf[KSYM_NAME_LEN+100];
  365. unsigned long address = kbt->it.pc;
  366. /* Try to acquire the mmap_sem as we pass into userspace. */
  367. if (address < PAGE_OFFSET && !have_mmap_sem && kbt->task->mm)
  368. have_mmap_sem =
  369. down_read_trylock(&kbt->task->mm->mmap_sem);
  370. describe_addr(kbt, address, have_mmap_sem,
  371. namebuf, sizeof(namebuf));
  372. pr_err(" frame %d: 0x%lx %s(sp 0x%lx)\n",
  373. i++, address, namebuf, (unsigned long)(kbt->it.sp));
  374. if (i >= 100) {
  375. pr_err("Stack dump truncated"
  376. " (%d frames)\n", i);
  377. break;
  378. }
  379. }
  380. if (kbt->end == KBT_LOOP)
  381. pr_err("Stack dump stopped; next frame identical to this one\n");
  382. if (headers)
  383. pr_err("Stack dump complete\n");
  384. if (have_mmap_sem)
  385. up_read(&kbt->task->mm->mmap_sem);
  386. end_backtrace();
  387. }
  388. EXPORT_SYMBOL(tile_show_stack);
  389. /* This is called from show_regs() and _dump_stack() */
  390. void dump_stack_regs(struct pt_regs *regs)
  391. {
  392. struct KBacktraceIterator kbt;
  393. KBacktraceIterator_init(&kbt, NULL, regs);
  394. tile_show_stack(&kbt, 1);
  395. }
  396. EXPORT_SYMBOL(dump_stack_regs);
  397. static struct pt_regs *regs_to_pt_regs(struct pt_regs *regs,
  398. ulong pc, ulong lr, ulong sp, ulong r52)
  399. {
  400. memset(regs, 0, sizeof(struct pt_regs));
  401. regs->pc = pc;
  402. regs->lr = lr;
  403. regs->sp = sp;
  404. regs->regs[52] = r52;
  405. return regs;
  406. }
  407. /* This is called from dump_stack() and just converts to pt_regs */
  408. void _dump_stack(int dummy, ulong pc, ulong lr, ulong sp, ulong r52)
  409. {
  410. struct pt_regs regs;
  411. dump_stack_regs(regs_to_pt_regs(&regs, pc, lr, sp, r52));
  412. }
  413. /* This is called from KBacktraceIterator_init_current() */
  414. void _KBacktraceIterator_init_current(struct KBacktraceIterator *kbt, ulong pc,
  415. ulong lr, ulong sp, ulong r52)
  416. {
  417. struct pt_regs regs;
  418. KBacktraceIterator_init(kbt, NULL,
  419. regs_to_pt_regs(&regs, pc, lr, sp, r52));
  420. }
  421. /* This is called only from kernel/sched/core.c, with esp == NULL */
  422. void show_stack(struct task_struct *task, unsigned long *esp)
  423. {
  424. struct KBacktraceIterator kbt;
  425. if (task == NULL || task == current)
  426. KBacktraceIterator_init_current(&kbt);
  427. else
  428. KBacktraceIterator_init(&kbt, task, NULL);
  429. tile_show_stack(&kbt, 0);
  430. }
  431. #ifdef CONFIG_STACKTRACE
  432. /* Support generic Linux stack API too */
  433. void save_stack_trace_tsk(struct task_struct *task, struct stack_trace *trace)
  434. {
  435. struct KBacktraceIterator kbt;
  436. int skip = trace->skip;
  437. int i = 0;
  438. if (!start_backtrace())
  439. goto done;
  440. if (task == NULL || task == current)
  441. KBacktraceIterator_init_current(&kbt);
  442. else
  443. KBacktraceIterator_init(&kbt, task, NULL);
  444. for (; !KBacktraceIterator_end(&kbt); KBacktraceIterator_next(&kbt)) {
  445. if (skip) {
  446. --skip;
  447. continue;
  448. }
  449. if (i >= trace->max_entries || kbt.it.pc < PAGE_OFFSET)
  450. break;
  451. trace->entries[i++] = kbt.it.pc;
  452. }
  453. end_backtrace();
  454. done:
  455. trace->nr_entries = i;
  456. }
  457. EXPORT_SYMBOL(save_stack_trace_tsk);
  458. void save_stack_trace(struct stack_trace *trace)
  459. {
  460. save_stack_trace_tsk(NULL, trace);
  461. }
  462. EXPORT_SYMBOL_GPL(save_stack_trace);
  463. #endif
  464. /* In entry.S */
  465. EXPORT_SYMBOL(KBacktraceIterator_init_current);