builtin-lock.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997
  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. struct trace_lock_handler {
  270. int (*acquire_event)(struct perf_evsel *evsel,
  271. struct perf_sample *sample);
  272. int (*acquired_event)(struct perf_evsel *evsel,
  273. struct perf_sample *sample);
  274. int (*contended_event)(struct perf_evsel *evsel,
  275. struct perf_sample *sample);
  276. int (*release_event)(struct perf_evsel *evsel,
  277. struct perf_sample *sample);
  278. };
  279. static struct lock_seq_stat *get_seq(struct thread_stat *ts, void *addr)
  280. {
  281. struct lock_seq_stat *seq;
  282. list_for_each_entry(seq, &ts->seq_list, list) {
  283. if (seq->addr == addr)
  284. return seq;
  285. }
  286. seq = zalloc(sizeof(struct lock_seq_stat));
  287. if (!seq) {
  288. pr_err("memory allocation failed\n");
  289. return NULL;
  290. }
  291. seq->state = SEQ_STATE_UNINITIALIZED;
  292. seq->addr = addr;
  293. list_add(&seq->list, &ts->seq_list);
  294. return seq;
  295. }
  296. enum broken_state {
  297. BROKEN_ACQUIRE,
  298. BROKEN_ACQUIRED,
  299. BROKEN_CONTENDED,
  300. BROKEN_RELEASE,
  301. BROKEN_MAX,
  302. };
  303. static int bad_hist[BROKEN_MAX];
  304. enum acquire_flags {
  305. TRY_LOCK = 1,
  306. READ_LOCK = 2,
  307. };
  308. static int report_lock_acquire_event(struct perf_evsel *evsel,
  309. struct perf_sample *sample)
  310. {
  311. void *addr;
  312. struct lock_stat *ls;
  313. struct thread_stat *ts;
  314. struct lock_seq_stat *seq;
  315. const char *name = perf_evsel__strval(evsel, sample, "name");
  316. u64 tmp = perf_evsel__intval(evsel, sample, "lockdep_addr");
  317. int flag = perf_evsel__intval(evsel, sample, "flag");
  318. memcpy(&addr, &tmp, sizeof(void *));
  319. ls = lock_stat_findnew(addr, name);
  320. if (!ls)
  321. return -1;
  322. if (ls->discard)
  323. return 0;
  324. ts = thread_stat_findnew(sample->tid);
  325. if (!ts)
  326. return -1;
  327. seq = get_seq(ts, addr);
  328. if (!seq)
  329. return -1;
  330. switch (seq->state) {
  331. case SEQ_STATE_UNINITIALIZED:
  332. case SEQ_STATE_RELEASED:
  333. if (!flag) {
  334. seq->state = SEQ_STATE_ACQUIRING;
  335. } else {
  336. if (flag & TRY_LOCK)
  337. ls->nr_trylock++;
  338. if (flag & READ_LOCK)
  339. ls->nr_readlock++;
  340. seq->state = SEQ_STATE_READ_ACQUIRED;
  341. seq->read_count = 1;
  342. ls->nr_acquired++;
  343. }
  344. break;
  345. case SEQ_STATE_READ_ACQUIRED:
  346. if (flag & READ_LOCK) {
  347. seq->read_count++;
  348. ls->nr_acquired++;
  349. goto end;
  350. } else {
  351. goto broken;
  352. }
  353. break;
  354. case SEQ_STATE_ACQUIRED:
  355. case SEQ_STATE_ACQUIRING:
  356. case SEQ_STATE_CONTENDED:
  357. broken:
  358. /* broken lock sequence, discard it */
  359. ls->discard = 1;
  360. bad_hist[BROKEN_ACQUIRE]++;
  361. list_del(&seq->list);
  362. free(seq);
  363. goto end;
  364. break;
  365. default:
  366. BUG_ON("Unknown state of lock sequence found!\n");
  367. break;
  368. }
  369. ls->nr_acquire++;
  370. seq->prev_event_time = sample->time;
  371. end:
  372. return 0;
  373. }
  374. static int report_lock_acquired_event(struct perf_evsel *evsel,
  375. struct perf_sample *sample)
  376. {
  377. void *addr;
  378. struct lock_stat *ls;
  379. struct thread_stat *ts;
  380. struct lock_seq_stat *seq;
  381. u64 contended_term;
  382. const char *name = perf_evsel__strval(evsel, sample, "name");
  383. u64 tmp = perf_evsel__intval(evsel, sample, "lockdep_addr");
  384. memcpy(&addr, &tmp, sizeof(void *));
  385. ls = lock_stat_findnew(addr, name);
  386. if (!ls)
  387. return -1;
  388. if (ls->discard)
  389. return 0;
  390. ts = thread_stat_findnew(sample->tid);
  391. if (!ts)
  392. return -1;
  393. seq = get_seq(ts, addr);
  394. if (!seq)
  395. return -1;
  396. switch (seq->state) {
  397. case SEQ_STATE_UNINITIALIZED:
  398. /* orphan event, do nothing */
  399. return 0;
  400. case SEQ_STATE_ACQUIRING:
  401. break;
  402. case SEQ_STATE_CONTENDED:
  403. contended_term = sample->time - seq->prev_event_time;
  404. ls->wait_time_total += contended_term;
  405. if (contended_term < ls->wait_time_min)
  406. ls->wait_time_min = contended_term;
  407. if (ls->wait_time_max < contended_term)
  408. ls->wait_time_max = contended_term;
  409. break;
  410. case SEQ_STATE_RELEASED:
  411. case SEQ_STATE_ACQUIRED:
  412. case SEQ_STATE_READ_ACQUIRED:
  413. /* broken lock sequence, discard it */
  414. ls->discard = 1;
  415. bad_hist[BROKEN_ACQUIRED]++;
  416. list_del(&seq->list);
  417. free(seq);
  418. goto end;
  419. break;
  420. default:
  421. BUG_ON("Unknown state of lock sequence found!\n");
  422. break;
  423. }
  424. seq->state = SEQ_STATE_ACQUIRED;
  425. ls->nr_acquired++;
  426. seq->prev_event_time = sample->time;
  427. end:
  428. return 0;
  429. }
  430. static int report_lock_contended_event(struct perf_evsel *evsel,
  431. struct perf_sample *sample)
  432. {
  433. void *addr;
  434. struct lock_stat *ls;
  435. struct thread_stat *ts;
  436. struct lock_seq_stat *seq;
  437. const char *name = perf_evsel__strval(evsel, sample, "name");
  438. u64 tmp = perf_evsel__intval(evsel, sample, "lockdep_addr");
  439. memcpy(&addr, &tmp, sizeof(void *));
  440. ls = lock_stat_findnew(addr, name);
  441. if (!ls)
  442. return -1;
  443. if (ls->discard)
  444. return 0;
  445. ts = thread_stat_findnew(sample->tid);
  446. if (!ts)
  447. return -1;
  448. seq = get_seq(ts, addr);
  449. if (!seq)
  450. return -1;
  451. switch (seq->state) {
  452. case SEQ_STATE_UNINITIALIZED:
  453. /* orphan event, do nothing */
  454. return 0;
  455. case SEQ_STATE_ACQUIRING:
  456. break;
  457. case SEQ_STATE_RELEASED:
  458. case SEQ_STATE_ACQUIRED:
  459. case SEQ_STATE_READ_ACQUIRED:
  460. case SEQ_STATE_CONTENDED:
  461. /* broken lock sequence, discard it */
  462. ls->discard = 1;
  463. bad_hist[BROKEN_CONTENDED]++;
  464. list_del(&seq->list);
  465. free(seq);
  466. goto end;
  467. break;
  468. default:
  469. BUG_ON("Unknown state of lock sequence found!\n");
  470. break;
  471. }
  472. seq->state = SEQ_STATE_CONTENDED;
  473. ls->nr_contended++;
  474. seq->prev_event_time = sample->time;
  475. end:
  476. return 0;
  477. }
  478. static int report_lock_release_event(struct perf_evsel *evsel,
  479. struct perf_sample *sample)
  480. {
  481. void *addr;
  482. struct lock_stat *ls;
  483. struct thread_stat *ts;
  484. struct lock_seq_stat *seq;
  485. const char *name = perf_evsel__strval(evsel, sample, "name");
  486. u64 tmp = perf_evsel__intval(evsel, sample, "lockdep_addr");
  487. memcpy(&addr, &tmp, sizeof(void *));
  488. ls = lock_stat_findnew(addr, name);
  489. if (!ls)
  490. return -1;
  491. if (ls->discard)
  492. return 0;
  493. ts = thread_stat_findnew(sample->tid);
  494. if (!ts)
  495. return -1;
  496. seq = get_seq(ts, addr);
  497. if (!seq)
  498. return -1;
  499. switch (seq->state) {
  500. case SEQ_STATE_UNINITIALIZED:
  501. goto end;
  502. break;
  503. case SEQ_STATE_ACQUIRED:
  504. break;
  505. case SEQ_STATE_READ_ACQUIRED:
  506. seq->read_count--;
  507. BUG_ON(seq->read_count < 0);
  508. if (!seq->read_count) {
  509. ls->nr_release++;
  510. goto end;
  511. }
  512. break;
  513. case SEQ_STATE_ACQUIRING:
  514. case SEQ_STATE_CONTENDED:
  515. case SEQ_STATE_RELEASED:
  516. /* broken lock sequence, discard it */
  517. ls->discard = 1;
  518. bad_hist[BROKEN_RELEASE]++;
  519. goto free_seq;
  520. break;
  521. default:
  522. BUG_ON("Unknown state of lock sequence found!\n");
  523. break;
  524. }
  525. ls->nr_release++;
  526. free_seq:
  527. list_del(&seq->list);
  528. free(seq);
  529. end:
  530. return 0;
  531. }
  532. /* lock oriented handlers */
  533. /* TODO: handlers for CPU oriented, thread oriented */
  534. static struct trace_lock_handler report_lock_ops = {
  535. .acquire_event = report_lock_acquire_event,
  536. .acquired_event = report_lock_acquired_event,
  537. .contended_event = report_lock_contended_event,
  538. .release_event = report_lock_release_event,
  539. };
  540. static struct trace_lock_handler *trace_handler;
  541. static int perf_evsel__process_lock_acquire(struct perf_evsel *evsel,
  542. struct perf_sample *sample)
  543. {
  544. if (trace_handler->acquire_event)
  545. return trace_handler->acquire_event(evsel, sample);
  546. return 0;
  547. }
  548. static int perf_evsel__process_lock_acquired(struct perf_evsel *evsel,
  549. struct perf_sample *sample)
  550. {
  551. if (trace_handler->acquired_event)
  552. return trace_handler->acquired_event(evsel, sample);
  553. return 0;
  554. }
  555. static int perf_evsel__process_lock_contended(struct perf_evsel *evsel,
  556. struct perf_sample *sample)
  557. {
  558. if (trace_handler->contended_event)
  559. return trace_handler->contended_event(evsel, sample);
  560. return 0;
  561. }
  562. static int perf_evsel__process_lock_release(struct perf_evsel *evsel,
  563. struct perf_sample *sample)
  564. {
  565. if (trace_handler->release_event)
  566. return trace_handler->release_event(evsel, sample);
  567. return 0;
  568. }
  569. static void print_bad_events(int bad, int total)
  570. {
  571. /* Output for debug, this have to be removed */
  572. int i;
  573. const char *name[4] =
  574. { "acquire", "acquired", "contended", "release" };
  575. pr_info("\n=== output for debug===\n\n");
  576. pr_info("bad: %d, total: %d\n", bad, total);
  577. pr_info("bad rate: %f %%\n", (double)bad / (double)total * 100);
  578. pr_info("histogram of events caused bad sequence\n");
  579. for (i = 0; i < BROKEN_MAX; i++)
  580. pr_info(" %10s: %d\n", name[i], bad_hist[i]);
  581. }
  582. /* TODO: various way to print, coloring, nano or milli sec */
  583. static void print_result(void)
  584. {
  585. struct lock_stat *st;
  586. char cut_name[20];
  587. int bad, total;
  588. pr_info("%20s ", "Name");
  589. pr_info("%10s ", "acquired");
  590. pr_info("%10s ", "contended");
  591. pr_info("%15s ", "total wait (ns)");
  592. pr_info("%15s ", "max wait (ns)");
  593. pr_info("%15s ", "min wait (ns)");
  594. pr_info("\n\n");
  595. bad = total = 0;
  596. while ((st = pop_from_result())) {
  597. total++;
  598. if (st->discard) {
  599. bad++;
  600. continue;
  601. }
  602. bzero(cut_name, 20);
  603. if (strlen(st->name) < 16) {
  604. /* output raw name */
  605. pr_info("%20s ", st->name);
  606. } else {
  607. strncpy(cut_name, st->name, 16);
  608. cut_name[16] = '.';
  609. cut_name[17] = '.';
  610. cut_name[18] = '.';
  611. cut_name[19] = '\0';
  612. /* cut off name for saving output style */
  613. pr_info("%20s ", cut_name);
  614. }
  615. pr_info("%10u ", st->nr_acquired);
  616. pr_info("%10u ", st->nr_contended);
  617. pr_info("%15" PRIu64 " ", st->wait_time_total);
  618. pr_info("%15" PRIu64 " ", st->wait_time_max);
  619. pr_info("%15" PRIu64 " ", st->wait_time_min == ULLONG_MAX ?
  620. 0 : st->wait_time_min);
  621. pr_info("\n");
  622. }
  623. print_bad_events(bad, total);
  624. }
  625. static bool info_threads, info_map;
  626. static void dump_threads(void)
  627. {
  628. struct thread_stat *st;
  629. struct rb_node *node;
  630. struct thread *t;
  631. pr_info("%10s: comm\n", "Thread ID");
  632. node = rb_first(&thread_stats);
  633. while (node) {
  634. st = container_of(node, struct thread_stat, rb);
  635. t = perf_session__findnew(session, st->tid);
  636. pr_info("%10d: %s\n", st->tid, t->comm);
  637. node = rb_next(node);
  638. };
  639. }
  640. static void dump_map(void)
  641. {
  642. unsigned int i;
  643. struct lock_stat *st;
  644. pr_info("Address of instance: name of class\n");
  645. for (i = 0; i < LOCKHASH_SIZE; i++) {
  646. list_for_each_entry(st, &lockhash_table[i], hash_entry) {
  647. pr_info(" %p: %s\n", st->addr, st->name);
  648. }
  649. }
  650. }
  651. static int dump_info(void)
  652. {
  653. int rc = 0;
  654. if (info_threads)
  655. dump_threads();
  656. else if (info_map)
  657. dump_map();
  658. else {
  659. rc = -1;
  660. pr_err("Unknown type of information\n");
  661. }
  662. return rc;
  663. }
  664. typedef int (*tracepoint_handler)(struct perf_evsel *evsel,
  665. struct perf_sample *sample);
  666. static int process_sample_event(struct perf_tool *tool __maybe_unused,
  667. union perf_event *event,
  668. struct perf_sample *sample,
  669. struct perf_evsel *evsel,
  670. struct machine *machine)
  671. {
  672. struct thread *thread = machine__findnew_thread(machine, sample->tid);
  673. if (thread == NULL) {
  674. pr_debug("problem processing %d event, skipping it.\n",
  675. event->header.type);
  676. return -1;
  677. }
  678. if (evsel->handler.func != NULL) {
  679. tracepoint_handler f = evsel->handler.func;
  680. return f(evsel, sample);
  681. }
  682. return 0;
  683. }
  684. static const struct perf_evsel_str_handler lock_tracepoints[] = {
  685. { "lock:lock_acquire", perf_evsel__process_lock_acquire, }, /* CONFIG_LOCKDEP */
  686. { "lock:lock_acquired", perf_evsel__process_lock_acquired, }, /* CONFIG_LOCKDEP, CONFIG_LOCK_STAT */
  687. { "lock:lock_contended", perf_evsel__process_lock_contended, }, /* CONFIG_LOCKDEP, CONFIG_LOCK_STAT */
  688. { "lock:lock_release", perf_evsel__process_lock_release, }, /* CONFIG_LOCKDEP */
  689. };
  690. static int read_events(void)
  691. {
  692. struct perf_tool eops = {
  693. .sample = process_sample_event,
  694. .comm = perf_event__process_comm,
  695. .ordered_samples = true,
  696. };
  697. session = perf_session__new(input_name, O_RDONLY, 0, false, &eops);
  698. if (!session) {
  699. pr_err("Initializing perf session failed\n");
  700. return -1;
  701. }
  702. if (perf_session__set_tracepoints_handlers(session, lock_tracepoints)) {
  703. pr_err("Initializing perf session tracepoint handlers failed\n");
  704. return -1;
  705. }
  706. return perf_session__process_events(session, &eops);
  707. }
  708. static void sort_result(void)
  709. {
  710. unsigned int i;
  711. struct lock_stat *st;
  712. for (i = 0; i < LOCKHASH_SIZE; i++) {
  713. list_for_each_entry(st, &lockhash_table[i], hash_entry) {
  714. insert_to_result(st, compare);
  715. }
  716. }
  717. }
  718. static int __cmd_report(void)
  719. {
  720. setup_pager();
  721. if ((select_key() != 0) ||
  722. (read_events() != 0))
  723. return -1;
  724. sort_result();
  725. print_result();
  726. return 0;
  727. }
  728. static int __cmd_record(int argc, const char **argv)
  729. {
  730. const char *record_args[] = {
  731. "record", "-R", "-f", "-m", "1024", "-c", "1",
  732. };
  733. unsigned int rec_argc, i, j;
  734. const char **rec_argv;
  735. for (i = 0; i < ARRAY_SIZE(lock_tracepoints); i++) {
  736. if (!is_valid_tracepoint(lock_tracepoints[i].name)) {
  737. pr_err("tracepoint %s is not enabled. "
  738. "Are CONFIG_LOCKDEP and CONFIG_LOCK_STAT enabled?\n",
  739. lock_tracepoints[i].name);
  740. return 1;
  741. }
  742. }
  743. rec_argc = ARRAY_SIZE(record_args) + argc - 1;
  744. /* factor of 2 is for -e in front of each tracepoint */
  745. rec_argc += 2 * ARRAY_SIZE(lock_tracepoints);
  746. rec_argv = calloc(rec_argc + 1, sizeof(char *));
  747. if (rec_argv == NULL)
  748. return -ENOMEM;
  749. for (i = 0; i < ARRAY_SIZE(record_args); i++)
  750. rec_argv[i] = strdup(record_args[i]);
  751. for (j = 0; j < ARRAY_SIZE(lock_tracepoints); j++) {
  752. rec_argv[i++] = "-e";
  753. rec_argv[i++] = strdup(lock_tracepoints[j].name);
  754. }
  755. for (j = 1; j < (unsigned int)argc; j++, i++)
  756. rec_argv[i] = argv[j];
  757. BUG_ON(i != rec_argc);
  758. return cmd_record(i, rec_argv, NULL);
  759. }
  760. int cmd_lock(int argc, const char **argv, const char *prefix __maybe_unused)
  761. {
  762. const struct option info_options[] = {
  763. OPT_BOOLEAN('t', "threads", &info_threads,
  764. "dump thread list in perf.data"),
  765. OPT_BOOLEAN('m', "map", &info_map,
  766. "map of lock instances (address:name table)"),
  767. OPT_END()
  768. };
  769. const struct option lock_options[] = {
  770. OPT_STRING('i', "input", &input_name, "file", "input file name"),
  771. OPT_INCR('v', "verbose", &verbose, "be more verbose (show symbol address, etc)"),
  772. OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, "dump raw trace in ASCII"),
  773. OPT_END()
  774. };
  775. const struct option report_options[] = {
  776. OPT_STRING('k', "key", &sort_key, "acquired",
  777. "key for sorting (acquired / contended / wait_total / wait_max / wait_min)"),
  778. /* TODO: type */
  779. OPT_END()
  780. };
  781. const char * const info_usage[] = {
  782. "perf lock info [<options>]",
  783. NULL
  784. };
  785. const char * const lock_usage[] = {
  786. "perf lock [<options>] {record|report|script|info}",
  787. NULL
  788. };
  789. const char * const report_usage[] = {
  790. "perf lock report [<options>]",
  791. NULL
  792. };
  793. unsigned int i;
  794. int rc = 0;
  795. symbol__init();
  796. for (i = 0; i < LOCKHASH_SIZE; i++)
  797. INIT_LIST_HEAD(lockhash_table + i);
  798. argc = parse_options(argc, argv, lock_options, lock_usage,
  799. PARSE_OPT_STOP_AT_NON_OPTION);
  800. if (!argc)
  801. usage_with_options(lock_usage, lock_options);
  802. if (!strncmp(argv[0], "rec", 3)) {
  803. return __cmd_record(argc, argv);
  804. } else if (!strncmp(argv[0], "report", 6)) {
  805. trace_handler = &report_lock_ops;
  806. if (argc) {
  807. argc = parse_options(argc, argv,
  808. report_options, report_usage, 0);
  809. if (argc)
  810. usage_with_options(report_usage, report_options);
  811. }
  812. __cmd_report();
  813. } else if (!strcmp(argv[0], "script")) {
  814. /* Aliased to 'perf script' */
  815. return cmd_script(argc, argv, prefix);
  816. } else if (!strcmp(argv[0], "info")) {
  817. if (argc) {
  818. argc = parse_options(argc, argv,
  819. info_options, info_usage, 0);
  820. if (argc)
  821. usage_with_options(info_usage, info_options);
  822. }
  823. /* recycling report_lock_ops */
  824. trace_handler = &report_lock_ops;
  825. setup_pager();
  826. if (read_events() != 0)
  827. rc = -1;
  828. else
  829. rc = dump_info();
  830. } else {
  831. usage_with_options(lock_usage, lock_options);
  832. }
  833. return rc;
  834. }