builtin-diff.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047
  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. #include <math.h>
  20. /* Diff command specific HPP columns. */
  21. enum {
  22. PERF_HPP_DIFF__BASELINE,
  23. PERF_HPP_DIFF__PERIOD,
  24. PERF_HPP_DIFF__PERIOD_BASELINE,
  25. PERF_HPP_DIFF__DELTA,
  26. PERF_HPP_DIFF__RATIO,
  27. PERF_HPP_DIFF__WEIGHTED_DIFF,
  28. PERF_HPP_DIFF__FORMULA,
  29. PERF_HPP_DIFF__MAX_INDEX
  30. };
  31. struct diff_hpp_fmt {
  32. struct perf_hpp_fmt fmt;
  33. int idx;
  34. char *header;
  35. int header_width;
  36. };
  37. struct data__file {
  38. struct perf_session *session;
  39. const char *file;
  40. int idx;
  41. struct hists *hists;
  42. struct diff_hpp_fmt fmt[PERF_HPP_DIFF__MAX_INDEX];
  43. };
  44. static struct data__file *data__files;
  45. static int data__files_cnt;
  46. #define data__for_each_file_start(i, d, s) \
  47. for (i = s, d = &data__files[s]; \
  48. i < data__files_cnt; \
  49. i++, d = &data__files[i])
  50. #define data__for_each_file(i, d) data__for_each_file_start(i, d, 0)
  51. #define data__for_each_file_new(i, d) data__for_each_file_start(i, d, 1)
  52. static char diff__default_sort_order[] = "dso,symbol";
  53. static bool force;
  54. static bool show_period;
  55. static bool show_formula;
  56. static bool show_baseline_only;
  57. static unsigned int sort_compute;
  58. static s64 compute_wdiff_w1;
  59. static s64 compute_wdiff_w2;
  60. enum {
  61. COMPUTE_DELTA,
  62. COMPUTE_RATIO,
  63. COMPUTE_WEIGHTED_DIFF,
  64. COMPUTE_MAX,
  65. };
  66. const char *compute_names[COMPUTE_MAX] = {
  67. [COMPUTE_DELTA] = "delta",
  68. [COMPUTE_RATIO] = "ratio",
  69. [COMPUTE_WEIGHTED_DIFF] = "wdiff",
  70. };
  71. static int compute;
  72. static int compute_2_hpp[COMPUTE_MAX] = {
  73. [COMPUTE_DELTA] = PERF_HPP_DIFF__DELTA,
  74. [COMPUTE_RATIO] = PERF_HPP_DIFF__RATIO,
  75. [COMPUTE_WEIGHTED_DIFF] = PERF_HPP_DIFF__WEIGHTED_DIFF,
  76. };
  77. #define MAX_COL_WIDTH 70
  78. static struct header_column {
  79. const char *name;
  80. int width;
  81. } columns[PERF_HPP_DIFF__MAX_INDEX] = {
  82. [PERF_HPP_DIFF__BASELINE] = {
  83. .name = "Baseline",
  84. },
  85. [PERF_HPP_DIFF__PERIOD] = {
  86. .name = "Period",
  87. .width = 14,
  88. },
  89. [PERF_HPP_DIFF__PERIOD_BASELINE] = {
  90. .name = "Base period",
  91. .width = 14,
  92. },
  93. [PERF_HPP_DIFF__DELTA] = {
  94. .name = "Delta",
  95. .width = 7,
  96. },
  97. [PERF_HPP_DIFF__RATIO] = {
  98. .name = "Ratio",
  99. .width = 14,
  100. },
  101. [PERF_HPP_DIFF__WEIGHTED_DIFF] = {
  102. .name = "Weighted diff",
  103. .width = 14,
  104. },
  105. [PERF_HPP_DIFF__FORMULA] = {
  106. .name = "Formula",
  107. .width = MAX_COL_WIDTH,
  108. }
  109. };
  110. static int setup_compute_opt_wdiff(char *opt)
  111. {
  112. char *w1_str = opt;
  113. char *w2_str;
  114. int ret = -EINVAL;
  115. if (!opt)
  116. goto out;
  117. w2_str = strchr(opt, ',');
  118. if (!w2_str)
  119. goto out;
  120. *w2_str++ = 0x0;
  121. if (!*w2_str)
  122. goto out;
  123. compute_wdiff_w1 = strtol(w1_str, NULL, 10);
  124. compute_wdiff_w2 = strtol(w2_str, NULL, 10);
  125. if (!compute_wdiff_w1 || !compute_wdiff_w2)
  126. goto out;
  127. pr_debug("compute wdiff w1(%" PRId64 ") w2(%" PRId64 ")\n",
  128. compute_wdiff_w1, compute_wdiff_w2);
  129. ret = 0;
  130. out:
  131. if (ret)
  132. pr_err("Failed: wrong weight data, use 'wdiff:w1,w2'\n");
  133. return ret;
  134. }
  135. static int setup_compute_opt(char *opt)
  136. {
  137. if (compute == COMPUTE_WEIGHTED_DIFF)
  138. return setup_compute_opt_wdiff(opt);
  139. if (opt) {
  140. pr_err("Failed: extra option specified '%s'", opt);
  141. return -EINVAL;
  142. }
  143. return 0;
  144. }
  145. static int setup_compute(const struct option *opt, const char *str,
  146. int unset __maybe_unused)
  147. {
  148. int *cp = (int *) opt->value;
  149. char *cstr = (char *) str;
  150. char buf[50];
  151. unsigned i;
  152. char *option;
  153. if (!str) {
  154. *cp = COMPUTE_DELTA;
  155. return 0;
  156. }
  157. option = strchr(str, ':');
  158. if (option) {
  159. unsigned len = option++ - str;
  160. /*
  161. * The str data are not writeable, so we need
  162. * to use another buffer.
  163. */
  164. /* No option value is longer. */
  165. if (len >= sizeof(buf))
  166. return -EINVAL;
  167. strncpy(buf, str, len);
  168. buf[len] = 0x0;
  169. cstr = buf;
  170. }
  171. for (i = 0; i < COMPUTE_MAX; i++)
  172. if (!strcmp(cstr, compute_names[i])) {
  173. *cp = i;
  174. return setup_compute_opt(option);
  175. }
  176. pr_err("Failed: '%s' is not computation method "
  177. "(use 'delta','ratio' or 'wdiff')\n", str);
  178. return -EINVAL;
  179. }
  180. static double period_percent(struct hist_entry *he, u64 period)
  181. {
  182. u64 total = he->hists->stats.total_period;
  183. return (period * 100.0) / total;
  184. }
  185. static double compute_delta(struct hist_entry *he, struct hist_entry *pair)
  186. {
  187. double old_percent = period_percent(he, he->stat.period);
  188. double new_percent = period_percent(pair, pair->stat.period);
  189. pair->diff.period_ratio_delta = new_percent - old_percent;
  190. pair->diff.computed = true;
  191. return pair->diff.period_ratio_delta;
  192. }
  193. static double compute_ratio(struct hist_entry *he, struct hist_entry *pair)
  194. {
  195. double old_period = he->stat.period ?: 1;
  196. double new_period = pair->stat.period;
  197. pair->diff.computed = true;
  198. pair->diff.period_ratio = new_period / old_period;
  199. return pair->diff.period_ratio;
  200. }
  201. static s64 compute_wdiff(struct hist_entry *he, struct hist_entry *pair)
  202. {
  203. u64 old_period = he->stat.period;
  204. u64 new_period = pair->stat.period;
  205. pair->diff.computed = true;
  206. pair->diff.wdiff = new_period * compute_wdiff_w2 -
  207. old_period * compute_wdiff_w1;
  208. return pair->diff.wdiff;
  209. }
  210. static int formula_delta(struct hist_entry *he, struct hist_entry *pair,
  211. char *buf, size_t size)
  212. {
  213. return scnprintf(buf, size,
  214. "(%" PRIu64 " * 100 / %" PRIu64 ") - "
  215. "(%" PRIu64 " * 100 / %" PRIu64 ")",
  216. pair->stat.period, pair->hists->stats.total_period,
  217. he->stat.period, he->hists->stats.total_period);
  218. }
  219. static int formula_ratio(struct hist_entry *he, struct hist_entry *pair,
  220. char *buf, size_t size)
  221. {
  222. double old_period = he->stat.period;
  223. double new_period = pair->stat.period;
  224. return scnprintf(buf, size, "%.0F / %.0F", new_period, old_period);
  225. }
  226. static int formula_wdiff(struct hist_entry *he, struct hist_entry *pair,
  227. char *buf, size_t size)
  228. {
  229. u64 old_period = he->stat.period;
  230. u64 new_period = pair->stat.period;
  231. return scnprintf(buf, size,
  232. "(%" PRIu64 " * " "%" PRId64 ") - (%" PRIu64 " * " "%" PRId64 ")",
  233. new_period, compute_wdiff_w2, old_period, compute_wdiff_w1);
  234. }
  235. static int formula_fprintf(struct hist_entry *he, struct hist_entry *pair,
  236. char *buf, size_t size)
  237. {
  238. switch (compute) {
  239. case COMPUTE_DELTA:
  240. return formula_delta(he, pair, buf, size);
  241. case COMPUTE_RATIO:
  242. return formula_ratio(he, pair, buf, size);
  243. case COMPUTE_WEIGHTED_DIFF:
  244. return formula_wdiff(he, pair, buf, size);
  245. default:
  246. BUG_ON(1);
  247. }
  248. return -1;
  249. }
  250. static int hists__add_entry(struct hists *self,
  251. struct addr_location *al, u64 period,
  252. u64 weight, u64 transaction)
  253. {
  254. if (__hists__add_entry(self, al, NULL, period, weight, transaction)
  255. != NULL)
  256. return 0;
  257. return -ENOMEM;
  258. }
  259. static int diff__process_sample_event(struct perf_tool *tool __maybe_unused,
  260. union perf_event *event,
  261. struct perf_sample *sample,
  262. struct perf_evsel *evsel,
  263. struct machine *machine)
  264. {
  265. struct addr_location al;
  266. if (perf_event__preprocess_sample(event, machine, &al, sample) < 0) {
  267. pr_warning("problem processing %d event, skipping it.\n",
  268. event->header.type);
  269. return -1;
  270. }
  271. if (al.filtered)
  272. return 0;
  273. if (hists__add_entry(&evsel->hists, &al, sample->period,
  274. sample->weight, sample->transaction)) {
  275. pr_warning("problem incrementing symbol period, skipping event\n");
  276. return -1;
  277. }
  278. evsel->hists.stats.total_period += sample->period;
  279. return 0;
  280. }
  281. static struct perf_tool tool = {
  282. .sample = diff__process_sample_event,
  283. .mmap = perf_event__process_mmap,
  284. .comm = perf_event__process_comm,
  285. .exit = perf_event__process_exit,
  286. .fork = perf_event__process_fork,
  287. .lost = perf_event__process_lost,
  288. .ordered_samples = true,
  289. .ordering_requires_timestamps = true,
  290. };
  291. static struct perf_evsel *evsel_match(struct perf_evsel *evsel,
  292. struct perf_evlist *evlist)
  293. {
  294. struct perf_evsel *e;
  295. list_for_each_entry(e, &evlist->entries, node)
  296. if (perf_evsel__match2(evsel, e))
  297. return e;
  298. return NULL;
  299. }
  300. static void perf_evlist__collapse_resort(struct perf_evlist *evlist)
  301. {
  302. struct perf_evsel *evsel;
  303. list_for_each_entry(evsel, &evlist->entries, node) {
  304. struct hists *hists = &evsel->hists;
  305. hists__collapse_resort(hists);
  306. }
  307. }
  308. static struct hist_entry*
  309. get_pair_data(struct hist_entry *he, struct data__file *d)
  310. {
  311. if (hist_entry__has_pairs(he)) {
  312. struct hist_entry *pair;
  313. list_for_each_entry(pair, &he->pairs.head, pairs.node)
  314. if (pair->hists == d->hists)
  315. return pair;
  316. }
  317. return NULL;
  318. }
  319. static struct hist_entry*
  320. get_pair_fmt(struct hist_entry *he, struct diff_hpp_fmt *dfmt)
  321. {
  322. void *ptr = dfmt - dfmt->idx;
  323. struct data__file *d = container_of(ptr, struct data__file, fmt);
  324. return get_pair_data(he, d);
  325. }
  326. static void hists__baseline_only(struct hists *hists)
  327. {
  328. struct rb_root *root;
  329. struct rb_node *next;
  330. if (sort__need_collapse)
  331. root = &hists->entries_collapsed;
  332. else
  333. root = hists->entries_in;
  334. next = rb_first(root);
  335. while (next != NULL) {
  336. struct hist_entry *he = rb_entry(next, struct hist_entry, rb_node_in);
  337. next = rb_next(&he->rb_node_in);
  338. if (!hist_entry__next_pair(he)) {
  339. rb_erase(&he->rb_node_in, root);
  340. hist_entry__free(he);
  341. }
  342. }
  343. }
  344. static void hists__precompute(struct hists *hists)
  345. {
  346. struct rb_root *root;
  347. struct rb_node *next;
  348. if (sort__need_collapse)
  349. root = &hists->entries_collapsed;
  350. else
  351. root = hists->entries_in;
  352. next = rb_first(root);
  353. while (next != NULL) {
  354. struct hist_entry *he, *pair;
  355. he = rb_entry(next, struct hist_entry, rb_node_in);
  356. next = rb_next(&he->rb_node_in);
  357. pair = get_pair_data(he, &data__files[sort_compute]);
  358. if (!pair)
  359. continue;
  360. switch (compute) {
  361. case COMPUTE_DELTA:
  362. compute_delta(he, pair);
  363. break;
  364. case COMPUTE_RATIO:
  365. compute_ratio(he, pair);
  366. break;
  367. case COMPUTE_WEIGHTED_DIFF:
  368. compute_wdiff(he, pair);
  369. break;
  370. default:
  371. BUG_ON(1);
  372. }
  373. }
  374. }
  375. static int64_t cmp_doubles(double l, double r)
  376. {
  377. if (l > r)
  378. return -1;
  379. else if (l < r)
  380. return 1;
  381. else
  382. return 0;
  383. }
  384. static int64_t
  385. __hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right,
  386. int c)
  387. {
  388. switch (c) {
  389. case COMPUTE_DELTA:
  390. {
  391. double l = left->diff.period_ratio_delta;
  392. double r = right->diff.period_ratio_delta;
  393. return cmp_doubles(l, r);
  394. }
  395. case COMPUTE_RATIO:
  396. {
  397. double l = left->diff.period_ratio;
  398. double r = right->diff.period_ratio;
  399. return cmp_doubles(l, r);
  400. }
  401. case COMPUTE_WEIGHTED_DIFF:
  402. {
  403. s64 l = left->diff.wdiff;
  404. s64 r = right->diff.wdiff;
  405. return r - l;
  406. }
  407. default:
  408. BUG_ON(1);
  409. }
  410. return 0;
  411. }
  412. static int64_t
  413. hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right,
  414. int c)
  415. {
  416. bool pairs_left = hist_entry__has_pairs(left);
  417. bool pairs_right = hist_entry__has_pairs(right);
  418. struct hist_entry *p_right, *p_left;
  419. if (!pairs_left && !pairs_right)
  420. return 0;
  421. if (!pairs_left || !pairs_right)
  422. return pairs_left ? -1 : 1;
  423. p_left = get_pair_data(left, &data__files[sort_compute]);
  424. p_right = get_pair_data(right, &data__files[sort_compute]);
  425. if (!p_left && !p_right)
  426. return 0;
  427. if (!p_left || !p_right)
  428. return p_left ? -1 : 1;
  429. /*
  430. * We have 2 entries of same kind, let's
  431. * make the data comparison.
  432. */
  433. return __hist_entry__cmp_compute(p_left, p_right, c);
  434. }
  435. static void insert_hist_entry_by_compute(struct rb_root *root,
  436. struct hist_entry *he,
  437. int c)
  438. {
  439. struct rb_node **p = &root->rb_node;
  440. struct rb_node *parent = NULL;
  441. struct hist_entry *iter;
  442. while (*p != NULL) {
  443. parent = *p;
  444. iter = rb_entry(parent, struct hist_entry, rb_node);
  445. if (hist_entry__cmp_compute(he, iter, c) < 0)
  446. p = &(*p)->rb_left;
  447. else
  448. p = &(*p)->rb_right;
  449. }
  450. rb_link_node(&he->rb_node, parent, p);
  451. rb_insert_color(&he->rb_node, root);
  452. }
  453. static void hists__compute_resort(struct hists *hists)
  454. {
  455. struct rb_root *root;
  456. struct rb_node *next;
  457. if (sort__need_collapse)
  458. root = &hists->entries_collapsed;
  459. else
  460. root = hists->entries_in;
  461. hists->entries = RB_ROOT;
  462. next = rb_first(root);
  463. hists->nr_entries = 0;
  464. hists->stats.total_period = 0;
  465. hists__reset_col_len(hists);
  466. while (next != NULL) {
  467. struct hist_entry *he;
  468. he = rb_entry(next, struct hist_entry, rb_node_in);
  469. next = rb_next(&he->rb_node_in);
  470. insert_hist_entry_by_compute(&hists->entries, he, compute);
  471. hists__inc_nr_entries(hists, he);
  472. }
  473. }
  474. static void hists__process(struct hists *hists)
  475. {
  476. if (show_baseline_only)
  477. hists__baseline_only(hists);
  478. if (sort_compute) {
  479. hists__precompute(hists);
  480. hists__compute_resort(hists);
  481. } else {
  482. hists__output_resort(hists);
  483. }
  484. hists__fprintf(hists, true, 0, 0, 0, stdout);
  485. }
  486. static void data__fprintf(void)
  487. {
  488. struct data__file *d;
  489. int i;
  490. fprintf(stdout, "# Data files:\n");
  491. data__for_each_file(i, d)
  492. fprintf(stdout, "# [%d] %s %s\n",
  493. d->idx, d->file,
  494. !d->idx ? "(Baseline)" : "");
  495. fprintf(stdout, "#\n");
  496. }
  497. static void data_process(void)
  498. {
  499. struct perf_evlist *evlist_base = data__files[0].session->evlist;
  500. struct perf_evsel *evsel_base;
  501. bool first = true;
  502. list_for_each_entry(evsel_base, &evlist_base->entries, node) {
  503. struct data__file *d;
  504. int i;
  505. data__for_each_file_new(i, d) {
  506. struct perf_evlist *evlist = d->session->evlist;
  507. struct perf_evsel *evsel;
  508. evsel = evsel_match(evsel_base, evlist);
  509. if (!evsel)
  510. continue;
  511. d->hists = &evsel->hists;
  512. hists__match(&evsel_base->hists, &evsel->hists);
  513. if (!show_baseline_only)
  514. hists__link(&evsel_base->hists,
  515. &evsel->hists);
  516. }
  517. fprintf(stdout, "%s# Event '%s'\n#\n", first ? "" : "\n",
  518. perf_evsel__name(evsel_base));
  519. first = false;
  520. if (verbose || data__files_cnt > 2)
  521. data__fprintf();
  522. hists__process(&evsel_base->hists);
  523. }
  524. }
  525. static void data__free(struct data__file *d)
  526. {
  527. int col;
  528. for (col = 0; col < PERF_HPP_DIFF__MAX_INDEX; col++) {
  529. struct diff_hpp_fmt *fmt = &d->fmt[col];
  530. free(fmt->header);
  531. }
  532. }
  533. static int __cmd_diff(void)
  534. {
  535. struct data__file *d;
  536. int ret = -EINVAL, i;
  537. data__for_each_file(i, d) {
  538. d->session = perf_session__new(d->file, O_RDONLY, force,
  539. false, &tool);
  540. if (!d->session) {
  541. pr_err("Failed to open %s\n", d->file);
  542. ret = -ENOMEM;
  543. goto out_delete;
  544. }
  545. ret = perf_session__process_events(d->session, &tool);
  546. if (ret) {
  547. pr_err("Failed to process %s\n", d->file);
  548. goto out_delete;
  549. }
  550. perf_evlist__collapse_resort(d->session->evlist);
  551. }
  552. data_process();
  553. out_delete:
  554. data__for_each_file(i, d) {
  555. if (d->session)
  556. perf_session__delete(d->session);
  557. data__free(d);
  558. }
  559. free(data__files);
  560. return ret;
  561. }
  562. static const char * const diff_usage[] = {
  563. "perf diff [<options>] [old_file] [new_file]",
  564. NULL,
  565. };
  566. static const struct option options[] = {
  567. OPT_INCR('v', "verbose", &verbose,
  568. "be more verbose (show symbol address, etc)"),
  569. OPT_BOOLEAN('b', "baseline-only", &show_baseline_only,
  570. "Show only items with match in baseline"),
  571. OPT_CALLBACK('c', "compute", &compute,
  572. "delta,ratio,wdiff:w1,w2 (default delta)",
  573. "Entries differential computation selection",
  574. setup_compute),
  575. OPT_BOOLEAN('p', "period", &show_period,
  576. "Show period values."),
  577. OPT_BOOLEAN('F', "formula", &show_formula,
  578. "Show formula."),
  579. OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
  580. "dump raw trace in ASCII"),
  581. OPT_BOOLEAN('f', "force", &force, "don't complain, do it"),
  582. OPT_BOOLEAN('m', "modules", &symbol_conf.use_modules,
  583. "load module symbols - WARNING: use only with -k and LIVE kernel"),
  584. OPT_STRING('d', "dsos", &symbol_conf.dso_list_str, "dso[,dso...]",
  585. "only consider symbols in these dsos"),
  586. OPT_STRING('C', "comms", &symbol_conf.comm_list_str, "comm[,comm...]",
  587. "only consider symbols in these comms"),
  588. OPT_STRING('S', "symbols", &symbol_conf.sym_list_str, "symbol[,symbol...]",
  589. "only consider these symbols"),
  590. OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
  591. "sort by key(s): pid, comm, dso, symbol, parent"),
  592. OPT_STRING('t', "field-separator", &symbol_conf.field_sep, "separator",
  593. "separator for columns, no spaces will be added between "
  594. "columns '.' is reserved."),
  595. OPT_STRING(0, "symfs", &symbol_conf.symfs, "directory",
  596. "Look for files with symbols relative to this directory"),
  597. OPT_UINTEGER('o', "order", &sort_compute, "Specify compute sorting."),
  598. OPT_END()
  599. };
  600. static double baseline_percent(struct hist_entry *he)
  601. {
  602. struct hists *hists = he->hists;
  603. return 100.0 * he->stat.period / hists->stats.total_period;
  604. }
  605. static int hpp__color_baseline(struct perf_hpp_fmt *fmt,
  606. struct perf_hpp *hpp, struct hist_entry *he)
  607. {
  608. struct diff_hpp_fmt *dfmt =
  609. container_of(fmt, struct diff_hpp_fmt, fmt);
  610. double percent = baseline_percent(he);
  611. char pfmt[20] = " ";
  612. if (!he->dummy) {
  613. scnprintf(pfmt, 20, "%%%d.2f%%%%", dfmt->header_width - 1);
  614. return percent_color_snprintf(hpp->buf, hpp->size,
  615. pfmt, percent);
  616. } else
  617. return scnprintf(hpp->buf, hpp->size, "%*s",
  618. dfmt->header_width, pfmt);
  619. }
  620. static int hpp__entry_baseline(struct hist_entry *he, char *buf, size_t size)
  621. {
  622. double percent = baseline_percent(he);
  623. const char *fmt = symbol_conf.field_sep ? "%.2f" : "%6.2f%%";
  624. int ret = 0;
  625. if (!he->dummy)
  626. ret = scnprintf(buf, size, fmt, percent);
  627. return ret;
  628. }
  629. static void
  630. hpp__entry_unpair(struct hist_entry *he, int idx, char *buf, size_t size)
  631. {
  632. switch (idx) {
  633. case PERF_HPP_DIFF__PERIOD_BASELINE:
  634. scnprintf(buf, size, "%" PRIu64, he->stat.period);
  635. break;
  636. default:
  637. break;
  638. }
  639. }
  640. static void
  641. hpp__entry_pair(struct hist_entry *he, struct hist_entry *pair,
  642. int idx, char *buf, size_t size)
  643. {
  644. double diff;
  645. double ratio;
  646. s64 wdiff;
  647. switch (idx) {
  648. case PERF_HPP_DIFF__DELTA:
  649. if (pair->diff.computed)
  650. diff = pair->diff.period_ratio_delta;
  651. else
  652. diff = compute_delta(he, pair);
  653. if (fabs(diff) >= 0.01)
  654. scnprintf(buf, size, "%+4.2F%%", diff);
  655. break;
  656. case PERF_HPP_DIFF__RATIO:
  657. /* No point for ratio number if we are dummy.. */
  658. if (he->dummy)
  659. break;
  660. if (pair->diff.computed)
  661. ratio = pair->diff.period_ratio;
  662. else
  663. ratio = compute_ratio(he, pair);
  664. if (ratio > 0.0)
  665. scnprintf(buf, size, "%14.6F", ratio);
  666. break;
  667. case PERF_HPP_DIFF__WEIGHTED_DIFF:
  668. /* No point for wdiff number if we are dummy.. */
  669. if (he->dummy)
  670. break;
  671. if (pair->diff.computed)
  672. wdiff = pair->diff.wdiff;
  673. else
  674. wdiff = compute_wdiff(he, pair);
  675. if (wdiff != 0)
  676. scnprintf(buf, size, "%14ld", wdiff);
  677. break;
  678. case PERF_HPP_DIFF__FORMULA:
  679. formula_fprintf(he, pair, buf, size);
  680. break;
  681. case PERF_HPP_DIFF__PERIOD:
  682. scnprintf(buf, size, "%" PRIu64, pair->stat.period);
  683. break;
  684. default:
  685. BUG_ON(1);
  686. };
  687. }
  688. static void
  689. __hpp__entry_global(struct hist_entry *he, struct diff_hpp_fmt *dfmt,
  690. char *buf, size_t size)
  691. {
  692. struct hist_entry *pair = get_pair_fmt(he, dfmt);
  693. int idx = dfmt->idx;
  694. /* baseline is special */
  695. if (idx == PERF_HPP_DIFF__BASELINE)
  696. hpp__entry_baseline(he, buf, size);
  697. else {
  698. if (pair)
  699. hpp__entry_pair(he, pair, idx, buf, size);
  700. else
  701. hpp__entry_unpair(he, idx, buf, size);
  702. }
  703. }
  704. static int hpp__entry_global(struct perf_hpp_fmt *_fmt, struct perf_hpp *hpp,
  705. struct hist_entry *he)
  706. {
  707. struct diff_hpp_fmt *dfmt =
  708. container_of(_fmt, struct diff_hpp_fmt, fmt);
  709. char buf[MAX_COL_WIDTH] = " ";
  710. __hpp__entry_global(he, dfmt, buf, MAX_COL_WIDTH);
  711. if (symbol_conf.field_sep)
  712. return scnprintf(hpp->buf, hpp->size, "%s", buf);
  713. else
  714. return scnprintf(hpp->buf, hpp->size, "%*s",
  715. dfmt->header_width, buf);
  716. }
  717. static int hpp__header(struct perf_hpp_fmt *fmt,
  718. struct perf_hpp *hpp)
  719. {
  720. struct diff_hpp_fmt *dfmt =
  721. container_of(fmt, struct diff_hpp_fmt, fmt);
  722. BUG_ON(!dfmt->header);
  723. return scnprintf(hpp->buf, hpp->size, dfmt->header);
  724. }
  725. static int hpp__width(struct perf_hpp_fmt *fmt,
  726. struct perf_hpp *hpp __maybe_unused)
  727. {
  728. struct diff_hpp_fmt *dfmt =
  729. container_of(fmt, struct diff_hpp_fmt, fmt);
  730. BUG_ON(dfmt->header_width <= 0);
  731. return dfmt->header_width;
  732. }
  733. static void init_header(struct data__file *d, struct diff_hpp_fmt *dfmt)
  734. {
  735. #define MAX_HEADER_NAME 100
  736. char buf_indent[MAX_HEADER_NAME];
  737. char buf[MAX_HEADER_NAME];
  738. const char *header = NULL;
  739. int width = 0;
  740. BUG_ON(dfmt->idx >= PERF_HPP_DIFF__MAX_INDEX);
  741. header = columns[dfmt->idx].name;
  742. width = columns[dfmt->idx].width;
  743. /* Only our defined HPP fmts should appear here. */
  744. BUG_ON(!header);
  745. if (data__files_cnt > 2)
  746. scnprintf(buf, MAX_HEADER_NAME, "%s/%d", header, d->idx);
  747. #define NAME (data__files_cnt > 2 ? buf : header)
  748. dfmt->header_width = width;
  749. width = (int) strlen(NAME);
  750. if (dfmt->header_width < width)
  751. dfmt->header_width = width;
  752. scnprintf(buf_indent, MAX_HEADER_NAME, "%*s",
  753. dfmt->header_width, NAME);
  754. dfmt->header = strdup(buf_indent);
  755. #undef MAX_HEADER_NAME
  756. #undef NAME
  757. }
  758. static void data__hpp_register(struct data__file *d, int idx)
  759. {
  760. struct diff_hpp_fmt *dfmt = &d->fmt[idx];
  761. struct perf_hpp_fmt *fmt = &dfmt->fmt;
  762. dfmt->idx = idx;
  763. fmt->header = hpp__header;
  764. fmt->width = hpp__width;
  765. fmt->entry = hpp__entry_global;
  766. /* TODO more colors */
  767. if (idx == PERF_HPP_DIFF__BASELINE)
  768. fmt->color = hpp__color_baseline;
  769. init_header(d, dfmt);
  770. perf_hpp__column_register(fmt);
  771. }
  772. static void ui_init(void)
  773. {
  774. struct data__file *d;
  775. int i;
  776. data__for_each_file(i, d) {
  777. /*
  778. * Baseline or compute realted columns:
  779. *
  780. * PERF_HPP_DIFF__BASELINE
  781. * PERF_HPP_DIFF__DELTA
  782. * PERF_HPP_DIFF__RATIO
  783. * PERF_HPP_DIFF__WEIGHTED_DIFF
  784. */
  785. data__hpp_register(d, i ? compute_2_hpp[compute] :
  786. PERF_HPP_DIFF__BASELINE);
  787. /*
  788. * And the rest:
  789. *
  790. * PERF_HPP_DIFF__FORMULA
  791. * PERF_HPP_DIFF__PERIOD
  792. * PERF_HPP_DIFF__PERIOD_BASELINE
  793. */
  794. if (show_formula && i)
  795. data__hpp_register(d, PERF_HPP_DIFF__FORMULA);
  796. if (show_period)
  797. data__hpp_register(d, i ? PERF_HPP_DIFF__PERIOD :
  798. PERF_HPP_DIFF__PERIOD_BASELINE);
  799. }
  800. }
  801. static int data_init(int argc, const char **argv)
  802. {
  803. struct data__file *d;
  804. static const char *defaults[] = {
  805. "perf.data.old",
  806. "perf.data",
  807. };
  808. bool use_default = true;
  809. int i;
  810. data__files_cnt = 2;
  811. if (argc) {
  812. if (argc == 1)
  813. defaults[1] = argv[0];
  814. else {
  815. data__files_cnt = argc;
  816. use_default = false;
  817. }
  818. } else if (symbol_conf.default_guest_vmlinux_name ||
  819. symbol_conf.default_guest_kallsyms) {
  820. defaults[0] = "perf.data.host";
  821. defaults[1] = "perf.data.guest";
  822. }
  823. if (sort_compute >= (unsigned int) data__files_cnt) {
  824. pr_err("Order option out of limit.\n");
  825. return -EINVAL;
  826. }
  827. data__files = zalloc(sizeof(*data__files) * data__files_cnt);
  828. if (!data__files)
  829. return -ENOMEM;
  830. data__for_each_file(i, d) {
  831. d->file = use_default ? defaults[i] : argv[i];
  832. d->idx = i;
  833. }
  834. return 0;
  835. }
  836. int cmd_diff(int argc, const char **argv, const char *prefix __maybe_unused)
  837. {
  838. sort_order = diff__default_sort_order;
  839. argc = parse_options(argc, argv, options, diff_usage, 0);
  840. if (symbol__init() < 0)
  841. return -1;
  842. if (data_init(argc, argv) < 0)
  843. return -1;
  844. ui_init();
  845. if (setup_sorting() < 0)
  846. usage_with_options(diff_usage, options);
  847. setup_pager();
  848. sort__setup_elide(NULL);
  849. return __cmd_diff();
  850. }