trace_stack.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486
  1. /*
  2. * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
  3. *
  4. */
  5. #include <linux/stacktrace.h>
  6. #include <linux/kallsyms.h>
  7. #include <linux/seq_file.h>
  8. #include <linux/spinlock.h>
  9. #include <linux/uaccess.h>
  10. #include <linux/ftrace.h>
  11. #include <linux/module.h>
  12. #include <linux/sysctl.h>
  13. #include <linux/init.h>
  14. #include <asm/setup.h>
  15. #include "trace.h"
  16. static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
  17. { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
  18. unsigned stack_trace_index[STACK_TRACE_ENTRIES];
  19. /*
  20. * Reserve one entry for the passed in ip. This will allow
  21. * us to remove most or all of the stack size overhead
  22. * added by the stack tracer itself.
  23. */
  24. struct stack_trace stack_trace_max = {
  25. .max_entries = STACK_TRACE_ENTRIES - 1,
  26. .entries = &stack_dump_trace[0],
  27. };
  28. unsigned long stack_trace_max_size;
  29. arch_spinlock_t stack_trace_max_lock =
  30. (arch_spinlock_t)__ARCH_SPIN_LOCK_UNLOCKED;
  31. static DEFINE_PER_CPU(int, trace_active);
  32. static DEFINE_MUTEX(stack_sysctl_mutex);
  33. int stack_tracer_enabled;
  34. static int last_stack_tracer_enabled;
  35. void stack_trace_print(void)
  36. {
  37. long i;
  38. int size;
  39. pr_emerg(" Depth Size Location (%d entries)\n"
  40. " ----- ---- --------\n",
  41. stack_trace_max.nr_entries);
  42. for (i = 0; i < stack_trace_max.nr_entries; i++) {
  43. if (stack_dump_trace[i] == ULONG_MAX)
  44. break;
  45. if (i+1 == stack_trace_max.nr_entries ||
  46. stack_dump_trace[i+1] == ULONG_MAX)
  47. size = stack_trace_index[i];
  48. else
  49. size = stack_trace_index[i] - stack_trace_index[i+1];
  50. pr_emerg("%3ld) %8d %5d %pS\n", i, stack_trace_index[i],
  51. size, (void *)stack_dump_trace[i]);
  52. }
  53. }
  54. /*
  55. * When arch-specific code overides this function, the following
  56. * data should be filled up, assuming stack_trace_max_lock is held to
  57. * prevent concurrent updates.
  58. * stack_trace_index[]
  59. * stack_trace_max
  60. * stack_trace_max_size
  61. */
  62. void __weak
  63. check_stack(unsigned long ip, unsigned long *stack)
  64. {
  65. unsigned long this_size, flags; unsigned long *p, *top, *start;
  66. static int tracer_frame;
  67. int frame_size = ACCESS_ONCE(tracer_frame);
  68. int i, x;
  69. this_size = ((unsigned long)stack) & (THREAD_SIZE-1);
  70. this_size = THREAD_SIZE - this_size;
  71. /* Remove the frame of the tracer */
  72. this_size -= frame_size;
  73. if (this_size <= stack_trace_max_size)
  74. return;
  75. /* we do not handle interrupt stacks yet */
  76. if (!object_is_on_stack(stack))
  77. return;
  78. /* Can't do this from NMI context (can cause deadlocks) */
  79. if (in_nmi())
  80. return;
  81. local_irq_save(flags);
  82. arch_spin_lock(&stack_trace_max_lock);
  83. /*
  84. * RCU may not be watching, make it see us.
  85. * The stack trace code uses rcu_sched.
  86. */
  87. rcu_irq_enter();
  88. /* In case another CPU set the tracer_frame on us */
  89. if (unlikely(!frame_size))
  90. this_size -= tracer_frame;
  91. /* a race could have already updated it */
  92. if (this_size <= stack_trace_max_size)
  93. goto out;
  94. stack_trace_max_size = this_size;
  95. stack_trace_max.nr_entries = 0;
  96. stack_trace_max.skip = 3;
  97. save_stack_trace(&stack_trace_max);
  98. /* Skip over the overhead of the stack tracer itself */
  99. for (i = 0; i < stack_trace_max.nr_entries; i++) {
  100. if (stack_dump_trace[i] == ip)
  101. break;
  102. }
  103. /*
  104. * Some archs may not have the passed in ip in the dump.
  105. * If that happens, we need to show everything.
  106. */
  107. if (i == stack_trace_max.nr_entries)
  108. i = 0;
  109. /*
  110. * Now find where in the stack these are.
  111. */
  112. x = 0;
  113. start = stack;
  114. top = (unsigned long *)
  115. (((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);
  116. /*
  117. * Loop through all the entries. One of the entries may
  118. * for some reason be missed on the stack, so we may
  119. * have to account for them. If they are all there, this
  120. * loop will only happen once. This code only takes place
  121. * on a new max, so it is far from a fast path.
  122. */
  123. while (i < stack_trace_max.nr_entries) {
  124. int found = 0;
  125. stack_trace_index[x] = this_size;
  126. p = start;
  127. for (; p < top && i < stack_trace_max.nr_entries; p++) {
  128. if (stack_dump_trace[i] == ULONG_MAX)
  129. break;
  130. if (*p == stack_dump_trace[i]) {
  131. stack_dump_trace[x] = stack_dump_trace[i++];
  132. this_size = stack_trace_index[x++] =
  133. (top - p) * sizeof(unsigned long);
  134. found = 1;
  135. /* Start the search from here */
  136. start = p + 1;
  137. /*
  138. * We do not want to show the overhead
  139. * of the stack tracer stack in the
  140. * max stack. If we haven't figured
  141. * out what that is, then figure it out
  142. * now.
  143. */
  144. if (unlikely(!tracer_frame)) {
  145. tracer_frame = (p - stack) *
  146. sizeof(unsigned long);
  147. stack_trace_max_size -= tracer_frame;
  148. }
  149. }
  150. }
  151. if (!found)
  152. i++;
  153. }
  154. stack_trace_max.nr_entries = x;
  155. for (; x < i; x++)
  156. stack_dump_trace[x] = ULONG_MAX;
  157. if (task_stack_end_corrupted(current)) {
  158. stack_trace_print();
  159. BUG();
  160. }
  161. out:
  162. rcu_irq_exit();
  163. arch_spin_unlock(&stack_trace_max_lock);
  164. local_irq_restore(flags);
  165. }
  166. static void
  167. stack_trace_call(unsigned long ip, unsigned long parent_ip,
  168. struct ftrace_ops *op, struct pt_regs *pt_regs)
  169. {
  170. unsigned long stack;
  171. int cpu;
  172. preempt_disable_notrace();
  173. cpu = raw_smp_processor_id();
  174. /* no atomic needed, we only modify this variable by this cpu */
  175. if (per_cpu(trace_active, cpu)++ != 0)
  176. goto out;
  177. ip += MCOUNT_INSN_SIZE;
  178. check_stack(ip, &stack);
  179. out:
  180. per_cpu(trace_active, cpu)--;
  181. /* prevent recursion in schedule */
  182. preempt_enable_notrace();
  183. }
  184. static struct ftrace_ops trace_ops __read_mostly =
  185. {
  186. .func = stack_trace_call,
  187. .flags = FTRACE_OPS_FL_RECURSION_SAFE,
  188. };
  189. static ssize_t
  190. stack_max_size_read(struct file *filp, char __user *ubuf,
  191. size_t count, loff_t *ppos)
  192. {
  193. unsigned long *ptr = filp->private_data;
  194. char buf[64];
  195. int r;
  196. r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
  197. if (r > sizeof(buf))
  198. r = sizeof(buf);
  199. return simple_read_from_buffer(ubuf, count, ppos, buf, r);
  200. }
  201. static ssize_t
  202. stack_max_size_write(struct file *filp, const char __user *ubuf,
  203. size_t count, loff_t *ppos)
  204. {
  205. long *ptr = filp->private_data;
  206. unsigned long val, flags;
  207. int ret;
  208. int cpu;
  209. ret = kstrtoul_from_user(ubuf, count, 10, &val);
  210. if (ret)
  211. return ret;
  212. local_irq_save(flags);
  213. /*
  214. * In case we trace inside arch_spin_lock() or after (NMI),
  215. * we will cause circular lock, so we also need to increase
  216. * the percpu trace_active here.
  217. */
  218. cpu = smp_processor_id();
  219. per_cpu(trace_active, cpu)++;
  220. arch_spin_lock(&stack_trace_max_lock);
  221. *ptr = val;
  222. arch_spin_unlock(&stack_trace_max_lock);
  223. per_cpu(trace_active, cpu)--;
  224. local_irq_restore(flags);
  225. return count;
  226. }
  227. static const struct file_operations stack_max_size_fops = {
  228. .open = tracing_open_generic,
  229. .read = stack_max_size_read,
  230. .write = stack_max_size_write,
  231. .llseek = default_llseek,
  232. };
  233. static void *
  234. __next(struct seq_file *m, loff_t *pos)
  235. {
  236. long n = *pos - 1;
  237. if (n > stack_trace_max.nr_entries || stack_dump_trace[n] == ULONG_MAX)
  238. return NULL;
  239. m->private = (void *)n;
  240. return &m->private;
  241. }
  242. static void *
  243. t_next(struct seq_file *m, void *v, loff_t *pos)
  244. {
  245. (*pos)++;
  246. return __next(m, pos);
  247. }
  248. static void *t_start(struct seq_file *m, loff_t *pos)
  249. {
  250. int cpu;
  251. local_irq_disable();
  252. cpu = smp_processor_id();
  253. per_cpu(trace_active, cpu)++;
  254. arch_spin_lock(&stack_trace_max_lock);
  255. if (*pos == 0)
  256. return SEQ_START_TOKEN;
  257. return __next(m, pos);
  258. }
  259. static void t_stop(struct seq_file *m, void *p)
  260. {
  261. int cpu;
  262. arch_spin_unlock(&stack_trace_max_lock);
  263. cpu = smp_processor_id();
  264. per_cpu(trace_active, cpu)--;
  265. local_irq_enable();
  266. }
  267. static void trace_lookup_stack(struct seq_file *m, long i)
  268. {
  269. unsigned long addr = stack_dump_trace[i];
  270. seq_printf(m, "%pS\n", (void *)addr);
  271. }
  272. static void print_disabled(struct seq_file *m)
  273. {
  274. seq_puts(m, "#\n"
  275. "# Stack tracer disabled\n"
  276. "#\n"
  277. "# To enable the stack tracer, either add 'stacktrace' to the\n"
  278. "# kernel command line\n"
  279. "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
  280. "#\n");
  281. }
  282. static int t_show(struct seq_file *m, void *v)
  283. {
  284. long i;
  285. int size;
  286. if (v == SEQ_START_TOKEN) {
  287. seq_printf(m, " Depth Size Location"
  288. " (%d entries)\n"
  289. " ----- ---- --------\n",
  290. stack_trace_max.nr_entries);
  291. if (!stack_tracer_enabled && !stack_trace_max_size)
  292. print_disabled(m);
  293. return 0;
  294. }
  295. i = *(long *)v;
  296. if (i >= stack_trace_max.nr_entries ||
  297. stack_dump_trace[i] == ULONG_MAX)
  298. return 0;
  299. if (i+1 == stack_trace_max.nr_entries ||
  300. stack_dump_trace[i+1] == ULONG_MAX)
  301. size = stack_trace_index[i];
  302. else
  303. size = stack_trace_index[i] - stack_trace_index[i+1];
  304. seq_printf(m, "%3ld) %8d %5d ", i, stack_trace_index[i], size);
  305. trace_lookup_stack(m, i);
  306. return 0;
  307. }
  308. static const struct seq_operations stack_trace_seq_ops = {
  309. .start = t_start,
  310. .next = t_next,
  311. .stop = t_stop,
  312. .show = t_show,
  313. };
  314. static int stack_trace_open(struct inode *inode, struct file *file)
  315. {
  316. return seq_open(file, &stack_trace_seq_ops);
  317. }
  318. static const struct file_operations stack_trace_fops = {
  319. .open = stack_trace_open,
  320. .read = seq_read,
  321. .llseek = seq_lseek,
  322. .release = seq_release,
  323. };
  324. static int
  325. stack_trace_filter_open(struct inode *inode, struct file *file)
  326. {
  327. return ftrace_regex_open(&trace_ops, FTRACE_ITER_FILTER,
  328. inode, file);
  329. }
  330. static const struct file_operations stack_trace_filter_fops = {
  331. .open = stack_trace_filter_open,
  332. .read = seq_read,
  333. .write = ftrace_filter_write,
  334. .llseek = tracing_lseek,
  335. .release = ftrace_regex_release,
  336. };
  337. int
  338. stack_trace_sysctl(struct ctl_table *table, int write,
  339. void __user *buffer, size_t *lenp,
  340. loff_t *ppos)
  341. {
  342. int ret;
  343. mutex_lock(&stack_sysctl_mutex);
  344. ret = proc_dointvec(table, write, buffer, lenp, ppos);
  345. if (ret || !write ||
  346. (last_stack_tracer_enabled == !!stack_tracer_enabled))
  347. goto out;
  348. last_stack_tracer_enabled = !!stack_tracer_enabled;
  349. if (stack_tracer_enabled)
  350. register_ftrace_function(&trace_ops);
  351. else
  352. unregister_ftrace_function(&trace_ops);
  353. out:
  354. mutex_unlock(&stack_sysctl_mutex);
  355. return ret;
  356. }
  357. static char stack_trace_filter_buf[COMMAND_LINE_SIZE+1] __initdata;
  358. static __init int enable_stacktrace(char *str)
  359. {
  360. if (strncmp(str, "_filter=", 8) == 0)
  361. strncpy(stack_trace_filter_buf, str+8, COMMAND_LINE_SIZE);
  362. stack_tracer_enabled = 1;
  363. last_stack_tracer_enabled = 1;
  364. return 1;
  365. }
  366. __setup("stacktrace", enable_stacktrace);
  367. static __init int stack_trace_init(void)
  368. {
  369. struct dentry *d_tracer;
  370. d_tracer = tracing_init_dentry();
  371. if (IS_ERR(d_tracer))
  372. return 0;
  373. trace_create_file("stack_max_size", 0644, d_tracer,
  374. &stack_trace_max_size, &stack_max_size_fops);
  375. trace_create_file("stack_trace", 0444, d_tracer,
  376. NULL, &stack_trace_fops);
  377. trace_create_file("stack_trace_filter", 0444, d_tracer,
  378. NULL, &stack_trace_filter_fops);
  379. if (stack_trace_filter_buf[0])
  380. ftrace_set_early_filter(&trace_ops, stack_trace_filter_buf, 1);
  381. if (stack_tracer_enabled)
  382. register_ftrace_function(&trace_ops);
  383. return 0;
  384. }
  385. device_initcall(stack_trace_init);