builtin-lock.c 22 KB

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