blk-mq: really fix plug list flushing for nomerge queues
[linux-2.6-block.git] / kernel / trace / trace_branch.c
CommitLineData
1f0d69a9
SR
1/*
2 * unlikely profiler
3 *
4 * Copyright (C) 2008 Steven Rostedt <srostedt@redhat.com>
5 */
6#include <linux/kallsyms.h>
7#include <linux/seq_file.h>
8#include <linux/spinlock.h>
65c6dc6a 9#include <linux/irqflags.h>
1f0d69a9
SR
10#include <linux/uaccess.h>
11#include <linux/module.h>
12#include <linux/ftrace.h>
13#include <linux/hash.h>
14#include <linux/fs.h>
15#include <asm/local.h>
f633cef0 16
1f0d69a9 17#include "trace.h"
002bb86d 18#include "trace_stat.h"
f633cef0 19#include "trace_output.h"
1f0d69a9 20
2ed84eeb 21#ifdef CONFIG_BRANCH_TRACER
52f232cb 22
002bb86d 23static struct tracer branch_trace;
9f029e83
SR
24static int branch_tracing_enabled __read_mostly;
25static DEFINE_MUTEX(branch_tracing_mutex);
e302cf3f 26
9f029e83 27static struct trace_array *branch_tracer;
52f232cb
SR
28
29static void
9f029e83 30probe_likely_condition(struct ftrace_branch_data *f, int val, int expect)
52f232cb 31{
2425bcb9 32 struct trace_event_call *call = &event_branch;
9f029e83 33 struct trace_array *tr = branch_tracer;
a7603ff4 34 struct trace_array_cpu *data;
52f232cb 35 struct ring_buffer_event *event;
9f029e83 36 struct trace_branch *entry;
8f6e8a31 37 struct ring_buffer *buffer;
0a987751 38 unsigned long flags;
6224beb1 39 int pc;
52f232cb
SR
40 const char *p;
41
6224beb1
SRRH
42 if (current->trace_recursion & TRACE_BRANCH_BIT)
43 return;
44
52f232cb
SR
45 /*
46 * I would love to save just the ftrace_likely_data pointer, but
47 * this code can also be used by modules. Ugly things can happen
48 * if the module is unloaded, and then we go and read the
49 * pointer. This is slower, but much safer.
50 */
51
52 if (unlikely(!tr))
53 return;
54
6224beb1
SRRH
55 raw_local_irq_save(flags);
56 current->trace_recursion |= TRACE_BRANCH_BIT;
57 data = this_cpu_ptr(tr->trace_buffer.data);
58 if (atomic_read(&data->disabled))
52f232cb
SR
59 goto out;
60
51a763dd 61 pc = preempt_count();
153e8ed9 62 buffer = tr->trace_buffer.buffer;
8f6e8a31 63 event = trace_buffer_lock_reserve(buffer, TRACE_BRANCH,
51a763dd 64 sizeof(*entry), flags, pc);
52f232cb
SR
65 if (!event)
66 goto out;
67
52f232cb 68 entry = ring_buffer_event_data(event);
52f232cb
SR
69
70 /* Strip off the path, only save the file */
71 p = f->file + strlen(f->file);
72 while (p >= f->file && *p != '/')
73 p--;
74 p++;
75
76 strncpy(entry->func, f->func, TRACE_FUNC_SIZE);
77 strncpy(entry->file, p, TRACE_FILE_SIZE);
78 entry->func[TRACE_FUNC_SIZE] = 0;
79 entry->file[TRACE_FILE_SIZE] = 0;
80 entry->line = f->line;
81 entry->correct = val == expect;
82
f306cc82 83 if (!call_filter_check_discard(call, entry, buffer, event))
7ffbd48d 84 __buffer_unlock_commit(buffer, event);
52f232cb
SR
85
86 out:
6224beb1
SRRH
87 current->trace_recursion &= ~TRACE_BRANCH_BIT;
88 raw_local_irq_restore(flags);
52f232cb
SR
89}
90
91static inline
9f029e83 92void trace_likely_condition(struct ftrace_branch_data *f, int val, int expect)
52f232cb 93{
9f029e83 94 if (!branch_tracing_enabled)
52f232cb
SR
95 return;
96
97 probe_likely_condition(f, val, expect);
98}
99
9f029e83 100int enable_branch_tracing(struct trace_array *tr)
52f232cb 101{
9f029e83
SR
102 mutex_lock(&branch_tracing_mutex);
103 branch_tracer = tr;
52f232cb
SR
104 /*
105 * Must be seen before enabling. The reader is a condition
106 * where we do not need a matching rmb()
107 */
108 smp_wmb();
9f029e83
SR
109 branch_tracing_enabled++;
110 mutex_unlock(&branch_tracing_mutex);
52f232cb 111
f54fc98a 112 return 0;
52f232cb
SR
113}
114
9f029e83 115void disable_branch_tracing(void)
52f232cb 116{
9f029e83 117 mutex_lock(&branch_tracing_mutex);
52f232cb 118
9f029e83 119 if (!branch_tracing_enabled)
52f232cb
SR
120 goto out_unlock;
121
9f029e83 122 branch_tracing_enabled--;
52f232cb
SR
123
124 out_unlock:
9f029e83 125 mutex_unlock(&branch_tracing_mutex);
52f232cb 126}
80e5ea45 127
1c80025a 128static int branch_trace_init(struct trace_array *tr)
80e5ea45 129{
30616929 130 return enable_branch_tracing(tr);
80e5ea45
SR
131}
132
133static void branch_trace_reset(struct trace_array *tr)
134{
30616929 135 disable_branch_tracing();
80e5ea45
SR
136}
137
ae7462b4 138static enum print_line_t trace_branch_print(struct trace_iterator *iter,
a9a57763 139 int flags, struct trace_event *event)
f633cef0
SR
140{
141 struct trace_branch *field;
142
2c9b238e 143 trace_assign_type(field, iter->ent);
f633cef0 144
7d40f671
SRRH
145 trace_seq_printf(&iter->seq, "[%s] %s:%s:%d\n",
146 field->correct ? " ok " : " MISS ",
147 field->func,
148 field->file,
149 field->line);
150
151 return trace_handle_return(&iter->seq);
f633cef0
SR
152}
153
557055be
Z
154static void branch_print_header(struct seq_file *s)
155{
156 seq_puts(s, "# TASK-PID CPU# TIMESTAMP CORRECT"
d79ac28f
RV
157 " FUNC:FILE:LINE\n"
158 "# | | | | | "
159 " |\n");
557055be 160}
e302cf3f 161
a9a57763
SR
162static struct trace_event_functions trace_branch_funcs = {
163 .trace = trace_branch_print,
164};
165
f633cef0 166static struct trace_event trace_branch_event = {
ef18012b 167 .type = TRACE_BRANCH,
a9a57763 168 .funcs = &trace_branch_funcs,
f633cef0
SR
169};
170
002bb86d
FW
171static struct tracer branch_trace __read_mostly =
172{
173 .name = "branch",
174 .init = branch_trace_init,
175 .reset = branch_trace_reset,
176#ifdef CONFIG_FTRACE_SELFTEST
177 .selftest = trace_selftest_startup_branch,
178#endif /* CONFIG_FTRACE_SELFTEST */
557055be 179 .print_header = branch_print_header,
002bb86d
FW
180};
181
182__init static int init_branch_tracer(void)
183{
184 int ret;
185
9023c930 186 ret = register_trace_event(&trace_branch_event);
002bb86d
FW
187 if (!ret) {
188 printk(KERN_WARNING "Warning: could not register "
189 "branch events\n");
190 return 1;
191 }
192 return register_tracer(&branch_trace);
193}
6f415672 194core_initcall(init_branch_tracer);
002bb86d 195
52f232cb
SR
196#else
197static inline
9f029e83 198void trace_likely_condition(struct ftrace_branch_data *f, int val, int expect)
52f232cb
SR
199{
200}
2ed84eeb 201#endif /* CONFIG_BRANCH_TRACER */
52f232cb 202
9f029e83 203void ftrace_likely_update(struct ftrace_branch_data *f, int val, int expect)
1f0d69a9 204{
52f232cb
SR
205 /*
206 * I would love to have a trace point here instead, but the
207 * trace point code is so inundated with unlikely and likely
208 * conditions that the recursive nightmare that exists is too
209 * much to try to get working. At least for now.
210 */
211 trace_likely_condition(f, val, expect);
212
1f0d69a9
SR
213 /* FIXME: Make this atomic! */
214 if (val == expect)
215 f->correct++;
216 else
217 f->incorrect++;
218}
219EXPORT_SYMBOL(ftrace_likely_update);
220
e302cf3f
FW
221extern unsigned long __start_annotated_branch_profile[];
222extern unsigned long __stop_annotated_branch_profile[];
1f0d69a9 223
e302cf3f 224static int annotated_branch_stat_headers(struct seq_file *m)
1f0d69a9 225{
d79ac28f
RV
226 seq_puts(m, " correct incorrect % "
227 " Function "
fa6f0cc7
RV
228 " File Line\n"
229 " ------- --------- - "
230 " -------- "
231 " ---- ----\n");
e302cf3f 232 return 0;
1f0d69a9
SR
233}
234
e302cf3f 235static inline long get_incorrect_percent(struct ftrace_branch_data *p)
1f0d69a9 236{
e302cf3f 237 long percent;
1f0d69a9 238
e302cf3f
FW
239 if (p->correct) {
240 percent = p->incorrect * 100;
241 percent /= p->correct + p->incorrect;
242 } else
243 percent = p->incorrect ? 100 : -1;
1f0d69a9 244
e302cf3f 245 return percent;
1f0d69a9
SR
246}
247
e302cf3f 248static int branch_stat_show(struct seq_file *m, void *v)
1f0d69a9 249{
9f029e83 250 struct ftrace_branch_data *p = v;
1f0d69a9 251 const char *f;
bac28bfe 252 long percent;
1f0d69a9 253
1f0d69a9
SR
254 /* Only print the file, not the path */
255 f = p->file + strlen(p->file);
256 while (f >= p->file && *f != '/')
257 f--;
258 f++;
259
2bcd521a
SR
260 /*
261 * The miss is overlayed on correct, and hit on incorrect.
262 */
e302cf3f 263 percent = get_incorrect_percent(p);
1f0d69a9 264
bac28bfe
SR
265 seq_printf(m, "%8lu %8lu ", p->correct, p->incorrect);
266 if (percent < 0)
fa6f0cc7 267 seq_puts(m, " X ");
bac28bfe
SR
268 else
269 seq_printf(m, "%3ld ", percent);
1f0d69a9
SR
270 seq_printf(m, "%-30.30s %-20.20s %d\n", p->func, f, p->line);
271 return 0;
272}
273
42548008 274static void *annotated_branch_stat_start(struct tracer_stat *trace)
e302cf3f
FW
275{
276 return __start_annotated_branch_profile;
277}
1f0d69a9 278
e302cf3f
FW
279static void *
280annotated_branch_stat_next(void *v, int idx)
1f0d69a9 281{
e302cf3f 282 struct ftrace_branch_data *p = v;
1f0d69a9 283
e302cf3f 284 ++p;
1f0d69a9 285
e302cf3f
FW
286 if ((void *)p >= (void *)__stop_annotated_branch_profile)
287 return NULL;
288
289 return p;
1f0d69a9
SR
290}
291
e302cf3f
FW
292static int annotated_branch_stat_cmp(void *p1, void *p2)
293{
294 struct ftrace_branch_data *a = p1;
295 struct ftrace_branch_data *b = p2;
296
297 long percent_a, percent_b;
298
299 percent_a = get_incorrect_percent(a);
300 percent_b = get_incorrect_percent(b);
301
302 if (percent_a < percent_b)
303 return -1;
304 if (percent_a > percent_b)
305 return 1;
ede55c9d
SR
306
307 if (a->incorrect < b->incorrect)
308 return -1;
309 if (a->incorrect > b->incorrect)
310 return 1;
311
312 /*
313 * Since the above shows worse (incorrect) cases
314 * first, we continue that by showing best (correct)
315 * cases last.
316 */
317 if (a->correct > b->correct)
318 return -1;
319 if (a->correct < b->correct)
320 return 1;
321
322 return 0;
e302cf3f 323}
1f0d69a9 324
002bb86d
FW
325static struct tracer_stat annotated_branch_stats = {
326 .name = "branch_annotated",
327 .stat_start = annotated_branch_stat_start,
328 .stat_next = annotated_branch_stat_next,
329 .stat_cmp = annotated_branch_stat_cmp,
330 .stat_headers = annotated_branch_stat_headers,
331 .stat_show = branch_stat_show
332};
333
334__init static int init_annotated_branch_stats(void)
335{
336 int ret;
337
338 ret = register_stat_tracer(&annotated_branch_stats);
339 if (!ret) {
340 printk(KERN_WARNING "Warning: could not register "
341 "annotated branches stats\n");
342 return 1;
343 }
344 return 0;
345}
346fs_initcall(init_annotated_branch_stats);
347
2bcd521a 348#ifdef CONFIG_PROFILE_ALL_BRANCHES
2bcd521a 349
e302cf3f
FW
350extern unsigned long __start_branch_profile[];
351extern unsigned long __stop_branch_profile[];
1f0d69a9 352
e302cf3f
FW
353static int all_branch_stat_headers(struct seq_file *m)
354{
d79ac28f
RV
355 seq_puts(m, " miss hit % "
356 " Function "
fa6f0cc7
RV
357 " File Line\n"
358 " ------- --------- - "
359 " -------- "
360 " ---- ----\n");
e302cf3f
FW
361 return 0;
362}
1f0d69a9 363
42548008 364static void *all_branch_stat_start(struct tracer_stat *trace)
1f0d69a9 365{
e302cf3f
FW
366 return __start_branch_profile;
367}
368
369static void *
370all_branch_stat_next(void *v, int idx)
371{
372 struct ftrace_branch_data *p = v;
1f0d69a9 373
e302cf3f 374 ++p;
1f0d69a9 375
e302cf3f
FW
376 if ((void *)p >= (void *)__stop_branch_profile)
377 return NULL;
1f0d69a9 378
e302cf3f
FW
379 return p;
380}
2bcd521a 381
002bb86d
FW
382static struct tracer_stat all_branch_stats = {
383 .name = "branch_all",
034939b6
FW
384 .stat_start = all_branch_stat_start,
385 .stat_next = all_branch_stat_next,
386 .stat_headers = all_branch_stat_headers,
002bb86d 387 .stat_show = branch_stat_show
034939b6 388};
e302cf3f 389
002bb86d 390__init static int all_annotated_branch_stats(void)
e302cf3f 391{
e302cf3f 392 int ret;
002bb86d
FW
393
394 ret = register_stat_tracer(&all_branch_stats);
e302cf3f 395 if (!ret) {
002bb86d
FW
396 printk(KERN_WARNING "Warning: could not register "
397 "all branches stats\n");
e302cf3f
FW
398 return 1;
399 }
002bb86d 400 return 0;
e302cf3f 401}
002bb86d
FW
402fs_initcall(all_annotated_branch_stats);
403#endif /* CONFIG_PROFILE_ALL_BRANCHES */