builtin-lock.c 22 KB

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