Loading...
1#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
26static struct perf_session *session;
27
28/* 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
37struct lock_stat {
38 struct list_head hash_entry;
39 struct rb_node rb; /* used for sorting */
40
41 /*
42 * FIXME: raw_field_value() returns unsigned long long,
43 * so address of lockdep_map should be dealed as 64bit.
44 * 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 */
48
49 unsigned int nr_acquire;
50 unsigned int nr_acquired;
51 unsigned int nr_contended;
52 unsigned int nr_release;
53
54 unsigned int nr_readlock;
55 unsigned int nr_trylock;
56 /* these times are in nano sec. */
57 u64 wait_time_total;
58 u64 wait_time_min;
59 u64 wait_time_max;
60
61 int discard; /* flag of blacklist */
62};
63
64/*
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
194/* build simple key function one is bigger than two */
195#define SINGLE_KEY(member) \
196 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_max)
206
207static int lock_stat_key_wait_time_min(struct lock_stat *one,
208 struct lock_stat *two)
209{
210 u64 s1 = one->wait_time_min;
211 u64 s2 = two->wait_time_min;
212 if (s1 == ULLONG_MAX)
213 s1 = 0;
214 if (s2 == ULLONG_MAX)
215 s2 = 0;
216 return s1 > s2;
217}
218
219struct lock_key {
220 /*
221 * name: the value for specify by user
222 * this should be simpler than raw name of member
223 * e.g. nr_acquired -> acquired, wait_time_total -> wait_total
224 */
225 const char *name;
226 int (*key)(struct lock_stat*, struct lock_stat*);
227};
228
229static const char *sort_key = "acquired";
230
231static int (*compare)(struct lock_stat *, struct lock_stat *);
232
233static struct rb_root result; /* place to store sorted data */
234
235#define DEF_KEY_LOCK(name, fn_suffix) \
236 { #name, lock_stat_key_ ## fn_suffix }
237struct lock_key keys[] = {
238 DEF_KEY_LOCK(acquired, nr_acquired),
239 DEF_KEY_LOCK(contended, nr_contended),
240 DEF_KEY_LOCK(wait_total, wait_time_total),
241 DEF_KEY_LOCK(wait_min, wait_time_min),
242 DEF_KEY_LOCK(wait_max, wait_time_max),
243
244 /* extra comparisons much complicated should be here */
245
246 { NULL, NULL }
247};
248
249static void select_key(void)
250{
251 int i;
252
253 for (i = 0; keys[i].name; i++) {
254 if (!strcmp(keys[i].name, sort_key)) {
255 compare = keys[i].key;
256 return;
257 }
258 }
259
260 die("Unknown compare key:%s\n", sort_key);
261}
262
263static void insert_to_result(struct lock_stat *st,
264 int (*bigger)(struct lock_stat *, struct lock_stat *))
265{
266 struct rb_node **rb = &result.rb_node;
267 struct rb_node *parent = NULL;
268 struct lock_stat *p;
269
270 while (*rb) {
271 p = container_of(*rb, struct lock_stat, rb);
272 parent = *rb;
273
274 if (bigger(st, p))
275 rb = &(*rb)->rb_left;
276 else
277 rb = &(*rb)->rb_right;
278 }
279
280 rb_link_node(&st->rb, parent, rb);
281 rb_insert_color(&st->rb, &result);
282}
283
284/* returns left most element of result, and erase it */
285static struct lock_stat *pop_from_result(void)
286{
287 struct rb_node *node = result.rb_node;
288
289 if (!node)
290 return NULL;
291
292 while (node->rb_left)
293 node = node->rb_left;
294
295 rb_erase(node, &result);
296 return container_of(node, struct lock_stat, rb);
297}
298
299static struct lock_stat *lock_stat_findnew(void *addr, const char *name)
300{
301 struct list_head *entry = lockhashentry(addr);
302 struct lock_stat *ret, *new;
303
304 list_for_each_entry(ret, entry, hash_entry) {
305 if (ret->addr == addr)
306 return ret;
307 }
308
309 new = zalloc(sizeof(struct lock_stat));
310 if (!new)
311 goto alloc_failed;
312
313 new->addr = addr;
314 new->name = zalloc(sizeof(char) * strlen(name) + 1);
315 if (!new->name)
316 goto alloc_failed;
317 strcpy(new->name, name);
318
319 new->wait_time_min = ULLONG_MAX;
320
321 list_add(&new->hash_entry, entry);
322 return new;
323
324alloc_failed:
325 die("memory allocation failed\n");
326}
327
328static char const *input_name = "perf.data";
329
330struct raw_event_sample {
331 u32 size;
332 char data[0];
333};
334
335struct trace_acquire_event {
336 void *addr;
337 const char *name;
338 int flag;
339};
340
341struct trace_acquired_event {
342 void *addr;
343 const char *name;
344};
345
346struct trace_contended_event {
347 void *addr;
348 const char *name;
349};
350
351struct trace_release_event {
352 void *addr;
353 const char *name;
354};
355
356struct trace_lock_handler {
357 void (*acquire_event)(struct trace_acquire_event *,
358 struct event *,
359 int cpu,
360 u64 timestamp,
361 struct thread *thread);
362
363 void (*acquired_event)(struct trace_acquired_event *,
364 struct event *,
365 int cpu,
366 u64 timestamp,
367 struct thread *thread);
368
369 void (*contended_event)(struct trace_contended_event *,
370 struct event *,
371 int cpu,
372 u64 timestamp,
373 struct thread *thread);
374
375 void (*release_event)(struct trace_release_event *,
376 struct event *,
377 int cpu,
378 u64 timestamp,
379 struct thread *thread);
380};
381
382static struct lock_seq_stat *get_seq(struct thread_stat *ts, void *addr)
383{
384 struct lock_seq_stat *seq;
385
386 list_for_each_entry(seq, &ts->seq_list, list) {
387 if (seq->addr == addr)
388 return seq;
389 }
390
391 seq = zalloc(sizeof(struct lock_seq_stat));
392 if (!seq)
393 die("Not enough memory\n");
394 seq->state = SEQ_STATE_UNINITIALIZED;
395 seq->addr = addr;
396
397 list_add(&seq->list, &ts->seq_list);
398 return seq;
399}
400
401enum broken_state {
402 BROKEN_ACQUIRE,
403 BROKEN_ACQUIRED,
404 BROKEN_CONTENDED,
405 BROKEN_RELEASE,
406 BROKEN_MAX,
407};
408
409static int bad_hist[BROKEN_MAX];
410
411enum acquire_flags {
412 TRY_LOCK = 1,
413 READ_LOCK = 2,
414};
415
416static void
417report_lock_acquire_event(struct trace_acquire_event *acquire_event,
418 struct event *__event __used,
419 int cpu __used,
420 u64 timestamp __used,
421 struct thread *thread __used)
422{
423 struct lock_stat *ls;
424 struct thread_stat *ts;
425 struct lock_seq_stat *seq;
426
427 ls = lock_stat_findnew(acquire_event->addr, acquire_event->name);
428 if (ls->discard)
429 return;
430
431 ts = thread_stat_findnew(thread->pid);
432 seq = get_seq(ts, acquire_event->addr);
433
434 switch (seq->state) {
435 case SEQ_STATE_UNINITIALIZED:
436 case SEQ_STATE_RELEASED:
437 if (!acquire_event->flag) {
438 seq->state = SEQ_STATE_ACQUIRING;
439 } else {
440 if (acquire_event->flag & TRY_LOCK)
441 ls->nr_trylock++;
442 if (acquire_event->flag & READ_LOCK)
443 ls->nr_readlock++;
444 seq->state = SEQ_STATE_READ_ACQUIRED;
445 seq->read_count = 1;
446 ls->nr_acquired++;
447 }
448 break;
449 case SEQ_STATE_READ_ACQUIRED:
450 if (acquire_event->flag & READ_LOCK) {
451 seq->read_count++;
452 ls->nr_acquired++;
453 goto end;
454 } else {
455 goto broken;
456 }
457 break;
458 case SEQ_STATE_ACQUIRED:
459 case SEQ_STATE_ACQUIRING:
460 case SEQ_STATE_CONTENDED:
461broken:
462 /* broken lock sequence, discard it */
463 ls->discard = 1;
464 bad_hist[BROKEN_ACQUIRE]++;
465 list_del(&seq->list);
466 free(seq);
467 goto end;
468 break;
469 default:
470 BUG_ON("Unknown state of lock sequence found!\n");
471 break;
472 }
473
474 ls->nr_acquire++;
475 seq->prev_event_time = timestamp;
476end:
477 return;
478}
479
480static void
481report_lock_acquired_event(struct trace_acquired_event *acquired_event,
482 struct event *__event __used,
483 int cpu __used,
484 u64 timestamp __used,
485 struct thread *thread __used)
486{
487 struct lock_stat *ls;
488 struct thread_stat *ts;
489 struct lock_seq_stat *seq;
490 u64 contended_term;
491
492 ls = lock_stat_findnew(acquired_event->addr, acquired_event->name);
493 if (ls->discard)
494 return;
495
496 ts = thread_stat_findnew(thread->pid);
497 seq = get_seq(ts, acquired_event->addr);
498
499 switch (seq->state) {
500 case SEQ_STATE_UNINITIALIZED:
501 /* orphan event, do nothing */
502 return;
503 case SEQ_STATE_ACQUIRING:
504 break;
505 case SEQ_STATE_CONTENDED:
506 contended_term = timestamp - seq->prev_event_time;
507 ls->wait_time_total += contended_term;
508 if (contended_term < ls->wait_time_min)
509 ls->wait_time_min = contended_term;
510 if (ls->wait_time_max < contended_term)
511 ls->wait_time_max = contended_term;
512 break;
513 case SEQ_STATE_RELEASED:
514 case SEQ_STATE_ACQUIRED:
515 case SEQ_STATE_READ_ACQUIRED:
516 /* broken lock sequence, discard it */
517 ls->discard = 1;
518 bad_hist[BROKEN_ACQUIRED]++;
519 list_del(&seq->list);
520 free(seq);
521 goto end;
522 break;
523
524 default:
525 BUG_ON("Unknown state of lock sequence found!\n");
526 break;
527 }
528
529 seq->state = SEQ_STATE_ACQUIRED;
530 ls->nr_acquired++;
531 seq->prev_event_time = timestamp;
532end:
533 return;
534}
535
536static void
537report_lock_contended_event(struct trace_contended_event *contended_event,
538 struct event *__event __used,
539 int cpu __used,
540 u64 timestamp __used,
541 struct thread *thread __used)
542{
543 struct lock_stat *ls;
544 struct thread_stat *ts;
545 struct lock_seq_stat *seq;
546
547 ls = lock_stat_findnew(contended_event->addr, contended_event->name);
548 if (ls->discard)
549 return;
550
551 ts = thread_stat_findnew(thread->pid);
552 seq = get_seq(ts, contended_event->addr);
553
554 switch (seq->state) {
555 case SEQ_STATE_UNINITIALIZED:
556 /* orphan event, do nothing */
557 return;
558 case SEQ_STATE_ACQUIRING:
559 break;
560 case SEQ_STATE_RELEASED:
561 case SEQ_STATE_ACQUIRED:
562 case SEQ_STATE_READ_ACQUIRED:
563 case SEQ_STATE_CONTENDED:
564 /* broken lock sequence, discard it */
565 ls->discard = 1;
566 bad_hist[BROKEN_CONTENDED]++;
567 list_del(&seq->list);
568 free(seq);
569 goto end;
570 break;
571 default:
572 BUG_ON("Unknown state of lock sequence found!\n");
573 break;
574 }
575
576 seq->state = SEQ_STATE_CONTENDED;
577 ls->nr_contended++;
578 seq->prev_event_time = timestamp;
579end:
580 return;
581}
582
583static void
584report_lock_release_event(struct trace_release_event *release_event,
585 struct event *__event __used,
586 int cpu __used,
587 u64 timestamp __used,
588 struct thread *thread __used)
589{
590 struct lock_stat *ls;
591 struct thread_stat *ts;
592 struct lock_seq_stat *seq;
593
594 ls = lock_stat_findnew(release_event->addr, release_event->name);
595 if (ls->discard)
596 return;
597
598 ts = thread_stat_findnew(thread->pid);
599 seq = get_seq(ts, release_event->addr);
600
601 switch (seq->state) {
602 case SEQ_STATE_UNINITIALIZED:
603 goto end;
604 break;
605 case SEQ_STATE_ACQUIRED:
606 break;
607 case SEQ_STATE_READ_ACQUIRED:
608 seq->read_count--;
609 BUG_ON(seq->read_count < 0);
610 if (!seq->read_count) {
611 ls->nr_release++;
612 goto end;
613 }
614 break;
615 case SEQ_STATE_ACQUIRING:
616 case SEQ_STATE_CONTENDED:
617 case SEQ_STATE_RELEASED:
618 /* broken lock sequence, discard it */
619 ls->discard = 1;
620 bad_hist[BROKEN_RELEASE]++;
621 goto free_seq;
622 break;
623 default:
624 BUG_ON("Unknown state of lock sequence found!\n");
625 break;
626 }
627
628 ls->nr_release++;
629free_seq:
630 list_del(&seq->list);
631 free(seq);
632end:
633 return;
634}
635
636/* lock oriented handlers */
637/* TODO: handlers for CPU oriented, thread oriented */
638static struct trace_lock_handler report_lock_ops = {
639 .acquire_event = report_lock_acquire_event,
640 .acquired_event = report_lock_acquired_event,
641 .contended_event = report_lock_contended_event,
642 .release_event = report_lock_release_event,
643};
644
645static struct trace_lock_handler *trace_handler;
646
647static void
648process_lock_acquire_event(void *data,
649 struct event *event __used,
650 int cpu __used,
651 u64 timestamp __used,
652 struct thread *thread __used)
653{
654 struct trace_acquire_event acquire_event;
655 u64 tmp; /* this is required for casting... */
656
657 tmp = raw_field_value(event, "lockdep_addr", data);
658 memcpy(&acquire_event.addr, &tmp, sizeof(void *));
659 acquire_event.name = (char *)raw_field_ptr(event, "name", data);
660 acquire_event.flag = (int)raw_field_value(event, "flag", data);
661
662 if (trace_handler->acquire_event)
663 trace_handler->acquire_event(&acquire_event, event, cpu, timestamp, thread);
664}
665
666static void
667process_lock_acquired_event(void *data,
668 struct event *event __used,
669 int cpu __used,
670 u64 timestamp __used,
671 struct thread *thread __used)
672{
673 struct trace_acquired_event acquired_event;
674 u64 tmp; /* this is required for casting... */
675
676 tmp = raw_field_value(event, "lockdep_addr", data);
677 memcpy(&acquired_event.addr, &tmp, sizeof(void *));
678 acquired_event.name = (char *)raw_field_ptr(event, "name", data);
679
680 if (trace_handler->acquire_event)
681 trace_handler->acquired_event(&acquired_event, event, cpu, timestamp, thread);
682}
683
684static void
685process_lock_contended_event(void *data,
686 struct event *event __used,
687 int cpu __used,
688 u64 timestamp __used,
689 struct thread *thread __used)
690{
691 struct trace_contended_event contended_event;
692 u64 tmp; /* this is required for casting... */
693
694 tmp = raw_field_value(event, "lockdep_addr", data);
695 memcpy(&contended_event.addr, &tmp, sizeof(void *));
696 contended_event.name = (char *)raw_field_ptr(event, "name", data);
697
698 if (trace_handler->acquire_event)
699 trace_handler->contended_event(&contended_event, event, cpu, timestamp, thread);
700}
701
702static void
703process_lock_release_event(void *data,
704 struct event *event __used,
705 int cpu __used,
706 u64 timestamp __used,
707 struct thread *thread __used)
708{
709 struct trace_release_event release_event;
710 u64 tmp; /* this is required for casting... */
711
712 tmp = raw_field_value(event, "lockdep_addr", data);
713 memcpy(&release_event.addr, &tmp, sizeof(void *));
714 release_event.name = (char *)raw_field_ptr(event, "name", data);
715
716 if (trace_handler->acquire_event)
717 trace_handler->release_event(&release_event, event, cpu, timestamp, thread);
718}
719
720static void
721process_raw_event(void *data, int cpu, u64 timestamp, struct thread *thread)
722{
723 struct event *event;
724 int type;
725
726 type = trace_parse_common_type(data);
727 event = trace_find_event(type);
728
729 if (!strcmp(event->name, "lock_acquire"))
730 process_lock_acquire_event(data, event, cpu, timestamp, thread);
731 if (!strcmp(event->name, "lock_acquired"))
732 process_lock_acquired_event(data, event, cpu, timestamp, thread);
733 if (!strcmp(event->name, "lock_contended"))
734 process_lock_contended_event(data, event, cpu, timestamp, thread);
735 if (!strcmp(event->name, "lock_release"))
736 process_lock_release_event(data, event, cpu, timestamp, thread);
737}
738
739static void print_bad_events(int bad, int total)
740{
741 /* Output for debug, this have to be removed */
742 int i;
743 const char *name[4] =
744 { "acquire", "acquired", "contended", "release" };
745
746 pr_info("\n=== output for debug===\n\n");
747 pr_info("bad: %d, total: %d\n", bad, total);
748 pr_info("bad rate: %f %%\n", (double)bad / (double)total * 100);
749 pr_info("histogram of events caused bad sequence\n");
750 for (i = 0; i < BROKEN_MAX; i++)
751 pr_info(" %10s: %d\n", name[i], bad_hist[i]);
752}
753
754/* TODO: various way to print, coloring, nano or milli sec */
755static void print_result(void)
756{
757 struct lock_stat *st;
758 char cut_name[20];
759 int bad, total;
760
761 pr_info("%20s ", "Name");
762 pr_info("%10s ", "acquired");
763 pr_info("%10s ", "contended");
764
765 pr_info("%15s ", "total wait (ns)");
766 pr_info("%15s ", "max wait (ns)");
767 pr_info("%15s ", "min wait (ns)");
768
769 pr_info("\n\n");
770
771 bad = total = 0;
772 while ((st = pop_from_result())) {
773 total++;
774 if (st->discard) {
775 bad++;
776 continue;
777 }
778 bzero(cut_name, 20);
779
780 if (strlen(st->name) < 16) {
781 /* output raw name */
782 pr_info("%20s ", st->name);
783 } else {
784 strncpy(cut_name, st->name, 16);
785 cut_name[16] = '.';
786 cut_name[17] = '.';
787 cut_name[18] = '.';
788 cut_name[19] = '\0';
789 /* cut off name for saving output style */
790 pr_info("%20s ", cut_name);
791 }
792
793 pr_info("%10u ", st->nr_acquired);
794 pr_info("%10u ", st->nr_contended);
795
796 pr_info("%15" PRIu64 " ", st->wait_time_total);
797 pr_info("%15" PRIu64 " ", st->wait_time_max);
798 pr_info("%15" PRIu64 " ", st->wait_time_min == ULLONG_MAX ?
799 0 : st->wait_time_min);
800 pr_info("\n");
801 }
802
803 print_bad_events(bad, total);
804}
805
806static bool info_threads, info_map;
807
808static void dump_threads(void)
809{
810 struct thread_stat *st;
811 struct rb_node *node;
812 struct thread *t;
813
814 pr_info("%10s: comm\n", "Thread ID");
815
816 node = rb_first(&thread_stats);
817 while (node) {
818 st = container_of(node, struct thread_stat, rb);
819 t = perf_session__findnew(session, st->tid);
820 pr_info("%10d: %s\n", st->tid, t->comm);
821 node = rb_next(node);
822 };
823}
824
825static void dump_map(void)
826{
827 unsigned int i;
828 struct lock_stat *st;
829
830 pr_info("Address of instance: name of class\n");
831 for (i = 0; i < LOCKHASH_SIZE; i++) {
832 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
833 pr_info(" %p: %s\n", st->addr, st->name);
834 }
835 }
836}
837
838static void dump_info(void)
839{
840 if (info_threads)
841 dump_threads();
842 else if (info_map)
843 dump_map();
844 else
845 die("Unknown type of information\n");
846}
847
848static int process_sample_event(union perf_event *event,
849 struct perf_sample *sample,
850 struct perf_evsel *evsel __used,
851 struct perf_session *s)
852{
853 struct thread *thread = perf_session__findnew(s, sample->tid);
854
855 if (thread == NULL) {
856 pr_debug("problem processing %d event, skipping it.\n",
857 event->header.type);
858 return -1;
859 }
860
861 process_raw_event(sample->raw_data, sample->cpu, sample->time, thread);
862
863 return 0;
864}
865
866static struct perf_event_ops eops = {
867 .sample = process_sample_event,
868 .comm = perf_event__process_comm,
869 .ordered_samples = true,
870};
871
872static int read_events(void)
873{
874 session = perf_session__new(input_name, O_RDONLY, 0, false, &eops);
875 if (!session)
876 die("Initializing perf session failed\n");
877
878 return perf_session__process_events(session, &eops);
879}
880
881static void sort_result(void)
882{
883 unsigned int i;
884 struct lock_stat *st;
885
886 for (i = 0; i < LOCKHASH_SIZE; i++) {
887 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
888 insert_to_result(st, compare);
889 }
890 }
891}
892
893static void __cmd_report(void)
894{
895 setup_pager();
896 select_key();
897 read_events();
898 sort_result();
899 print_result();
900}
901
902static const char * const report_usage[] = {
903 "perf lock report [<options>]",
904 NULL
905};
906
907static const struct option report_options[] = {
908 OPT_STRING('k', "key", &sort_key, "acquired",
909 "key for sorting (acquired / contended / wait_total / wait_max / wait_min)"),
910 /* TODO: type */
911 OPT_END()
912};
913
914static const char * const info_usage[] = {
915 "perf lock info [<options>]",
916 NULL
917};
918
919static const struct option info_options[] = {
920 OPT_BOOLEAN('t', "threads", &info_threads,
921 "dump thread list in perf.data"),
922 OPT_BOOLEAN('m', "map", &info_map,
923 "map of lock instances (name:address table)"),
924 OPT_END()
925};
926
927static const char * const lock_usage[] = {
928 "perf lock [<options>] {record|trace|report}",
929 NULL
930};
931
932static const struct option lock_options[] = {
933 OPT_STRING('i', "input", &input_name, "file", "input file name"),
934 OPT_INCR('v', "verbose", &verbose, "be more verbose (show symbol address, etc)"),
935 OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, "dump raw trace in ASCII"),
936 OPT_END()
937};
938
939static const char *record_args[] = {
940 "record",
941 "-R",
942 "-f",
943 "-m", "1024",
944 "-c", "1",
945 "-e", "lock:lock_acquire",
946 "-e", "lock:lock_acquired",
947 "-e", "lock:lock_contended",
948 "-e", "lock:lock_release",
949};
950
951static int __cmd_record(int argc, const char **argv)
952{
953 unsigned int rec_argc, i, j;
954 const char **rec_argv;
955
956 rec_argc = ARRAY_SIZE(record_args) + argc - 1;
957 rec_argv = calloc(rec_argc + 1, sizeof(char *));
958
959 if (rec_argv == NULL)
960 return -ENOMEM;
961
962 for (i = 0; i < ARRAY_SIZE(record_args); i++)
963 rec_argv[i] = strdup(record_args[i]);
964
965 for (j = 1; j < (unsigned int)argc; j++, i++)
966 rec_argv[i] = argv[j];
967
968 BUG_ON(i != rec_argc);
969
970 return cmd_record(i, rec_argv, NULL);
971}
972
973int cmd_lock(int argc, const char **argv, const char *prefix __used)
974{
975 unsigned int i;
976
977 symbol__init();
978 for (i = 0; i < LOCKHASH_SIZE; i++)
979 INIT_LIST_HEAD(lockhash_table + i);
980
981 argc = parse_options(argc, argv, lock_options, lock_usage,
982 PARSE_OPT_STOP_AT_NON_OPTION);
983 if (!argc)
984 usage_with_options(lock_usage, lock_options);
985
986 if (!strncmp(argv[0], "rec", 3)) {
987 return __cmd_record(argc, argv);
988 } else if (!strncmp(argv[0], "report", 6)) {
989 trace_handler = &report_lock_ops;
990 if (argc) {
991 argc = parse_options(argc, argv,
992 report_options, report_usage, 0);
993 if (argc)
994 usage_with_options(report_usage, report_options);
995 }
996 __cmd_report();
997 } else if (!strcmp(argv[0], "script")) {
998 /* Aliased to 'perf script' */
999 return cmd_script(argc, argv, prefix);
1000 } else if (!strcmp(argv[0], "info")) {
1001 if (argc) {
1002 argc = parse_options(argc, argv,
1003 info_options, info_usage, 0);
1004 if (argc)
1005 usage_with_options(info_usage, info_options);
1006 }
1007 /* recycling report_lock_ops */
1008 trace_handler = &report_lock_ops;
1009 setup_pager();
1010 read_events();
1011 dump_info();
1012 } else {
1013 usage_with_options(lock_usage, lock_options);
1014 }
1015
1016 return 0;
1017}
1#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#include "util/tool.h"
16
17#include <sys/types.h>
18#include <sys/prctl.h>
19#include <semaphore.h>
20#include <pthread.h>
21#include <math.h>
22#include <limits.h>
23
24#include <linux/list.h>
25#include <linux/hash.h>
26
27static struct perf_session *session;
28
29/* based on kernel/lockdep.c */
30#define LOCKHASH_BITS 12
31#define LOCKHASH_SIZE (1UL << LOCKHASH_BITS)
32
33static struct list_head lockhash_table[LOCKHASH_SIZE];
34
35#define __lockhashfn(key) hash_long((unsigned long)key, LOCKHASH_BITS)
36#define lockhashentry(key) (lockhash_table + __lockhashfn((key)))
37
38struct lock_stat {
39 struct list_head hash_entry;
40 struct rb_node rb; /* used for sorting */
41
42 /*
43 * FIXME: raw_field_value() returns unsigned long long,
44 * so address of lockdep_map should be dealed as 64bit.
45 * Is there more better solution?
46 */
47 void *addr; /* address of lockdep_map, used as ID */
48 char *name; /* for strcpy(), we cannot use const */
49
50 unsigned int nr_acquire;
51 unsigned int nr_acquired;
52 unsigned int nr_contended;
53 unsigned int nr_release;
54
55 unsigned int nr_readlock;
56 unsigned int nr_trylock;
57 /* these times are in nano sec. */
58 u64 wait_time_total;
59 u64 wait_time_min;
60 u64 wait_time_max;
61
62 int discard; /* flag of blacklist */
63};
64
65/*
66 * States of lock_seq_stat
67 *
68 * UNINITIALIZED is required for detecting first event of acquire.
69 * As the nature of lock events, there is no guarantee
70 * that the first event for the locks are acquire,
71 * it can be acquired, contended or release.
72 */
73#define SEQ_STATE_UNINITIALIZED 0 /* initial state */
74#define SEQ_STATE_RELEASED 1
75#define SEQ_STATE_ACQUIRING 2
76#define SEQ_STATE_ACQUIRED 3
77#define SEQ_STATE_READ_ACQUIRED 4
78#define SEQ_STATE_CONTENDED 5
79
80/*
81 * MAX_LOCK_DEPTH
82 * Imported from include/linux/sched.h.
83 * Should this be synchronized?
84 */
85#define MAX_LOCK_DEPTH 48
86
87/*
88 * struct lock_seq_stat:
89 * Place to put on state of one lock sequence
90 * 1) acquire -> acquired -> release
91 * 2) acquire -> contended -> acquired -> release
92 * 3) acquire (with read or try) -> release
93 * 4) Are there other patterns?
94 */
95struct lock_seq_stat {
96 struct list_head list;
97 int state;
98 u64 prev_event_time;
99 void *addr;
100
101 int read_count;
102};
103
104struct thread_stat {
105 struct rb_node rb;
106
107 u32 tid;
108 struct list_head seq_list;
109};
110
111static struct rb_root thread_stats;
112
113static struct thread_stat *thread_stat_find(u32 tid)
114{
115 struct rb_node *node;
116 struct thread_stat *st;
117
118 node = thread_stats.rb_node;
119 while (node) {
120 st = container_of(node, struct thread_stat, rb);
121 if (st->tid == tid)
122 return st;
123 else if (tid < st->tid)
124 node = node->rb_left;
125 else
126 node = node->rb_right;
127 }
128
129 return NULL;
130}
131
132static void thread_stat_insert(struct thread_stat *new)
133{
134 struct rb_node **rb = &thread_stats.rb_node;
135 struct rb_node *parent = NULL;
136 struct thread_stat *p;
137
138 while (*rb) {
139 p = container_of(*rb, struct thread_stat, rb);
140 parent = *rb;
141
142 if (new->tid < p->tid)
143 rb = &(*rb)->rb_left;
144 else if (new->tid > p->tid)
145 rb = &(*rb)->rb_right;
146 else
147 BUG_ON("inserting invalid thread_stat\n");
148 }
149
150 rb_link_node(&new->rb, parent, rb);
151 rb_insert_color(&new->rb, &thread_stats);
152}
153
154static struct thread_stat *thread_stat_findnew_after_first(u32 tid)
155{
156 struct thread_stat *st;
157
158 st = thread_stat_find(tid);
159 if (st)
160 return st;
161
162 st = zalloc(sizeof(struct thread_stat));
163 if (!st)
164 die("memory allocation failed\n");
165
166 st->tid = tid;
167 INIT_LIST_HEAD(&st->seq_list);
168
169 thread_stat_insert(st);
170
171 return st;
172}
173
174static struct thread_stat *thread_stat_findnew_first(u32 tid);
175static struct thread_stat *(*thread_stat_findnew)(u32 tid) =
176 thread_stat_findnew_first;
177
178static struct thread_stat *thread_stat_findnew_first(u32 tid)
179{
180 struct thread_stat *st;
181
182 st = zalloc(sizeof(struct thread_stat));
183 if (!st)
184 die("memory allocation failed\n");
185 st->tid = tid;
186 INIT_LIST_HEAD(&st->seq_list);
187
188 rb_link_node(&st->rb, NULL, &thread_stats.rb_node);
189 rb_insert_color(&st->rb, &thread_stats);
190
191 thread_stat_findnew = thread_stat_findnew_after_first;
192 return st;
193}
194
195/* build simple key function one is bigger than two */
196#define SINGLE_KEY(member) \
197 static int lock_stat_key_ ## member(struct lock_stat *one, \
198 struct lock_stat *two) \
199 { \
200 return one->member > two->member; \
201 }
202
203SINGLE_KEY(nr_acquired)
204SINGLE_KEY(nr_contended)
205SINGLE_KEY(wait_time_total)
206SINGLE_KEY(wait_time_max)
207
208static int lock_stat_key_wait_time_min(struct lock_stat *one,
209 struct lock_stat *two)
210{
211 u64 s1 = one->wait_time_min;
212 u64 s2 = two->wait_time_min;
213 if (s1 == ULLONG_MAX)
214 s1 = 0;
215 if (s2 == ULLONG_MAX)
216 s2 = 0;
217 return s1 > s2;
218}
219
220struct lock_key {
221 /*
222 * name: the value for specify by user
223 * this should be simpler than raw name of member
224 * e.g. nr_acquired -> acquired, wait_time_total -> wait_total
225 */
226 const char *name;
227 int (*key)(struct lock_stat*, struct lock_stat*);
228};
229
230static const char *sort_key = "acquired";
231
232static int (*compare)(struct lock_stat *, struct lock_stat *);
233
234static struct rb_root result; /* place to store sorted data */
235
236#define DEF_KEY_LOCK(name, fn_suffix) \
237 { #name, lock_stat_key_ ## fn_suffix }
238struct lock_key keys[] = {
239 DEF_KEY_LOCK(acquired, nr_acquired),
240 DEF_KEY_LOCK(contended, nr_contended),
241 DEF_KEY_LOCK(wait_total, wait_time_total),
242 DEF_KEY_LOCK(wait_min, wait_time_min),
243 DEF_KEY_LOCK(wait_max, wait_time_max),
244
245 /* extra comparisons much complicated should be here */
246
247 { NULL, NULL }
248};
249
250static void select_key(void)
251{
252 int i;
253
254 for (i = 0; keys[i].name; i++) {
255 if (!strcmp(keys[i].name, sort_key)) {
256 compare = keys[i].key;
257 return;
258 }
259 }
260
261 die("Unknown compare key:%s\n", sort_key);
262}
263
264static void insert_to_result(struct lock_stat *st,
265 int (*bigger)(struct lock_stat *, struct lock_stat *))
266{
267 struct rb_node **rb = &result.rb_node;
268 struct rb_node *parent = NULL;
269 struct lock_stat *p;
270
271 while (*rb) {
272 p = container_of(*rb, struct lock_stat, rb);
273 parent = *rb;
274
275 if (bigger(st, p))
276 rb = &(*rb)->rb_left;
277 else
278 rb = &(*rb)->rb_right;
279 }
280
281 rb_link_node(&st->rb, parent, rb);
282 rb_insert_color(&st->rb, &result);
283}
284
285/* returns left most element of result, and erase it */
286static struct lock_stat *pop_from_result(void)
287{
288 struct rb_node *node = result.rb_node;
289
290 if (!node)
291 return NULL;
292
293 while (node->rb_left)
294 node = node->rb_left;
295
296 rb_erase(node, &result);
297 return container_of(node, struct lock_stat, rb);
298}
299
300static struct lock_stat *lock_stat_findnew(void *addr, const char *name)
301{
302 struct list_head *entry = lockhashentry(addr);
303 struct lock_stat *ret, *new;
304
305 list_for_each_entry(ret, entry, hash_entry) {
306 if (ret->addr == addr)
307 return ret;
308 }
309
310 new = zalloc(sizeof(struct lock_stat));
311 if (!new)
312 goto alloc_failed;
313
314 new->addr = addr;
315 new->name = zalloc(sizeof(char) * strlen(name) + 1);
316 if (!new->name)
317 goto alloc_failed;
318 strcpy(new->name, name);
319
320 new->wait_time_min = ULLONG_MAX;
321
322 list_add(&new->hash_entry, entry);
323 return new;
324
325alloc_failed:
326 die("memory allocation failed\n");
327}
328
329static const char *input_name;
330
331struct raw_event_sample {
332 u32 size;
333 char data[0];
334};
335
336struct trace_acquire_event {
337 void *addr;
338 const char *name;
339 int flag;
340};
341
342struct trace_acquired_event {
343 void *addr;
344 const char *name;
345};
346
347struct trace_contended_event {
348 void *addr;
349 const char *name;
350};
351
352struct trace_release_event {
353 void *addr;
354 const char *name;
355};
356
357struct trace_lock_handler {
358 void (*acquire_event)(struct trace_acquire_event *,
359 struct event_format *,
360 int cpu,
361 u64 timestamp,
362 struct thread *thread);
363
364 void (*acquired_event)(struct trace_acquired_event *,
365 struct event_format *,
366 int cpu,
367 u64 timestamp,
368 struct thread *thread);
369
370 void (*contended_event)(struct trace_contended_event *,
371 struct event_format *,
372 int cpu,
373 u64 timestamp,
374 struct thread *thread);
375
376 void (*release_event)(struct trace_release_event *,
377 struct event_format *,
378 int cpu,
379 u64 timestamp,
380 struct thread *thread);
381};
382
383static struct lock_seq_stat *get_seq(struct thread_stat *ts, void *addr)
384{
385 struct lock_seq_stat *seq;
386
387 list_for_each_entry(seq, &ts->seq_list, list) {
388 if (seq->addr == addr)
389 return seq;
390 }
391
392 seq = zalloc(sizeof(struct lock_seq_stat));
393 if (!seq)
394 die("Not enough memory\n");
395 seq->state = SEQ_STATE_UNINITIALIZED;
396 seq->addr = addr;
397
398 list_add(&seq->list, &ts->seq_list);
399 return seq;
400}
401
402enum broken_state {
403 BROKEN_ACQUIRE,
404 BROKEN_ACQUIRED,
405 BROKEN_CONTENDED,
406 BROKEN_RELEASE,
407 BROKEN_MAX,
408};
409
410static int bad_hist[BROKEN_MAX];
411
412enum acquire_flags {
413 TRY_LOCK = 1,
414 READ_LOCK = 2,
415};
416
417static void
418report_lock_acquire_event(struct trace_acquire_event *acquire_event,
419 struct event_format *__event __used,
420 int cpu __used,
421 u64 timestamp __used,
422 struct thread *thread __used)
423{
424 struct lock_stat *ls;
425 struct thread_stat *ts;
426 struct lock_seq_stat *seq;
427
428 ls = lock_stat_findnew(acquire_event->addr, acquire_event->name);
429 if (ls->discard)
430 return;
431
432 ts = thread_stat_findnew(thread->pid);
433 seq = get_seq(ts, acquire_event->addr);
434
435 switch (seq->state) {
436 case SEQ_STATE_UNINITIALIZED:
437 case SEQ_STATE_RELEASED:
438 if (!acquire_event->flag) {
439 seq->state = SEQ_STATE_ACQUIRING;
440 } else {
441 if (acquire_event->flag & TRY_LOCK)
442 ls->nr_trylock++;
443 if (acquire_event->flag & READ_LOCK)
444 ls->nr_readlock++;
445 seq->state = SEQ_STATE_READ_ACQUIRED;
446 seq->read_count = 1;
447 ls->nr_acquired++;
448 }
449 break;
450 case SEQ_STATE_READ_ACQUIRED:
451 if (acquire_event->flag & READ_LOCK) {
452 seq->read_count++;
453 ls->nr_acquired++;
454 goto end;
455 } else {
456 goto broken;
457 }
458 break;
459 case SEQ_STATE_ACQUIRED:
460 case SEQ_STATE_ACQUIRING:
461 case SEQ_STATE_CONTENDED:
462broken:
463 /* broken lock sequence, discard it */
464 ls->discard = 1;
465 bad_hist[BROKEN_ACQUIRE]++;
466 list_del(&seq->list);
467 free(seq);
468 goto end;
469 break;
470 default:
471 BUG_ON("Unknown state of lock sequence found!\n");
472 break;
473 }
474
475 ls->nr_acquire++;
476 seq->prev_event_time = timestamp;
477end:
478 return;
479}
480
481static void
482report_lock_acquired_event(struct trace_acquired_event *acquired_event,
483 struct event_format *__event __used,
484 int cpu __used,
485 u64 timestamp __used,
486 struct thread *thread __used)
487{
488 struct lock_stat *ls;
489 struct thread_stat *ts;
490 struct lock_seq_stat *seq;
491 u64 contended_term;
492
493 ls = lock_stat_findnew(acquired_event->addr, acquired_event->name);
494 if (ls->discard)
495 return;
496
497 ts = thread_stat_findnew(thread->pid);
498 seq = get_seq(ts, acquired_event->addr);
499
500 switch (seq->state) {
501 case SEQ_STATE_UNINITIALIZED:
502 /* orphan event, do nothing */
503 return;
504 case SEQ_STATE_ACQUIRING:
505 break;
506 case SEQ_STATE_CONTENDED:
507 contended_term = timestamp - seq->prev_event_time;
508 ls->wait_time_total += contended_term;
509 if (contended_term < ls->wait_time_min)
510 ls->wait_time_min = contended_term;
511 if (ls->wait_time_max < contended_term)
512 ls->wait_time_max = contended_term;
513 break;
514 case SEQ_STATE_RELEASED:
515 case SEQ_STATE_ACQUIRED:
516 case SEQ_STATE_READ_ACQUIRED:
517 /* broken lock sequence, discard it */
518 ls->discard = 1;
519 bad_hist[BROKEN_ACQUIRED]++;
520 list_del(&seq->list);
521 free(seq);
522 goto end;
523 break;
524
525 default:
526 BUG_ON("Unknown state of lock sequence found!\n");
527 break;
528 }
529
530 seq->state = SEQ_STATE_ACQUIRED;
531 ls->nr_acquired++;
532 seq->prev_event_time = timestamp;
533end:
534 return;
535}
536
537static void
538report_lock_contended_event(struct trace_contended_event *contended_event,
539 struct event_format *__event __used,
540 int cpu __used,
541 u64 timestamp __used,
542 struct thread *thread __used)
543{
544 struct lock_stat *ls;
545 struct thread_stat *ts;
546 struct lock_seq_stat *seq;
547
548 ls = lock_stat_findnew(contended_event->addr, contended_event->name);
549 if (ls->discard)
550 return;
551
552 ts = thread_stat_findnew(thread->pid);
553 seq = get_seq(ts, contended_event->addr);
554
555 switch (seq->state) {
556 case SEQ_STATE_UNINITIALIZED:
557 /* orphan event, do nothing */
558 return;
559 case SEQ_STATE_ACQUIRING:
560 break;
561 case SEQ_STATE_RELEASED:
562 case SEQ_STATE_ACQUIRED:
563 case SEQ_STATE_READ_ACQUIRED:
564 case SEQ_STATE_CONTENDED:
565 /* broken lock sequence, discard it */
566 ls->discard = 1;
567 bad_hist[BROKEN_CONTENDED]++;
568 list_del(&seq->list);
569 free(seq);
570 goto end;
571 break;
572 default:
573 BUG_ON("Unknown state of lock sequence found!\n");
574 break;
575 }
576
577 seq->state = SEQ_STATE_CONTENDED;
578 ls->nr_contended++;
579 seq->prev_event_time = timestamp;
580end:
581 return;
582}
583
584static void
585report_lock_release_event(struct trace_release_event *release_event,
586 struct event_format *__event __used,
587 int cpu __used,
588 u64 timestamp __used,
589 struct thread *thread __used)
590{
591 struct lock_stat *ls;
592 struct thread_stat *ts;
593 struct lock_seq_stat *seq;
594
595 ls = lock_stat_findnew(release_event->addr, release_event->name);
596 if (ls->discard)
597 return;
598
599 ts = thread_stat_findnew(thread->pid);
600 seq = get_seq(ts, release_event->addr);
601
602 switch (seq->state) {
603 case SEQ_STATE_UNINITIALIZED:
604 goto end;
605 break;
606 case SEQ_STATE_ACQUIRED:
607 break;
608 case SEQ_STATE_READ_ACQUIRED:
609 seq->read_count--;
610 BUG_ON(seq->read_count < 0);
611 if (!seq->read_count) {
612 ls->nr_release++;
613 goto end;
614 }
615 break;
616 case SEQ_STATE_ACQUIRING:
617 case SEQ_STATE_CONTENDED:
618 case SEQ_STATE_RELEASED:
619 /* broken lock sequence, discard it */
620 ls->discard = 1;
621 bad_hist[BROKEN_RELEASE]++;
622 goto free_seq;
623 break;
624 default:
625 BUG_ON("Unknown state of lock sequence found!\n");
626 break;
627 }
628
629 ls->nr_release++;
630free_seq:
631 list_del(&seq->list);
632 free(seq);
633end:
634 return;
635}
636
637/* lock oriented handlers */
638/* TODO: handlers for CPU oriented, thread oriented */
639static struct trace_lock_handler report_lock_ops = {
640 .acquire_event = report_lock_acquire_event,
641 .acquired_event = report_lock_acquired_event,
642 .contended_event = report_lock_contended_event,
643 .release_event = report_lock_release_event,
644};
645
646static struct trace_lock_handler *trace_handler;
647
648static void
649process_lock_acquire_event(void *data,
650 struct event_format *event __used,
651 int cpu __used,
652 u64 timestamp __used,
653 struct thread *thread __used)
654{
655 struct trace_acquire_event acquire_event;
656 u64 tmp; /* this is required for casting... */
657
658 tmp = raw_field_value(event, "lockdep_addr", data);
659 memcpy(&acquire_event.addr, &tmp, sizeof(void *));
660 acquire_event.name = (char *)raw_field_ptr(event, "name", data);
661 acquire_event.flag = (int)raw_field_value(event, "flag", data);
662
663 if (trace_handler->acquire_event)
664 trace_handler->acquire_event(&acquire_event, event, cpu, timestamp, thread);
665}
666
667static void
668process_lock_acquired_event(void *data,
669 struct event_format *event __used,
670 int cpu __used,
671 u64 timestamp __used,
672 struct thread *thread __used)
673{
674 struct trace_acquired_event acquired_event;
675 u64 tmp; /* this is required for casting... */
676
677 tmp = raw_field_value(event, "lockdep_addr", data);
678 memcpy(&acquired_event.addr, &tmp, sizeof(void *));
679 acquired_event.name = (char *)raw_field_ptr(event, "name", data);
680
681 if (trace_handler->acquire_event)
682 trace_handler->acquired_event(&acquired_event, event, cpu, timestamp, thread);
683}
684
685static void
686process_lock_contended_event(void *data,
687 struct event_format *event __used,
688 int cpu __used,
689 u64 timestamp __used,
690 struct thread *thread __used)
691{
692 struct trace_contended_event contended_event;
693 u64 tmp; /* this is required for casting... */
694
695 tmp = raw_field_value(event, "lockdep_addr", data);
696 memcpy(&contended_event.addr, &tmp, sizeof(void *));
697 contended_event.name = (char *)raw_field_ptr(event, "name", data);
698
699 if (trace_handler->acquire_event)
700 trace_handler->contended_event(&contended_event, event, cpu, timestamp, thread);
701}
702
703static void
704process_lock_release_event(void *data,
705 struct event_format *event __used,
706 int cpu __used,
707 u64 timestamp __used,
708 struct thread *thread __used)
709{
710 struct trace_release_event release_event;
711 u64 tmp; /* this is required for casting... */
712
713 tmp = raw_field_value(event, "lockdep_addr", data);
714 memcpy(&release_event.addr, &tmp, sizeof(void *));
715 release_event.name = (char *)raw_field_ptr(event, "name", data);
716
717 if (trace_handler->acquire_event)
718 trace_handler->release_event(&release_event, event, cpu, timestamp, thread);
719}
720
721static void
722process_raw_event(void *data, int cpu, u64 timestamp, struct thread *thread)
723{
724 struct event_format *event;
725 int type;
726
727 type = trace_parse_common_type(data);
728 event = trace_find_event(type);
729
730 if (!strcmp(event->name, "lock_acquire"))
731 process_lock_acquire_event(data, event, cpu, timestamp, thread);
732 if (!strcmp(event->name, "lock_acquired"))
733 process_lock_acquired_event(data, event, cpu, timestamp, thread);
734 if (!strcmp(event->name, "lock_contended"))
735 process_lock_contended_event(data, event, cpu, timestamp, thread);
736 if (!strcmp(event->name, "lock_release"))
737 process_lock_release_event(data, event, cpu, timestamp, thread);
738}
739
740static void print_bad_events(int bad, int total)
741{
742 /* Output for debug, this have to be removed */
743 int i;
744 const char *name[4] =
745 { "acquire", "acquired", "contended", "release" };
746
747 pr_info("\n=== output for debug===\n\n");
748 pr_info("bad: %d, total: %d\n", bad, total);
749 pr_info("bad rate: %f %%\n", (double)bad / (double)total * 100);
750 pr_info("histogram of events caused bad sequence\n");
751 for (i = 0; i < BROKEN_MAX; i++)
752 pr_info(" %10s: %d\n", name[i], bad_hist[i]);
753}
754
755/* TODO: various way to print, coloring, nano or milli sec */
756static void print_result(void)
757{
758 struct lock_stat *st;
759 char cut_name[20];
760 int bad, total;
761
762 pr_info("%20s ", "Name");
763 pr_info("%10s ", "acquired");
764 pr_info("%10s ", "contended");
765
766 pr_info("%15s ", "total wait (ns)");
767 pr_info("%15s ", "max wait (ns)");
768 pr_info("%15s ", "min wait (ns)");
769
770 pr_info("\n\n");
771
772 bad = total = 0;
773 while ((st = pop_from_result())) {
774 total++;
775 if (st->discard) {
776 bad++;
777 continue;
778 }
779 bzero(cut_name, 20);
780
781 if (strlen(st->name) < 16) {
782 /* output raw name */
783 pr_info("%20s ", st->name);
784 } else {
785 strncpy(cut_name, st->name, 16);
786 cut_name[16] = '.';
787 cut_name[17] = '.';
788 cut_name[18] = '.';
789 cut_name[19] = '\0';
790 /* cut off name for saving output style */
791 pr_info("%20s ", cut_name);
792 }
793
794 pr_info("%10u ", st->nr_acquired);
795 pr_info("%10u ", st->nr_contended);
796
797 pr_info("%15" PRIu64 " ", st->wait_time_total);
798 pr_info("%15" PRIu64 " ", st->wait_time_max);
799 pr_info("%15" PRIu64 " ", st->wait_time_min == ULLONG_MAX ?
800 0 : st->wait_time_min);
801 pr_info("\n");
802 }
803
804 print_bad_events(bad, total);
805}
806
807static bool info_threads, info_map;
808
809static void dump_threads(void)
810{
811 struct thread_stat *st;
812 struct rb_node *node;
813 struct thread *t;
814
815 pr_info("%10s: comm\n", "Thread ID");
816
817 node = rb_first(&thread_stats);
818 while (node) {
819 st = container_of(node, struct thread_stat, rb);
820 t = perf_session__findnew(session, st->tid);
821 pr_info("%10d: %s\n", st->tid, t->comm);
822 node = rb_next(node);
823 };
824}
825
826static void dump_map(void)
827{
828 unsigned int i;
829 struct lock_stat *st;
830
831 pr_info("Address of instance: name of class\n");
832 for (i = 0; i < LOCKHASH_SIZE; i++) {
833 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
834 pr_info(" %p: %s\n", st->addr, st->name);
835 }
836 }
837}
838
839static void dump_info(void)
840{
841 if (info_threads)
842 dump_threads();
843 else if (info_map)
844 dump_map();
845 else
846 die("Unknown type of information\n");
847}
848
849static int process_sample_event(struct perf_tool *tool __used,
850 union perf_event *event,
851 struct perf_sample *sample,
852 struct perf_evsel *evsel __used,
853 struct machine *machine)
854{
855 struct thread *thread = machine__findnew_thread(machine, sample->tid);
856
857 if (thread == NULL) {
858 pr_debug("problem processing %d event, skipping it.\n",
859 event->header.type);
860 return -1;
861 }
862
863 process_raw_event(sample->raw_data, sample->cpu, sample->time, thread);
864
865 return 0;
866}
867
868static struct perf_tool eops = {
869 .sample = process_sample_event,
870 .comm = perf_event__process_comm,
871 .ordered_samples = true,
872};
873
874static int read_events(void)
875{
876 session = perf_session__new(input_name, O_RDONLY, 0, false, &eops);
877 if (!session)
878 die("Initializing perf session failed\n");
879
880 return perf_session__process_events(session, &eops);
881}
882
883static void sort_result(void)
884{
885 unsigned int i;
886 struct lock_stat *st;
887
888 for (i = 0; i < LOCKHASH_SIZE; i++) {
889 list_for_each_entry(st, &lockhash_table[i], hash_entry) {
890 insert_to_result(st, compare);
891 }
892 }
893}
894
895static void __cmd_report(void)
896{
897 setup_pager();
898 select_key();
899 read_events();
900 sort_result();
901 print_result();
902}
903
904static const char * const report_usage[] = {
905 "perf lock report [<options>]",
906 NULL
907};
908
909static const struct option report_options[] = {
910 OPT_STRING('k', "key", &sort_key, "acquired",
911 "key for sorting (acquired / contended / wait_total / wait_max / wait_min)"),
912 /* TODO: type */
913 OPT_END()
914};
915
916static const char * const info_usage[] = {
917 "perf lock info [<options>]",
918 NULL
919};
920
921static const struct option info_options[] = {
922 OPT_BOOLEAN('t', "threads", &info_threads,
923 "dump thread list in perf.data"),
924 OPT_BOOLEAN('m', "map", &info_map,
925 "map of lock instances (address:name table)"),
926 OPT_END()
927};
928
929static const char * const lock_usage[] = {
930 "perf lock [<options>] {record|report|script|info}",
931 NULL
932};
933
934static const struct option lock_options[] = {
935 OPT_STRING('i', "input", &input_name, "file", "input file name"),
936 OPT_INCR('v', "verbose", &verbose, "be more verbose (show symbol address, etc)"),
937 OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, "dump raw trace in ASCII"),
938 OPT_END()
939};
940
941static const char *record_args[] = {
942 "record",
943 "-R",
944 "-f",
945 "-m", "1024",
946 "-c", "1",
947 "-e", "lock:lock_acquire",
948 "-e", "lock:lock_acquired",
949 "-e", "lock:lock_contended",
950 "-e", "lock:lock_release",
951};
952
953static int __cmd_record(int argc, const char **argv)
954{
955 unsigned int rec_argc, i, j;
956 const char **rec_argv;
957
958 rec_argc = ARRAY_SIZE(record_args) + argc - 1;
959 rec_argv = calloc(rec_argc + 1, sizeof(char *));
960
961 if (rec_argv == NULL)
962 return -ENOMEM;
963
964 for (i = 0; i < ARRAY_SIZE(record_args); i++)
965 rec_argv[i] = strdup(record_args[i]);
966
967 for (j = 1; j < (unsigned int)argc; j++, i++)
968 rec_argv[i] = argv[j];
969
970 BUG_ON(i != rec_argc);
971
972 return cmd_record(i, rec_argv, NULL);
973}
974
975int cmd_lock(int argc, const char **argv, const char *prefix __used)
976{
977 unsigned int i;
978
979 symbol__init();
980 for (i = 0; i < LOCKHASH_SIZE; i++)
981 INIT_LIST_HEAD(lockhash_table + i);
982
983 argc = parse_options(argc, argv, lock_options, lock_usage,
984 PARSE_OPT_STOP_AT_NON_OPTION);
985 if (!argc)
986 usage_with_options(lock_usage, lock_options);
987
988 if (!strncmp(argv[0], "rec", 3)) {
989 return __cmd_record(argc, argv);
990 } else if (!strncmp(argv[0], "report", 6)) {
991 trace_handler = &report_lock_ops;
992 if (argc) {
993 argc = parse_options(argc, argv,
994 report_options, report_usage, 0);
995 if (argc)
996 usage_with_options(report_usage, report_options);
997 }
998 __cmd_report();
999 } else if (!strcmp(argv[0], "script")) {
1000 /* Aliased to 'perf script' */
1001 return cmd_script(argc, argv, prefix);
1002 } else if (!strcmp(argv[0], "info")) {
1003 if (argc) {
1004 argc = parse_options(argc, argv,
1005 info_options, info_usage, 0);
1006 if (argc)
1007 usage_with_options(info_usage, info_options);
1008 }
1009 /* recycling report_lock_ops */
1010 trace_handler = &report_lock_ops;
1011 setup_pager();
1012 read_events();
1013 dump_info();
1014 } else {
1015 usage_with_options(lock_usage, lock_options);
1016 }
1017
1018 return 0;
1019}