limit of out of order packets and receive workqueue size
[cor_2_6_31.git] / kernel / trace / trace_stack.c
blob6a2a9d484cd6bb950a11b99910649e2cec4c42ff
1 /*
2 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
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/debugfs.h>
11 #include <linux/ftrace.h>
12 #include <linux/module.h>
13 #include <linux/sysctl.h>
14 #include <linux/init.h>
15 #include <linux/fs.h>
16 #include "trace.h"
18 #define STACK_TRACE_ENTRIES 500
20 static unsigned long stack_dump_trace[STACK_TRACE_ENTRIES+1] =
21 { [0 ... (STACK_TRACE_ENTRIES)] = ULONG_MAX };
22 static unsigned stack_dump_index[STACK_TRACE_ENTRIES];
24 static struct stack_trace max_stack_trace = {
25 .max_entries = STACK_TRACE_ENTRIES,
26 .entries = stack_dump_trace,
29 static unsigned long max_stack_size;
30 static raw_spinlock_t max_stack_lock =
31 (raw_spinlock_t)__RAW_SPIN_LOCK_UNLOCKED;
33 static int stack_trace_disabled __read_mostly;
34 static DEFINE_PER_CPU(int, trace_active);
35 static DEFINE_MUTEX(stack_sysctl_mutex);
37 int stack_tracer_enabled;
38 static int last_stack_tracer_enabled;
40 static inline void check_stack(void)
42 unsigned long this_size, flags;
43 unsigned long *p, *top, *start;
44 int i;
46 this_size = ((unsigned long)&this_size) & (THREAD_SIZE-1);
47 this_size = THREAD_SIZE - this_size;
49 if (this_size <= max_stack_size)
50 return;
52 /* we do not handle interrupt stacks yet */
53 if (!object_is_on_stack(&this_size))
54 return;
56 local_irq_save(flags);
57 __raw_spin_lock(&max_stack_lock);
59 /* a race could have already updated it */
60 if (this_size <= max_stack_size)
61 goto out;
63 max_stack_size = this_size;
65 max_stack_trace.nr_entries = 0;
66 max_stack_trace.skip = 3;
68 save_stack_trace(&max_stack_trace);
71 * Now find where in the stack these are.
73 i = 0;
74 start = &this_size;
75 top = (unsigned long *)
76 (((unsigned long)start & ~(THREAD_SIZE-1)) + THREAD_SIZE);
79 * Loop through all the entries. One of the entries may
80 * for some reason be missed on the stack, so we may
81 * have to account for them. If they are all there, this
82 * loop will only happen once. This code only takes place
83 * on a new max, so it is far from a fast path.
85 while (i < max_stack_trace.nr_entries) {
86 int found = 0;
88 stack_dump_index[i] = this_size;
89 p = start;
91 for (; p < top && i < max_stack_trace.nr_entries; p++) {
92 if (*p == stack_dump_trace[i]) {
93 this_size = stack_dump_index[i++] =
94 (top - p) * sizeof(unsigned long);
95 found = 1;
96 /* Start the search from here */
97 start = p + 1;
101 if (!found)
102 i++;
105 out:
106 __raw_spin_unlock(&max_stack_lock);
107 local_irq_restore(flags);
110 static void
111 stack_trace_call(unsigned long ip, unsigned long parent_ip)
113 int cpu, resched;
115 if (unlikely(!ftrace_enabled || stack_trace_disabled))
116 return;
118 resched = ftrace_preempt_disable();
120 cpu = raw_smp_processor_id();
121 /* no atomic needed, we only modify this variable by this cpu */
122 if (per_cpu(trace_active, cpu)++ != 0)
123 goto out;
125 check_stack();
127 out:
128 per_cpu(trace_active, cpu)--;
129 /* prevent recursion in schedule */
130 ftrace_preempt_enable(resched);
133 static struct ftrace_ops trace_ops __read_mostly =
135 .func = stack_trace_call,
138 static ssize_t
139 stack_max_size_read(struct file *filp, char __user *ubuf,
140 size_t count, loff_t *ppos)
142 unsigned long *ptr = filp->private_data;
143 char buf[64];
144 int r;
146 r = snprintf(buf, sizeof(buf), "%ld\n", *ptr);
147 if (r > sizeof(buf))
148 r = sizeof(buf);
149 return simple_read_from_buffer(ubuf, count, ppos, buf, r);
152 static ssize_t
153 stack_max_size_write(struct file *filp, const char __user *ubuf,
154 size_t count, loff_t *ppos)
156 long *ptr = filp->private_data;
157 unsigned long val, flags;
158 char buf[64];
159 int ret;
161 if (count >= sizeof(buf))
162 return -EINVAL;
164 if (copy_from_user(&buf, ubuf, count))
165 return -EFAULT;
167 buf[count] = 0;
169 ret = strict_strtoul(buf, 10, &val);
170 if (ret < 0)
171 return ret;
173 local_irq_save(flags);
174 __raw_spin_lock(&max_stack_lock);
175 *ptr = val;
176 __raw_spin_unlock(&max_stack_lock);
177 local_irq_restore(flags);
179 return count;
182 static const struct file_operations stack_max_size_fops = {
183 .open = tracing_open_generic,
184 .read = stack_max_size_read,
185 .write = stack_max_size_write,
188 static void *
189 t_next(struct seq_file *m, void *v, loff_t *pos)
191 long i;
193 (*pos)++;
195 if (v == SEQ_START_TOKEN)
196 i = 0;
197 else {
198 i = *(long *)v;
199 i++;
202 if (i >= max_stack_trace.nr_entries ||
203 stack_dump_trace[i] == ULONG_MAX)
204 return NULL;
206 m->private = (void *)i;
208 return &m->private;
211 static void *t_start(struct seq_file *m, loff_t *pos)
213 void *t = SEQ_START_TOKEN;
214 loff_t l = 0;
216 local_irq_disable();
217 __raw_spin_lock(&max_stack_lock);
219 if (*pos == 0)
220 return SEQ_START_TOKEN;
222 for (; t && l < *pos; t = t_next(m, t, &l))
225 return t;
228 static void t_stop(struct seq_file *m, void *p)
230 __raw_spin_unlock(&max_stack_lock);
231 local_irq_enable();
234 static int trace_lookup_stack(struct seq_file *m, long i)
236 unsigned long addr = stack_dump_trace[i];
237 #ifdef CONFIG_KALLSYMS
238 char str[KSYM_SYMBOL_LEN];
240 sprint_symbol(str, addr);
242 return seq_printf(m, "%s\n", str);
243 #else
244 return seq_printf(m, "%p\n", (void*)addr);
245 #endif
248 static void print_disabled(struct seq_file *m)
250 seq_puts(m, "#\n"
251 "# Stack tracer disabled\n"
252 "#\n"
253 "# To enable the stack tracer, either add 'stacktrace' to the\n"
254 "# kernel command line\n"
255 "# or 'echo 1 > /proc/sys/kernel/stack_tracer_enabled'\n"
256 "#\n");
259 static int t_show(struct seq_file *m, void *v)
261 long i;
262 int size;
264 if (v == SEQ_START_TOKEN) {
265 seq_printf(m, " Depth Size Location"
266 " (%d entries)\n"
267 " ----- ---- --------\n",
268 max_stack_trace.nr_entries - 1);
270 if (!stack_tracer_enabled && !max_stack_size)
271 print_disabled(m);
273 return 0;
276 i = *(long *)v;
278 if (i >= max_stack_trace.nr_entries ||
279 stack_dump_trace[i] == ULONG_MAX)
280 return 0;
282 if (i+1 == max_stack_trace.nr_entries ||
283 stack_dump_trace[i+1] == ULONG_MAX)
284 size = stack_dump_index[i];
285 else
286 size = stack_dump_index[i] - stack_dump_index[i+1];
288 seq_printf(m, "%3ld) %8d %5d ", i, stack_dump_index[i], size);
290 trace_lookup_stack(m, i);
292 return 0;
295 static const struct seq_operations stack_trace_seq_ops = {
296 .start = t_start,
297 .next = t_next,
298 .stop = t_stop,
299 .show = t_show,
302 static int stack_trace_open(struct inode *inode, struct file *file)
304 return seq_open(file, &stack_trace_seq_ops);
307 static const struct file_operations stack_trace_fops = {
308 .open = stack_trace_open,
309 .read = seq_read,
310 .llseek = seq_lseek,
311 .release = seq_release,
315 stack_trace_sysctl(struct ctl_table *table, int write,
316 struct file *file, void __user *buffer, size_t *lenp,
317 loff_t *ppos)
319 int ret;
321 mutex_lock(&stack_sysctl_mutex);
323 ret = proc_dointvec(table, write, file, buffer, lenp, ppos);
325 if (ret || !write ||
326 (last_stack_tracer_enabled == !!stack_tracer_enabled))
327 goto out;
329 last_stack_tracer_enabled = !!stack_tracer_enabled;
331 if (stack_tracer_enabled)
332 register_ftrace_function(&trace_ops);
333 else
334 unregister_ftrace_function(&trace_ops);
336 out:
337 mutex_unlock(&stack_sysctl_mutex);
338 return ret;
341 static __init int enable_stacktrace(char *str)
343 stack_tracer_enabled = 1;
344 last_stack_tracer_enabled = 1;
345 return 1;
347 __setup("stacktrace", enable_stacktrace);
349 static __init int stack_trace_init(void)
351 struct dentry *d_tracer;
353 d_tracer = tracing_init_dentry();
355 trace_create_file("stack_max_size", 0644, d_tracer,
356 &max_stack_size, &stack_max_size_fops);
358 trace_create_file("stack_trace", 0444, d_tracer,
359 NULL, &stack_trace_fops);
361 if (stack_tracer_enabled)
362 register_ftrace_function(&trace_ops);
364 return 0;
367 device_initcall(stack_trace_init);