blob: 6605000ed73d0b8c7a56d4319e34fbbf351b880e [file] [log] [blame]
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +09001#include "builtin.h"
2#include "perf.h"
3
4#include "util/util.h"
5#include "util/cache.h"
6#include "util/symbol.h"
7#include "util/thread.h"
8#include "util/header.h"
9
10#include "util/parse-options.h"
11#include "util/trace-event.h"
12
13#include "util/debug.h"
14#include "util/session.h"
15
16#include <sys/types.h>
17#include <sys/prctl.h>
18#include <semaphore.h>
19#include <pthread.h>
20#include <math.h>
21#include <limits.h>
22
23#include <linux/list.h>
24#include <linux/hash.h>
25
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +090026static struct perf_session *session;
27
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090028/* based on kernel/lockdep.c */
29#define LOCKHASH_BITS 12
30#define LOCKHASH_SIZE (1UL << LOCKHASH_BITS)
31
32static struct list_head lockhash_table[LOCKHASH_SIZE];
33
34#define __lockhashfn(key) hash_long((unsigned long)key, LOCKHASH_BITS)
35#define lockhashentry(key) (lockhash_table + __lockhashfn((key)))
36
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090037struct lock_stat {
Ingo Molnar59f411b2010-01-31 08:27:58 +010038 struct list_head hash_entry;
39 struct rb_node rb; /* used for sorting */
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090040
Ingo Molnar59f411b2010-01-31 08:27:58 +010041 /*
42 * FIXME: raw_field_value() returns unsigned long long,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090043 * so address of lockdep_map should be dealed as 64bit.
Ingo Molnar59f411b2010-01-31 08:27:58 +010044 * Is there more better solution?
45 */
46 void *addr; /* address of lockdep_map, used as ID */
47 char *name; /* for strcpy(), we cannot use const */
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090048
Ingo Molnar59f411b2010-01-31 08:27:58 +010049 unsigned int nr_acquire;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +090050 unsigned int nr_acquired;
Ingo Molnar59f411b2010-01-31 08:27:58 +010051 unsigned int nr_contended;
52 unsigned int nr_release;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090053
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +090054 unsigned int nr_readlock;
55 unsigned int nr_trylock;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090056 /* these times are in nano sec. */
Ingo Molnar59f411b2010-01-31 08:27:58 +010057 u64 wait_time_total;
58 u64 wait_time_min;
59 u64 wait_time_max;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +090060
61 int discard; /* flag of blacklist */
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +090062};
63
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +090064/*
65 * States of lock_seq_stat
66 *
67 * UNINITIALIZED is required for detecting first event of acquire.
68 * As the nature of lock events, there is no guarantee
69 * that the first event for the locks are acquire,
70 * it can be acquired, contended or release.
71 */
72#define SEQ_STATE_UNINITIALIZED 0 /* initial state */
73#define SEQ_STATE_RELEASED 1
74#define SEQ_STATE_ACQUIRING 2
75#define SEQ_STATE_ACQUIRED 3
76#define SEQ_STATE_READ_ACQUIRED 4
77#define SEQ_STATE_CONTENDED 5
78
79/*
80 * MAX_LOCK_DEPTH
81 * Imported from include/linux/sched.h.
82 * Should this be synchronized?
83 */
84#define MAX_LOCK_DEPTH 48
85
86/*
87 * struct lock_seq_stat:
88 * Place to put on state of one lock sequence
89 * 1) acquire -> acquired -> release
90 * 2) acquire -> contended -> acquired -> release
91 * 3) acquire (with read or try) -> release
92 * 4) Are there other patterns?
93 */
94struct lock_seq_stat {
95 struct list_head list;
96 int state;
97 u64 prev_event_time;
98 void *addr;
99
100 int read_count;
101};
102
103struct thread_stat {
104 struct rb_node rb;
105
106 u32 tid;
107 struct list_head seq_list;
108};
109
110static struct rb_root thread_stats;
111
112static struct thread_stat *thread_stat_find(u32 tid)
113{
114 struct rb_node *node;
115 struct thread_stat *st;
116
117 node = thread_stats.rb_node;
118 while (node) {
119 st = container_of(node, struct thread_stat, rb);
120 if (st->tid == tid)
121 return st;
122 else if (tid < st->tid)
123 node = node->rb_left;
124 else
125 node = node->rb_right;
126 }
127
128 return NULL;
129}
130
131static void thread_stat_insert(struct thread_stat *new)
132{
133 struct rb_node **rb = &thread_stats.rb_node;
134 struct rb_node *parent = NULL;
135 struct thread_stat *p;
136
137 while (*rb) {
138 p = container_of(*rb, struct thread_stat, rb);
139 parent = *rb;
140
141 if (new->tid < p->tid)
142 rb = &(*rb)->rb_left;
143 else if (new->tid > p->tid)
144 rb = &(*rb)->rb_right;
145 else
146 BUG_ON("inserting invalid thread_stat\n");
147 }
148
149 rb_link_node(&new->rb, parent, rb);
150 rb_insert_color(&new->rb, &thread_stats);
151}
152
153static struct thread_stat *thread_stat_findnew_after_first(u32 tid)
154{
155 struct thread_stat *st;
156
157 st = thread_stat_find(tid);
158 if (st)
159 return st;
160
161 st = zalloc(sizeof(struct thread_stat));
162 if (!st)
163 die("memory allocation failed\n");
164
165 st->tid = tid;
166 INIT_LIST_HEAD(&st->seq_list);
167
168 thread_stat_insert(st);
169
170 return st;
171}
172
173static struct thread_stat *thread_stat_findnew_first(u32 tid);
174static struct thread_stat *(*thread_stat_findnew)(u32 tid) =
175 thread_stat_findnew_first;
176
177static struct thread_stat *thread_stat_findnew_first(u32 tid)
178{
179 struct thread_stat *st;
180
181 st = zalloc(sizeof(struct thread_stat));
182 if (!st)
183 die("memory allocation failed\n");
184 st->tid = tid;
185 INIT_LIST_HEAD(&st->seq_list);
186
187 rb_link_node(&st->rb, NULL, &thread_stats.rb_node);
188 rb_insert_color(&st->rb, &thread_stats);
189
190 thread_stat_findnew = thread_stat_findnew_after_first;
191 return st;
192}
193
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900194/* build simple key function one is bigger than two */
Ingo Molnar59f411b2010-01-31 08:27:58 +0100195#define SINGLE_KEY(member) \
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900196 static int lock_stat_key_ ## member(struct lock_stat *one, \
197 struct lock_stat *two) \
198 { \
199 return one->member > two->member; \
200 }
201
202SINGLE_KEY(nr_acquired)
203SINGLE_KEY(nr_contended)
204SINGLE_KEY(wait_time_total)
205SINGLE_KEY(wait_time_min)
206SINGLE_KEY(wait_time_max)
207
208struct lock_key {
209 /*
210 * name: the value for specify by user
211 * this should be simpler than raw name of member
212 * e.g. nr_acquired -> acquired, wait_time_total -> wait_total
213 */
Ingo Molnar59f411b2010-01-31 08:27:58 +0100214 const char *name;
215 int (*key)(struct lock_stat*, struct lock_stat*);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900216};
217
Ingo Molnar59f411b2010-01-31 08:27:58 +0100218static const char *sort_key = "acquired";
219
220static int (*compare)(struct lock_stat *, struct lock_stat *);
221
222static struct rb_root result; /* place to store sorted data */
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900223
224#define DEF_KEY_LOCK(name, fn_suffix) \
225 { #name, lock_stat_key_ ## fn_suffix }
226struct lock_key keys[] = {
227 DEF_KEY_LOCK(acquired, nr_acquired),
228 DEF_KEY_LOCK(contended, nr_contended),
229 DEF_KEY_LOCK(wait_total, wait_time_total),
230 DEF_KEY_LOCK(wait_min, wait_time_min),
231 DEF_KEY_LOCK(wait_max, wait_time_max),
232
233 /* extra comparisons much complicated should be here */
234
235 { NULL, NULL }
236};
237
238static void select_key(void)
239{
240 int i;
241
242 for (i = 0; keys[i].name; i++) {
243 if (!strcmp(keys[i].name, sort_key)) {
244 compare = keys[i].key;
245 return;
246 }
247 }
248
249 die("Unknown compare key:%s\n", sort_key);
250}
251
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900252static void insert_to_result(struct lock_stat *st,
Ingo Molnar59f411b2010-01-31 08:27:58 +0100253 int (*bigger)(struct lock_stat *, struct lock_stat *))
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900254{
255 struct rb_node **rb = &result.rb_node;
256 struct rb_node *parent = NULL;
257 struct lock_stat *p;
258
259 while (*rb) {
260 p = container_of(*rb, struct lock_stat, rb);
261 parent = *rb;
262
263 if (bigger(st, p))
264 rb = &(*rb)->rb_left;
265 else
266 rb = &(*rb)->rb_right;
267 }
268
269 rb_link_node(&st->rb, parent, rb);
270 rb_insert_color(&st->rb, &result);
271}
272
273/* returns left most element of result, and erase it */
274static struct lock_stat *pop_from_result(void)
275{
276 struct rb_node *node = result.rb_node;
277
278 if (!node)
279 return NULL;
280
281 while (node->rb_left)
282 node = node->rb_left;
283
284 rb_erase(node, &result);
285 return container_of(node, struct lock_stat, rb);
286}
287
Ingo Molnar59f411b2010-01-31 08:27:58 +0100288static struct lock_stat *lock_stat_findnew(void *addr, const char *name)
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900289{
290 struct list_head *entry = lockhashentry(addr);
291 struct lock_stat *ret, *new;
292
293 list_for_each_entry(ret, entry, hash_entry) {
294 if (ret->addr == addr)
295 return ret;
296 }
297
298 new = zalloc(sizeof(struct lock_stat));
299 if (!new)
300 goto alloc_failed;
301
302 new->addr = addr;
303 new->name = zalloc(sizeof(char) * strlen(name) + 1);
304 if (!new->name)
305 goto alloc_failed;
306 strcpy(new->name, name);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900307
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900308 new->wait_time_min = ULLONG_MAX;
309
310 list_add(&new->hash_entry, entry);
311 return new;
312
313alloc_failed:
314 die("memory allocation failed\n");
315}
316
317static char const *input_name = "perf.data";
318
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900319struct raw_event_sample {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100320 u32 size;
321 char data[0];
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900322};
323
324struct trace_acquire_event {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100325 void *addr;
326 const char *name;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900327 int flag;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900328};
329
330struct trace_acquired_event {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100331 void *addr;
332 const char *name;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900333};
334
335struct trace_contended_event {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100336 void *addr;
337 const char *name;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900338};
339
340struct trace_release_event {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100341 void *addr;
342 const char *name;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900343};
344
345struct trace_lock_handler {
346 void (*acquire_event)(struct trace_acquire_event *,
347 struct event *,
348 int cpu,
349 u64 timestamp,
350 struct thread *thread);
351
352 void (*acquired_event)(struct trace_acquired_event *,
353 struct event *,
354 int cpu,
355 u64 timestamp,
356 struct thread *thread);
357
358 void (*contended_event)(struct trace_contended_event *,
359 struct event *,
360 int cpu,
361 u64 timestamp,
362 struct thread *thread);
363
364 void (*release_event)(struct trace_release_event *,
365 struct event *,
366 int cpu,
367 u64 timestamp,
368 struct thread *thread);
369};
370
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900371static struct lock_seq_stat *get_seq(struct thread_stat *ts, void *addr)
372{
373 struct lock_seq_stat *seq;
374
375 list_for_each_entry(seq, &ts->seq_list, list) {
376 if (seq->addr == addr)
377 return seq;
378 }
379
380 seq = zalloc(sizeof(struct lock_seq_stat));
381 if (!seq)
382 die("Not enough memory\n");
383 seq->state = SEQ_STATE_UNINITIALIZED;
384 seq->addr = addr;
385
386 list_add(&seq->list, &ts->seq_list);
387 return seq;
388}
389
390static int bad_hist[4];
391
Ingo Molnar59f411b2010-01-31 08:27:58 +0100392static void
393report_lock_acquire_event(struct trace_acquire_event *acquire_event,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900394 struct event *__event __used,
395 int cpu __used,
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900396 u64 timestamp __used,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900397 struct thread *thread __used)
398{
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900399 struct lock_stat *ls;
400 struct thread_stat *ts;
401 struct lock_seq_stat *seq;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900402
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900403 ls = lock_stat_findnew(acquire_event->addr, acquire_event->name);
404 if (ls->discard)
405 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900406
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900407 ts = thread_stat_findnew(thread->pid);
408 seq = get_seq(ts, acquire_event->addr);
409
410 switch (seq->state) {
411 case SEQ_STATE_UNINITIALIZED:
412 case SEQ_STATE_RELEASED:
413 if (!acquire_event->flag) {
414 seq->state = SEQ_STATE_ACQUIRING;
415 } else {
416 if (acquire_event->flag & 1)
417 ls->nr_trylock++;
418 if (acquire_event->flag & 2)
419 ls->nr_readlock++;
420 seq->state = SEQ_STATE_READ_ACQUIRED;
421 seq->read_count = 1;
422 ls->nr_acquired++;
423 }
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900424 break;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900425 case SEQ_STATE_READ_ACQUIRED:
426 if (acquire_event->flag & 2) {
427 seq->read_count++;
428 ls->nr_acquired++;
429 goto end;
430 } else {
431 goto broken;
432 }
433 break;
434 case SEQ_STATE_ACQUIRED:
435 case SEQ_STATE_ACQUIRING:
436 case SEQ_STATE_CONTENDED:
437broken:
438 /* broken lock sequence, discard it */
439 ls->discard = 1;
440 bad_hist[0]++;
441 list_del(&seq->list);
442 free(seq);
443 goto end;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900444 break;
445 default:
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900446 BUG_ON("Unknown state of lock sequence found!\n");
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900447 break;
448 }
449
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900450 ls->nr_acquire++;
451 seq->prev_event_time = timestamp;
452end:
453 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900454}
455
Ingo Molnar59f411b2010-01-31 08:27:58 +0100456static void
457report_lock_acquired_event(struct trace_acquired_event *acquired_event,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900458 struct event *__event __used,
459 int cpu __used,
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900460 u64 timestamp __used,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900461 struct thread *thread __used)
462{
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900463 struct lock_stat *ls;
464 struct thread_stat *ts;
465 struct lock_seq_stat *seq;
466 u64 contended_term;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900467
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900468 ls = lock_stat_findnew(acquired_event->addr, acquired_event->name);
469 if (ls->discard)
470 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900471
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900472 ts = thread_stat_findnew(thread->pid);
473 seq = get_seq(ts, acquired_event->addr);
474
475 switch (seq->state) {
476 case SEQ_STATE_UNINITIALIZED:
477 /* orphan event, do nothing */
478 return;
479 case SEQ_STATE_ACQUIRING:
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900480 break;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900481 case SEQ_STATE_CONTENDED:
482 contended_term = timestamp - seq->prev_event_time;
483 ls->wait_time_total += contended_term;
484
485 if (contended_term < ls->wait_time_min)
486 ls->wait_time_min = contended_term;
487 else if (ls->wait_time_max < contended_term)
488 ls->wait_time_max = contended_term;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900489 break;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900490 case SEQ_STATE_RELEASED:
491 case SEQ_STATE_ACQUIRED:
492 case SEQ_STATE_READ_ACQUIRED:
493 /* broken lock sequence, discard it */
494 ls->discard = 1;
495 bad_hist[1]++;
496 list_del(&seq->list);
497 free(seq);
498 goto end;
499 break;
500
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900501 default:
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900502 BUG_ON("Unknown state of lock sequence found!\n");
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900503 break;
504 }
505
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900506 seq->state = SEQ_STATE_ACQUIRED;
507 ls->nr_acquired++;
508 seq->prev_event_time = timestamp;
509end:
510 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900511}
512
Ingo Molnar59f411b2010-01-31 08:27:58 +0100513static void
514report_lock_contended_event(struct trace_contended_event *contended_event,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900515 struct event *__event __used,
516 int cpu __used,
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900517 u64 timestamp __used,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900518 struct thread *thread __used)
519{
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900520 struct lock_stat *ls;
521 struct thread_stat *ts;
522 struct lock_seq_stat *seq;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900523
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900524 ls = lock_stat_findnew(contended_event->addr, contended_event->name);
525 if (ls->discard)
526 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900527
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900528 ts = thread_stat_findnew(thread->pid);
529 seq = get_seq(ts, contended_event->addr);
530
531 switch (seq->state) {
532 case SEQ_STATE_UNINITIALIZED:
533 /* orphan event, do nothing */
534 return;
535 case SEQ_STATE_ACQUIRING:
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900536 break;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900537 case SEQ_STATE_RELEASED:
538 case SEQ_STATE_ACQUIRED:
539 case SEQ_STATE_READ_ACQUIRED:
540 case SEQ_STATE_CONTENDED:
541 /* broken lock sequence, discard it */
542 ls->discard = 1;
543 bad_hist[2]++;
544 list_del(&seq->list);
545 free(seq);
546 goto end;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900547 break;
548 default:
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900549 BUG_ON("Unknown state of lock sequence found!\n");
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900550 break;
551 }
552
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900553 seq->state = SEQ_STATE_CONTENDED;
554 ls->nr_contended++;
555 seq->prev_event_time = timestamp;
556end:
557 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900558}
559
Ingo Molnar59f411b2010-01-31 08:27:58 +0100560static void
561report_lock_release_event(struct trace_release_event *release_event,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900562 struct event *__event __used,
563 int cpu __used,
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900564 u64 timestamp __used,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900565 struct thread *thread __used)
566{
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900567 struct lock_stat *ls;
568 struct thread_stat *ts;
569 struct lock_seq_stat *seq;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900570
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900571 ls = lock_stat_findnew(release_event->addr, release_event->name);
572 if (ls->discard)
573 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900574
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900575 ts = thread_stat_findnew(thread->pid);
576 seq = get_seq(ts, release_event->addr);
577
578 switch (seq->state) {
579 case SEQ_STATE_UNINITIALIZED:
580 goto end;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900581 break;
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900582 case SEQ_STATE_ACQUIRED:
583 break;
584 case SEQ_STATE_READ_ACQUIRED:
585 seq->read_count--;
586 BUG_ON(seq->read_count < 0);
587 if (!seq->read_count) {
588 ls->nr_release++;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900589 goto end;
590 }
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900591 break;
592 case SEQ_STATE_ACQUIRING:
593 case SEQ_STATE_CONTENDED:
594 case SEQ_STATE_RELEASED:
595 /* broken lock sequence, discard it */
596 ls->discard = 1;
597 bad_hist[3]++;
598 goto free_seq;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900599 break;
600 default:
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900601 BUG_ON("Unknown state of lock sequence found!\n");
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900602 break;
603 }
604
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900605 ls->nr_release++;
606free_seq:
607 list_del(&seq->list);
608 free(seq);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900609end:
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900610 return;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900611}
612
613/* lock oriented handlers */
614/* TODO: handlers for CPU oriented, thread oriented */
Ingo Molnar59f411b2010-01-31 08:27:58 +0100615static struct trace_lock_handler report_lock_ops = {
616 .acquire_event = report_lock_acquire_event,
617 .acquired_event = report_lock_acquired_event,
618 .contended_event = report_lock_contended_event,
619 .release_event = report_lock_release_event,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900620};
621
622static struct trace_lock_handler *trace_handler;
623
624static void
625process_lock_acquire_event(void *data,
626 struct event *event __used,
627 int cpu __used,
628 u64 timestamp __used,
629 struct thread *thread __used)
630{
631 struct trace_acquire_event acquire_event;
632 u64 tmp; /* this is required for casting... */
633
634 tmp = raw_field_value(event, "lockdep_addr", data);
635 memcpy(&acquire_event.addr, &tmp, sizeof(void *));
636 acquire_event.name = (char *)raw_field_ptr(event, "name", data);
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900637 acquire_event.flag = (int)raw_field_value(event, "flag", data);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900638
Ingo Molnar59f411b2010-01-31 08:27:58 +0100639 if (trace_handler->acquire_event)
640 trace_handler->acquire_event(&acquire_event, event, cpu, timestamp, thread);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900641}
642
643static void
644process_lock_acquired_event(void *data,
645 struct event *event __used,
646 int cpu __used,
647 u64 timestamp __used,
648 struct thread *thread __used)
649{
650 struct trace_acquired_event acquired_event;
651 u64 tmp; /* this is required for casting... */
652
653 tmp = raw_field_value(event, "lockdep_addr", data);
654 memcpy(&acquired_event.addr, &tmp, sizeof(void *));
655 acquired_event.name = (char *)raw_field_ptr(event, "name", data);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900656
Ingo Molnar59f411b2010-01-31 08:27:58 +0100657 if (trace_handler->acquire_event)
658 trace_handler->acquired_event(&acquired_event, event, cpu, timestamp, thread);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900659}
660
661static void
662process_lock_contended_event(void *data,
663 struct event *event __used,
664 int cpu __used,
665 u64 timestamp __used,
666 struct thread *thread __used)
667{
668 struct trace_contended_event contended_event;
669 u64 tmp; /* this is required for casting... */
670
671 tmp = raw_field_value(event, "lockdep_addr", data);
672 memcpy(&contended_event.addr, &tmp, sizeof(void *));
673 contended_event.name = (char *)raw_field_ptr(event, "name", data);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900674
Ingo Molnar59f411b2010-01-31 08:27:58 +0100675 if (trace_handler->acquire_event)
676 trace_handler->contended_event(&contended_event, event, cpu, timestamp, thread);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900677}
678
679static void
680process_lock_release_event(void *data,
681 struct event *event __used,
682 int cpu __used,
683 u64 timestamp __used,
684 struct thread *thread __used)
685{
686 struct trace_release_event release_event;
687 u64 tmp; /* this is required for casting... */
688
689 tmp = raw_field_value(event, "lockdep_addr", data);
690 memcpy(&release_event.addr, &tmp, sizeof(void *));
691 release_event.name = (char *)raw_field_ptr(event, "name", data);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900692
Ingo Molnar59f411b2010-01-31 08:27:58 +0100693 if (trace_handler->acquire_event)
694 trace_handler->release_event(&release_event, event, cpu, timestamp, thread);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900695}
696
697static void
Frederic Weisbeckerc61e52e2010-04-24 00:04:12 +0200698process_raw_event(void *data, int cpu, u64 timestamp, struct thread *thread)
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900699{
700 struct event *event;
701 int type;
702
703 type = trace_parse_common_type(data);
704 event = trace_find_event(type);
705
706 if (!strcmp(event->name, "lock_acquire"))
707 process_lock_acquire_event(data, event, cpu, timestamp, thread);
708 if (!strcmp(event->name, "lock_acquired"))
709 process_lock_acquired_event(data, event, cpu, timestamp, thread);
710 if (!strcmp(event->name, "lock_contended"))
711 process_lock_contended_event(data, event, cpu, timestamp, thread);
712 if (!strcmp(event->name, "lock_release"))
713 process_lock_release_event(data, event, cpu, timestamp, thread);
714}
715
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900716/* TODO: various way to print, coloring, nano or milli sec */
717static void print_result(void)
718{
719 struct lock_stat *st;
720 char cut_name[20];
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900721 int bad, total;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900722
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900723 printf("%20s ", "Name");
724 printf("%10s ", "acquired");
725 printf("%10s ", "contended");
726
727 printf("%15s ", "total wait (ns)");
728 printf("%15s ", "max wait (ns)");
729 printf("%15s ", "min wait (ns)");
730
731 printf("\n\n");
732
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900733 bad = total = 0;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900734 while ((st = pop_from_result())) {
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900735 total++;
736 if (st->discard) {
737 bad++;
738 continue;
739 }
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900740 bzero(cut_name, 20);
741
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900742 if (strlen(st->name) < 16) {
743 /* output raw name */
744 printf("%20s ", st->name);
745 } else {
746 strncpy(cut_name, st->name, 16);
747 cut_name[16] = '.';
748 cut_name[17] = '.';
749 cut_name[18] = '.';
750 cut_name[19] = '\0';
751 /* cut off name for saving output style */
752 printf("%20s ", cut_name);
753 }
754
755 printf("%10u ", st->nr_acquired);
756 printf("%10u ", st->nr_contended);
757
758 printf("%15llu ", st->wait_time_total);
759 printf("%15llu ", st->wait_time_max);
760 printf("%15llu ", st->wait_time_min == ULLONG_MAX ?
761 0 : st->wait_time_min);
762 printf("\n");
763 }
Hitoshi Mitakee4cef1f2010-04-21 21:23:54 +0900764
765 {
766 /* Output for debug, this have to be removed */
767 int i;
768 const char *name[4] =
769 { "acquire", "acquired", "contended", "release" };
770
771 printf("\n=== output for debug===\n\n");
772 printf("bad:%d, total:%d\n", bad, total);
773 printf("bad rate:%f\n", (double)(bad / total));
774
775 printf("histogram of events caused bad sequence\n");
776 for (i = 0; i < 4; i++)
777 printf(" %10s: %d\n", name[i], bad_hist[i]);
778 }
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900779}
780
781static void dump_map(void)
782{
783 unsigned int i;
784 struct lock_stat *st;
785
786 for (i = 0; i < LOCKHASH_SIZE; i++) {
787 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100788 printf("%p: %s\n", st->addr, st->name);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900789 }
790 }
791}
792
Frederic Weisbeckerc61e52e2010-04-24 00:04:12 +0200793static int process_sample_event(event_t *self, struct perf_session *s)
794{
795 struct sample_data data;
796 struct thread *thread;
797
798 bzero(&data, sizeof(data));
799 event__parse_sample(self, s->sample_type, &data);
800
801 thread = perf_session__findnew(s, data.tid);
802 if (thread == NULL) {
803 pr_debug("problem processing %d event, skipping it.\n",
804 self->header.type);
805 return -1;
806 }
807
808 process_raw_event(data.raw_data, data.cpu, data.time, thread);
809
810 return 0;
811}
812
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900813static struct perf_event_ops eops = {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100814 .sample = process_sample_event,
815 .comm = event__process_comm,
Frederic Weisbeckerc61e52e2010-04-24 00:04:12 +0200816 .ordered_samples = true,
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900817};
818
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900819static int read_events(void)
820{
Tom Zanussi454c4072010-05-01 01:41:20 -0500821 session = perf_session__new(input_name, O_RDONLY, 0, false);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900822 if (!session)
823 die("Initializing perf session failed\n");
824
825 return perf_session__process_events(session, &eops);
826}
827
828static void sort_result(void)
829{
830 unsigned int i;
831 struct lock_stat *st;
832
833 for (i = 0; i < LOCKHASH_SIZE; i++) {
834 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
835 insert_to_result(st, compare);
836 }
837 }
838}
839
Ingo Molnar59f411b2010-01-31 08:27:58 +0100840static void __cmd_report(void)
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900841{
842 setup_pager();
843 select_key();
844 read_events();
845 sort_result();
846 print_result();
847}
848
Ingo Molnar59f411b2010-01-31 08:27:58 +0100849static const char * const report_usage[] = {
850 "perf lock report [<options>]",
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900851 NULL
852};
853
Ingo Molnar59f411b2010-01-31 08:27:58 +0100854static const struct option report_options[] = {
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900855 OPT_STRING('k', "key", &sort_key, "acquired",
856 "key for sorting"),
857 /* TODO: type */
858 OPT_END()
859};
860
861static const char * const lock_usage[] = {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100862 "perf lock [<options>] {record|trace|report}",
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900863 NULL
864};
865
866static const struct option lock_options[] = {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100867 OPT_STRING('i', "input", &input_name, "file", "input file name"),
Ian Munsiec0555642010-04-13 18:37:33 +1000868 OPT_INCR('v', "verbose", &verbose, "be more verbose (show symbol address, etc)"),
Ingo Molnar59f411b2010-01-31 08:27:58 +0100869 OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, "dump raw trace in ASCII"),
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900870 OPT_END()
871};
872
873static const char *record_args[] = {
874 "record",
875 "-a",
876 "-R",
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900877 "-f",
878 "-m", "1024",
879 "-c", "1",
880 "-e", "lock:lock_acquire:r",
881 "-e", "lock:lock_acquired:r",
882 "-e", "lock:lock_contended:r",
883 "-e", "lock:lock_release:r",
884};
885
886static int __cmd_record(int argc, const char **argv)
887{
888 unsigned int rec_argc, i, j;
889 const char **rec_argv;
890
891 rec_argc = ARRAY_SIZE(record_args) + argc - 1;
892 rec_argv = calloc(rec_argc + 1, sizeof(char *));
893
894 for (i = 0; i < ARRAY_SIZE(record_args); i++)
895 rec_argv[i] = strdup(record_args[i]);
896
897 for (j = 1; j < (unsigned int)argc; j++, i++)
898 rec_argv[i] = argv[j];
899
900 BUG_ON(i != rec_argc);
901
902 return cmd_record(i, rec_argv, NULL);
903}
904
905int cmd_lock(int argc, const char **argv, const char *prefix __used)
906{
907 unsigned int i;
908
909 symbol__init();
910 for (i = 0; i < LOCKHASH_SIZE; i++)
911 INIT_LIST_HEAD(lockhash_table + i);
912
913 argc = parse_options(argc, argv, lock_options, lock_usage,
914 PARSE_OPT_STOP_AT_NON_OPTION);
915 if (!argc)
916 usage_with_options(lock_usage, lock_options);
917
918 if (!strncmp(argv[0], "rec", 3)) {
919 return __cmd_record(argc, argv);
Ingo Molnar59f411b2010-01-31 08:27:58 +0100920 } else if (!strncmp(argv[0], "report", 6)) {
921 trace_handler = &report_lock_ops;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900922 if (argc) {
923 argc = parse_options(argc, argv,
Ingo Molnar59f411b2010-01-31 08:27:58 +0100924 report_options, report_usage, 0);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900925 if (argc)
Ingo Molnar59f411b2010-01-31 08:27:58 +0100926 usage_with_options(report_usage, report_options);
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900927 }
Ingo Molnar59f411b2010-01-31 08:27:58 +0100928 __cmd_report();
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900929 } else if (!strcmp(argv[0], "trace")) {
930 /* Aliased to 'perf trace' */
931 return cmd_trace(argc, argv, prefix);
932 } else if (!strcmp(argv[0], "map")) {
Ingo Molnar59f411b2010-01-31 08:27:58 +0100933 /* recycling report_lock_ops */
934 trace_handler = &report_lock_ops;
Hitoshi Mitake9b5e3502010-01-30 20:43:33 +0900935 setup_pager();
936 read_events();
937 dump_map();
938 } else {
939 usage_with_options(lock_usage, lock_options);
940 }
941
942 return 0;
943}