builtin-diff.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669
  1. /*
  2. * builtin-diff.c
  3. *
  4. * Builtin diff command: Analyze two perf.data input files, look up and read
  5. * DSOs and symbol information, sort them and produce a diff.
  6. */
  7. #include "builtin.h"
  8. #include "util/debug.h"
  9. #include "util/event.h"
  10. #include "util/hist.h"
  11. #include "util/evsel.h"
  12. #include "util/evlist.h"
  13. #include "util/session.h"
  14. #include "util/tool.h"
  15. #include "util/sort.h"
  16. #include "util/symbol.h"
  17. #include "util/util.h"
  18. #include <stdlib.h>
  19. static char const *input_old = "perf.data.old",
  20. *input_new = "perf.data";
  21. static char diff__default_sort_order[] = "dso,symbol";
  22. static bool force;
  23. static bool show_displacement;
  24. static bool show_period;
  25. static bool show_formula;
  26. static bool show_baseline_only;
  27. static bool sort_compute;
  28. static s64 compute_wdiff_w1;
  29. static s64 compute_wdiff_w2;
  30. enum {
  31. COMPUTE_DELTA,
  32. COMPUTE_RATIO,
  33. COMPUTE_WEIGHTED_DIFF,
  34. COMPUTE_MAX,
  35. };
  36. const char *compute_names[COMPUTE_MAX] = {
  37. [COMPUTE_DELTA] = "delta",
  38. [COMPUTE_RATIO] = "ratio",
  39. [COMPUTE_WEIGHTED_DIFF] = "wdiff",
  40. };
  41. static int compute;
  42. static int setup_compute_opt_wdiff(char *opt)
  43. {
  44. char *w1_str = opt;
  45. char *w2_str;
  46. int ret = -EINVAL;
  47. if (!opt)
  48. goto out;
  49. w2_str = strchr(opt, ',');
  50. if (!w2_str)
  51. goto out;
  52. *w2_str++ = 0x0;
  53. if (!*w2_str)
  54. goto out;
  55. compute_wdiff_w1 = strtol(w1_str, NULL, 10);
  56. compute_wdiff_w2 = strtol(w2_str, NULL, 10);
  57. if (!compute_wdiff_w1 || !compute_wdiff_w2)
  58. goto out;
  59. pr_debug("compute wdiff w1(%" PRId64 ") w2(%" PRId64 ")\n",
  60. compute_wdiff_w1, compute_wdiff_w2);
  61. ret = 0;
  62. out:
  63. if (ret)
  64. pr_err("Failed: wrong weight data, use 'wdiff:w1,w2'\n");
  65. return ret;
  66. }
  67. static int setup_compute_opt(char *opt)
  68. {
  69. if (compute == COMPUTE_WEIGHTED_DIFF)
  70. return setup_compute_opt_wdiff(opt);
  71. if (opt) {
  72. pr_err("Failed: extra option specified '%s'", opt);
  73. return -EINVAL;
  74. }
  75. return 0;
  76. }
  77. static int setup_compute(const struct option *opt, const char *str,
  78. int unset __maybe_unused)
  79. {
  80. int *cp = (int *) opt->value;
  81. char *cstr = (char *) str;
  82. char buf[50];
  83. unsigned i;
  84. char *option;
  85. if (!str) {
  86. *cp = COMPUTE_DELTA;
  87. return 0;
  88. }
  89. if (*str == '+') {
  90. sort_compute = true;
  91. cstr = (char *) ++str;
  92. if (!*str)
  93. return 0;
  94. }
  95. option = strchr(str, ':');
  96. if (option) {
  97. unsigned len = option++ - str;
  98. /*
  99. * The str data are not writeable, so we need
  100. * to use another buffer.
  101. */
  102. /* No option value is longer. */
  103. if (len >= sizeof(buf))
  104. return -EINVAL;
  105. strncpy(buf, str, len);
  106. buf[len] = 0x0;
  107. cstr = buf;
  108. }
  109. for (i = 0; i < COMPUTE_MAX; i++)
  110. if (!strcmp(cstr, compute_names[i])) {
  111. *cp = i;
  112. return setup_compute_opt(option);
  113. }
  114. pr_err("Failed: '%s' is not computation method "
  115. "(use 'delta','ratio' or 'wdiff')\n", str);
  116. return -EINVAL;
  117. }
  118. static double get_period_percent(struct hist_entry *he, u64 period)
  119. {
  120. u64 total = he->hists->stats.total_period;
  121. return (period * 100.0) / total;
  122. }
  123. double perf_diff__compute_delta(struct hist_entry *he)
  124. {
  125. struct hist_entry *pair = hist_entry__next_pair(he);
  126. double new_percent = get_period_percent(he, he->stat.period);
  127. double old_percent = pair ? get_period_percent(pair, pair->stat.period) : 0.0;
  128. he->diff.period_ratio_delta = new_percent - old_percent;
  129. he->diff.computed = true;
  130. return he->diff.period_ratio_delta;
  131. }
  132. double perf_diff__compute_ratio(struct hist_entry *he)
  133. {
  134. struct hist_entry *pair = hist_entry__next_pair(he);
  135. double new_period = he->stat.period;
  136. double old_period = pair ? pair->stat.period : 0;
  137. he->diff.computed = true;
  138. he->diff.period_ratio = pair ? (new_period / old_period) : 0;
  139. return he->diff.period_ratio;
  140. }
  141. s64 perf_diff__compute_wdiff(struct hist_entry *he)
  142. {
  143. struct hist_entry *pair = hist_entry__next_pair(he);
  144. u64 new_period = he->stat.period;
  145. u64 old_period = pair ? pair->stat.period : 0;
  146. he->diff.computed = true;
  147. if (!pair)
  148. he->diff.wdiff = 0;
  149. else
  150. he->diff.wdiff = new_period * compute_wdiff_w2 -
  151. old_period * compute_wdiff_w1;
  152. return he->diff.wdiff;
  153. }
  154. static int formula_delta(struct hist_entry *he, char *buf, size_t size)
  155. {
  156. struct hist_entry *pair = hist_entry__next_pair(he);
  157. if (!pair)
  158. return -1;
  159. return scnprintf(buf, size,
  160. "(%" PRIu64 " * 100 / %" PRIu64 ") - "
  161. "(%" PRIu64 " * 100 / %" PRIu64 ")",
  162. he->stat.period, he->hists->stats.total_period,
  163. pair->stat.period, pair->hists->stats.total_period);
  164. }
  165. static int formula_ratio(struct hist_entry *he, char *buf, size_t size)
  166. {
  167. struct hist_entry *pair = hist_entry__next_pair(he);
  168. double new_period = he->stat.period;
  169. double old_period = pair ? pair->stat.period : 0;
  170. if (!pair)
  171. return -1;
  172. return scnprintf(buf, size, "%.0F / %.0F", new_period, old_period);
  173. }
  174. static int formula_wdiff(struct hist_entry *he, char *buf, size_t size)
  175. {
  176. struct hist_entry *pair = hist_entry__next_pair(he);
  177. u64 new_period = he->stat.period;
  178. u64 old_period = pair ? pair->stat.period : 0;
  179. if (!pair)
  180. return -1;
  181. return scnprintf(buf, size,
  182. "(%" PRIu64 " * " "%" PRId64 ") - (%" PRIu64 " * " "%" PRId64 ")",
  183. new_period, compute_wdiff_w2, old_period, compute_wdiff_w1);
  184. }
  185. int perf_diff__formula(char *buf, size_t size, struct hist_entry *he)
  186. {
  187. switch (compute) {
  188. case COMPUTE_DELTA:
  189. return formula_delta(he, buf, size);
  190. case COMPUTE_RATIO:
  191. return formula_ratio(he, buf, size);
  192. case COMPUTE_WEIGHTED_DIFF:
  193. return formula_wdiff(he, buf, size);
  194. default:
  195. BUG_ON(1);
  196. }
  197. return -1;
  198. }
  199. static int hists__add_entry(struct hists *self,
  200. struct addr_location *al, u64 period)
  201. {
  202. if (__hists__add_entry(self, al, NULL, period) != NULL)
  203. return 0;
  204. return -ENOMEM;
  205. }
  206. static int diff__process_sample_event(struct perf_tool *tool __maybe_unused,
  207. union perf_event *event,
  208. struct perf_sample *sample,
  209. struct perf_evsel *evsel,
  210. struct machine *machine)
  211. {
  212. struct addr_location al;
  213. if (perf_event__preprocess_sample(event, machine, &al, sample, NULL) < 0) {
  214. pr_warning("problem processing %d event, skipping it.\n",
  215. event->header.type);
  216. return -1;
  217. }
  218. if (al.filtered)
  219. return 0;
  220. if (hists__add_entry(&evsel->hists, &al, sample->period)) {
  221. pr_warning("problem incrementing symbol period, skipping event\n");
  222. return -1;
  223. }
  224. evsel->hists.stats.total_period += sample->period;
  225. return 0;
  226. }
  227. static struct perf_tool tool = {
  228. .sample = diff__process_sample_event,
  229. .mmap = perf_event__process_mmap,
  230. .comm = perf_event__process_comm,
  231. .exit = perf_event__process_exit,
  232. .fork = perf_event__process_fork,
  233. .lost = perf_event__process_lost,
  234. .ordered_samples = true,
  235. .ordering_requires_timestamps = true,
  236. };
  237. static void insert_hist_entry_by_name(struct rb_root *root,
  238. struct hist_entry *he)
  239. {
  240. struct rb_node **p = &root->rb_node;
  241. struct rb_node *parent = NULL;
  242. struct hist_entry *iter;
  243. while (*p != NULL) {
  244. parent = *p;
  245. iter = rb_entry(parent, struct hist_entry, rb_node);
  246. if (hist_entry__cmp(he, iter) < 0)
  247. p = &(*p)->rb_left;
  248. else
  249. p = &(*p)->rb_right;
  250. }
  251. rb_link_node(&he->rb_node, parent, p);
  252. rb_insert_color(&he->rb_node, root);
  253. }
  254. static void hists__name_resort(struct hists *self, bool sort)
  255. {
  256. unsigned long position = 1;
  257. struct rb_root tmp = RB_ROOT;
  258. struct rb_node *next = rb_first(&self->entries);
  259. while (next != NULL) {
  260. struct hist_entry *n = rb_entry(next, struct hist_entry, rb_node);
  261. next = rb_next(&n->rb_node);
  262. n->position = position++;
  263. if (sort) {
  264. rb_erase(&n->rb_node, &self->entries);
  265. insert_hist_entry_by_name(&tmp, n);
  266. }
  267. }
  268. if (sort)
  269. self->entries = tmp;
  270. }
  271. static struct perf_evsel *evsel_match(struct perf_evsel *evsel,
  272. struct perf_evlist *evlist)
  273. {
  274. struct perf_evsel *e;
  275. list_for_each_entry(e, &evlist->entries, node)
  276. if (perf_evsel__match2(evsel, e))
  277. return e;
  278. return NULL;
  279. }
  280. static void perf_evlist__resort_hists(struct perf_evlist *evlist, bool name)
  281. {
  282. struct perf_evsel *evsel;
  283. list_for_each_entry(evsel, &evlist->entries, node) {
  284. struct hists *hists = &evsel->hists;
  285. hists__output_resort(hists);
  286. /*
  287. * The hists__name_resort only sets possition
  288. * if name is false.
  289. */
  290. if (name || ((!name) && show_displacement))
  291. hists__name_resort(hists, name);
  292. }
  293. }
  294. static void hists__baseline_only(struct hists *hists)
  295. {
  296. struct rb_node *next = rb_first(&hists->entries);
  297. while (next != NULL) {
  298. struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node);
  299. next = rb_next(&he->rb_node);
  300. if (!hist_entry__next_pair(he)) {
  301. rb_erase(&he->rb_node, &hists->entries);
  302. hist_entry__free(he);
  303. }
  304. }
  305. }
  306. static void hists__precompute(struct hists *hists)
  307. {
  308. struct rb_node *next = rb_first(&hists->entries);
  309. while (next != NULL) {
  310. struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node);
  311. next = rb_next(&he->rb_node);
  312. switch (compute) {
  313. case COMPUTE_DELTA:
  314. perf_diff__compute_delta(he);
  315. break;
  316. case COMPUTE_RATIO:
  317. perf_diff__compute_ratio(he);
  318. break;
  319. case COMPUTE_WEIGHTED_DIFF:
  320. perf_diff__compute_wdiff(he);
  321. break;
  322. default:
  323. BUG_ON(1);
  324. }
  325. }
  326. }
  327. static int64_t cmp_doubles(double l, double r)
  328. {
  329. if (l > r)
  330. return -1;
  331. else if (l < r)
  332. return 1;
  333. else
  334. return 0;
  335. }
  336. static int64_t
  337. hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right,
  338. int c)
  339. {
  340. switch (c) {
  341. case COMPUTE_DELTA:
  342. {
  343. double l = left->diff.period_ratio_delta;
  344. double r = right->diff.period_ratio_delta;
  345. return cmp_doubles(l, r);
  346. }
  347. case COMPUTE_RATIO:
  348. {
  349. double l = left->diff.period_ratio;
  350. double r = right->diff.period_ratio;
  351. return cmp_doubles(l, r);
  352. }
  353. case COMPUTE_WEIGHTED_DIFF:
  354. {
  355. s64 l = left->diff.wdiff;
  356. s64 r = right->diff.wdiff;
  357. return r - l;
  358. }
  359. default:
  360. BUG_ON(1);
  361. }
  362. return 0;
  363. }
  364. static void insert_hist_entry_by_compute(struct rb_root *root,
  365. struct hist_entry *he,
  366. int c)
  367. {
  368. struct rb_node **p = &root->rb_node;
  369. struct rb_node *parent = NULL;
  370. struct hist_entry *iter;
  371. while (*p != NULL) {
  372. parent = *p;
  373. iter = rb_entry(parent, struct hist_entry, rb_node);
  374. if (hist_entry__cmp_compute(he, iter, c) < 0)
  375. p = &(*p)->rb_left;
  376. else
  377. p = &(*p)->rb_right;
  378. }
  379. rb_link_node(&he->rb_node, parent, p);
  380. rb_insert_color(&he->rb_node, root);
  381. }
  382. static void hists__compute_resort(struct hists *hists)
  383. {
  384. struct rb_root tmp = RB_ROOT;
  385. struct rb_node *next = rb_first(&hists->entries);
  386. while (next != NULL) {
  387. struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node);
  388. next = rb_next(&he->rb_node);
  389. rb_erase(&he->rb_node, &hists->entries);
  390. insert_hist_entry_by_compute(&tmp, he, compute);
  391. }
  392. hists->entries = tmp;
  393. }
  394. static void hists__process(struct hists *old, struct hists *new)
  395. {
  396. hists__match(new, old);
  397. if (show_baseline_only)
  398. hists__baseline_only(new);
  399. else
  400. hists__link(new, old);
  401. if (sort_compute) {
  402. hists__precompute(new);
  403. hists__compute_resort(new);
  404. }
  405. hists__fprintf(new, true, 0, 0, stdout);
  406. }
  407. static int __cmd_diff(void)
  408. {
  409. int ret, i;
  410. #define older (session[0])
  411. #define newer (session[1])
  412. struct perf_session *session[2];
  413. struct perf_evlist *evlist_new, *evlist_old;
  414. struct perf_evsel *evsel;
  415. bool first = true;
  416. older = perf_session__new(input_old, O_RDONLY, force, false,
  417. &tool);
  418. newer = perf_session__new(input_new, O_RDONLY, force, false,
  419. &tool);
  420. if (session[0] == NULL || session[1] == NULL)
  421. return -ENOMEM;
  422. for (i = 0; i < 2; ++i) {
  423. ret = perf_session__process_events(session[i], &tool);
  424. if (ret)
  425. goto out_delete;
  426. }
  427. evlist_old = older->evlist;
  428. evlist_new = newer->evlist;
  429. perf_evlist__resort_hists(evlist_old, true);
  430. perf_evlist__resort_hists(evlist_new, false);
  431. list_for_each_entry(evsel, &evlist_new->entries, node) {
  432. struct perf_evsel *evsel_old;
  433. evsel_old = evsel_match(evsel, evlist_old);
  434. if (!evsel_old)
  435. continue;
  436. fprintf(stdout, "%s# Event '%s'\n#\n", first ? "" : "\n",
  437. perf_evsel__name(evsel));
  438. first = false;
  439. hists__process(&evsel_old->hists, &evsel->hists);
  440. }
  441. out_delete:
  442. for (i = 0; i < 2; ++i)
  443. perf_session__delete(session[i]);
  444. return ret;
  445. #undef older
  446. #undef newer
  447. }
  448. static const char * const diff_usage[] = {
  449. "perf diff [<options>] [old_file] [new_file]",
  450. NULL,
  451. };
  452. static const struct option options[] = {
  453. OPT_INCR('v', "verbose", &verbose,
  454. "be more verbose (show symbol address, etc)"),
  455. OPT_BOOLEAN('M', "displacement", &show_displacement,
  456. "Show position displacement relative to baseline"),
  457. OPT_BOOLEAN('b', "baseline-only", &show_baseline_only,
  458. "Show only items with match in baseline"),
  459. OPT_CALLBACK('c', "compute", &compute,
  460. "delta,ratio,wdiff:w1,w2 (default delta)",
  461. "Entries differential computation selection",
  462. setup_compute),
  463. OPT_BOOLEAN('p', "period", &show_period,
  464. "Show period values."),
  465. OPT_BOOLEAN('F', "formula", &show_formula,
  466. "Show formula."),
  467. OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
  468. "dump raw trace in ASCII"),
  469. OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
  470. OPT_BOOLEAN('m', "modules", &symbol_conf.use_modules,
  471. "load module symbols - WARNING: use only with -k and LIVE kernel"),
  472. OPT_STRING('d', "dsos", &symbol_conf.dso_list_str, "dso[,dso...]",
  473. "only consider symbols in these dsos"),
  474. OPT_STRING('C', "comms", &symbol_conf.comm_list_str, "comm[,comm...]",
  475. "only consider symbols in these comms"),
  476. OPT_STRING('S', "symbols", &symbol_conf.sym_list_str, "symbol[,symbol...]",
  477. "only consider these symbols"),
  478. OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
  479. "sort by key(s): pid, comm, dso, symbol, parent"),
  480. OPT_STRING('t', "field-separator", &symbol_conf.field_sep, "separator",
  481. "separator for columns, no spaces will be added between "
  482. "columns '.' is reserved."),
  483. OPT_STRING(0, "symfs", &symbol_conf.symfs, "directory",
  484. "Look for files with symbols relative to this directory"),
  485. OPT_END()
  486. };
  487. static void ui_init(void)
  488. {
  489. perf_hpp__init();
  490. /* No overhead column. */
  491. perf_hpp__column_enable(PERF_HPP__OVERHEAD, false);
  492. /*
  493. * Display baseline/delta/ratio/displacement/
  494. * formula/periods columns.
  495. */
  496. perf_hpp__column_enable(PERF_HPP__BASELINE, true);
  497. switch (compute) {
  498. case COMPUTE_DELTA:
  499. perf_hpp__column_enable(PERF_HPP__DELTA, true);
  500. break;
  501. case COMPUTE_RATIO:
  502. perf_hpp__column_enable(PERF_HPP__RATIO, true);
  503. break;
  504. case COMPUTE_WEIGHTED_DIFF:
  505. perf_hpp__column_enable(PERF_HPP__WEIGHTED_DIFF, true);
  506. break;
  507. default:
  508. BUG_ON(1);
  509. };
  510. if (show_displacement)
  511. perf_hpp__column_enable(PERF_HPP__DISPL, true);
  512. if (show_formula)
  513. perf_hpp__column_enable(PERF_HPP__FORMULA, true);
  514. if (show_period) {
  515. perf_hpp__column_enable(PERF_HPP__PERIOD, true);
  516. perf_hpp__column_enable(PERF_HPP__PERIOD_BASELINE, true);
  517. }
  518. }
  519. int cmd_diff(int argc, const char **argv, const char *prefix __maybe_unused)
  520. {
  521. sort_order = diff__default_sort_order;
  522. argc = parse_options(argc, argv, options, diff_usage, 0);
  523. if (argc) {
  524. if (argc > 2)
  525. usage_with_options(diff_usage, options);
  526. if (argc == 2) {
  527. input_old = argv[0];
  528. input_new = argv[1];
  529. } else
  530. input_new = argv[0];
  531. } else if (symbol_conf.default_guest_vmlinux_name ||
  532. symbol_conf.default_guest_kallsyms) {
  533. input_old = "perf.data.host";
  534. input_new = "perf.data.guest";
  535. }
  536. symbol_conf.exclude_other = false;
  537. if (symbol__init() < 0)
  538. return -1;
  539. ui_init();
  540. setup_sorting(diff_usage, options);
  541. setup_pager();
  542. sort_entry__setup_elide(&sort_dso, symbol_conf.dso_list, "dso", NULL);
  543. sort_entry__setup_elide(&sort_comm, symbol_conf.comm_list, "comm", NULL);
  544. sort_entry__setup_elide(&sort_sym, symbol_conf.sym_list, "symbol", NULL);
  545. return __cmd_diff();
  546. }