builtin-lock.c 23 KB

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