sort.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588
  1. #include "sort.h"
  2. #include "hist.h"
  3. regex_t parent_regex;
  4. const char default_parent_pattern[] = "^sys_|^do_page_fault";
  5. const char *parent_pattern = default_parent_pattern;
  6. const char default_sort_order[] = "comm,dso,symbol";
  7. const char *sort_order = default_sort_order;
  8. int sort__need_collapse = 0;
  9. int sort__has_parent = 0;
  10. int sort__has_sym = 0;
  11. int sort__branch_mode = -1; /* -1 = means not set */
  12. enum sort_type sort__first_dimension;
  13. LIST_HEAD(hist_entry__sort_list);
  14. static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
  15. {
  16. int n;
  17. va_list ap;
  18. va_start(ap, fmt);
  19. n = vsnprintf(bf, size, fmt, ap);
  20. if (symbol_conf.field_sep && n > 0) {
  21. char *sep = bf;
  22. while (1) {
  23. sep = strchr(sep, *symbol_conf.field_sep);
  24. if (sep == NULL)
  25. break;
  26. *sep = '.';
  27. }
  28. }
  29. va_end(ap);
  30. if (n >= (int)size)
  31. return size - 1;
  32. return n;
  33. }
  34. static int64_t cmp_null(void *l, void *r)
  35. {
  36. if (!l && !r)
  37. return 0;
  38. else if (!l)
  39. return -1;
  40. else
  41. return 1;
  42. }
  43. /* --sort pid */
  44. static int64_t
  45. sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
  46. {
  47. return right->thread->pid - left->thread->pid;
  48. }
  49. static int hist_entry__thread_snprintf(struct hist_entry *self, char *bf,
  50. size_t size, unsigned int width)
  51. {
  52. return repsep_snprintf(bf, size, "%*s:%5d", width,
  53. self->thread->comm ?: "", self->thread->pid);
  54. }
  55. struct sort_entry sort_thread = {
  56. .se_header = "Command: Pid",
  57. .se_cmp = sort__thread_cmp,
  58. .se_snprintf = hist_entry__thread_snprintf,
  59. .se_width_idx = HISTC_THREAD,
  60. };
  61. /* --sort comm */
  62. static int64_t
  63. sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
  64. {
  65. return right->thread->pid - left->thread->pid;
  66. }
  67. static int64_t
  68. sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
  69. {
  70. char *comm_l = left->thread->comm;
  71. char *comm_r = right->thread->comm;
  72. if (!comm_l || !comm_r)
  73. return cmp_null(comm_l, comm_r);
  74. return strcmp(comm_l, comm_r);
  75. }
  76. static int hist_entry__comm_snprintf(struct hist_entry *self, char *bf,
  77. size_t size, unsigned int width)
  78. {
  79. return repsep_snprintf(bf, size, "%*s", width, self->thread->comm);
  80. }
  81. static int64_t _sort__dso_cmp(struct map *map_l, struct map *map_r)
  82. {
  83. struct dso *dso_l = map_l ? map_l->dso : NULL;
  84. struct dso *dso_r = map_r ? map_r->dso : NULL;
  85. const char *dso_name_l, *dso_name_r;
  86. if (!dso_l || !dso_r)
  87. return cmp_null(dso_l, dso_r);
  88. if (verbose) {
  89. dso_name_l = dso_l->long_name;
  90. dso_name_r = dso_r->long_name;
  91. } else {
  92. dso_name_l = dso_l->short_name;
  93. dso_name_r = dso_r->short_name;
  94. }
  95. return strcmp(dso_name_l, dso_name_r);
  96. }
  97. struct sort_entry sort_comm = {
  98. .se_header = "Command",
  99. .se_cmp = sort__comm_cmp,
  100. .se_collapse = sort__comm_collapse,
  101. .se_snprintf = hist_entry__comm_snprintf,
  102. .se_width_idx = HISTC_COMM,
  103. };
  104. /* --sort dso */
  105. static int64_t
  106. sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
  107. {
  108. return _sort__dso_cmp(left->ms.map, right->ms.map);
  109. }
  110. static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r,
  111. u64 ip_l, u64 ip_r)
  112. {
  113. if (!sym_l || !sym_r)
  114. return cmp_null(sym_l, sym_r);
  115. if (sym_l == sym_r)
  116. return 0;
  117. ip_l = sym_l->start;
  118. ip_r = sym_r->start;
  119. return (int64_t)(ip_r - ip_l);
  120. }
  121. static int _hist_entry__dso_snprintf(struct map *map, char *bf,
  122. size_t size, unsigned int width)
  123. {
  124. if (map && map->dso) {
  125. const char *dso_name = !verbose ? map->dso->short_name :
  126. map->dso->long_name;
  127. return repsep_snprintf(bf, size, "%-*s", width, dso_name);
  128. }
  129. return repsep_snprintf(bf, size, "%-*s", width, "[unknown]");
  130. }
  131. static int hist_entry__dso_snprintf(struct hist_entry *self, char *bf,
  132. size_t size, unsigned int width)
  133. {
  134. return _hist_entry__dso_snprintf(self->ms.map, bf, size, width);
  135. }
  136. static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
  137. u64 ip, char level, char *bf, size_t size,
  138. unsigned int width __maybe_unused)
  139. {
  140. size_t ret = 0;
  141. if (verbose) {
  142. char o = map ? dso__symtab_origin(map->dso) : '!';
  143. ret += repsep_snprintf(bf, size, "%-#*llx %c ",
  144. BITS_PER_LONG / 4, ip, o);
  145. }
  146. ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
  147. if (sym)
  148. ret += repsep_snprintf(bf + ret, size - ret, "%-*s",
  149. width - ret,
  150. sym->name);
  151. else {
  152. size_t len = BITS_PER_LONG / 4;
  153. ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
  154. len, ip);
  155. ret += repsep_snprintf(bf + ret, size - ret, "%-*s",
  156. width - ret, "");
  157. }
  158. return ret;
  159. }
  160. struct sort_entry sort_dso = {
  161. .se_header = "Shared Object",
  162. .se_cmp = sort__dso_cmp,
  163. .se_snprintf = hist_entry__dso_snprintf,
  164. .se_width_idx = HISTC_DSO,
  165. };
  166. static int hist_entry__sym_snprintf(struct hist_entry *self, char *bf,
  167. size_t size,
  168. unsigned int width __maybe_unused)
  169. {
  170. return _hist_entry__sym_snprintf(self->ms.map, self->ms.sym, self->ip,
  171. self->level, bf, size, width);
  172. }
  173. /* --sort symbol */
  174. static int64_t
  175. sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
  176. {
  177. u64 ip_l, ip_r;
  178. if (!left->ms.sym && !right->ms.sym)
  179. return right->level - left->level;
  180. if (!left->ms.sym || !right->ms.sym)
  181. return cmp_null(left->ms.sym, right->ms.sym);
  182. if (left->ms.sym == right->ms.sym)
  183. return 0;
  184. ip_l = left->ms.sym->start;
  185. ip_r = right->ms.sym->start;
  186. return _sort__sym_cmp(left->ms.sym, right->ms.sym, ip_l, ip_r);
  187. }
  188. struct sort_entry sort_sym = {
  189. .se_header = "Symbol",
  190. .se_cmp = sort__sym_cmp,
  191. .se_snprintf = hist_entry__sym_snprintf,
  192. .se_width_idx = HISTC_SYMBOL,
  193. };
  194. /* --sort srcline */
  195. static int64_t
  196. sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
  197. {
  198. return (int64_t)(right->ip - left->ip);
  199. }
  200. static int hist_entry__srcline_snprintf(struct hist_entry *self, char *bf,
  201. size_t size,
  202. unsigned int width __maybe_unused)
  203. {
  204. FILE *fp;
  205. char cmd[PATH_MAX + 2], *path = self->srcline, *nl;
  206. size_t line_len;
  207. if (path != NULL)
  208. goto out_path;
  209. if (!self->ms.map)
  210. goto out_ip;
  211. if (!strncmp(self->ms.map->dso->long_name, "/tmp/perf-", 10))
  212. goto out_ip;
  213. snprintf(cmd, sizeof(cmd), "addr2line -e %s %016" PRIx64,
  214. self->ms.map->dso->long_name, self->ip);
  215. fp = popen(cmd, "r");
  216. if (!fp)
  217. goto out_ip;
  218. if (getline(&path, &line_len, fp) < 0 || !line_len)
  219. goto out_ip;
  220. fclose(fp);
  221. self->srcline = strdup(path);
  222. if (self->srcline == NULL)
  223. goto out_ip;
  224. nl = strchr(self->srcline, '\n');
  225. if (nl != NULL)
  226. *nl = '\0';
  227. path = self->srcline;
  228. out_path:
  229. return repsep_snprintf(bf, size, "%s", path);
  230. out_ip:
  231. return repsep_snprintf(bf, size, "%-#*llx", BITS_PER_LONG / 4, self->ip);
  232. }
  233. struct sort_entry sort_srcline = {
  234. .se_header = "Source:Line",
  235. .se_cmp = sort__srcline_cmp,
  236. .se_snprintf = hist_entry__srcline_snprintf,
  237. .se_width_idx = HISTC_SRCLINE,
  238. };
  239. /* --sort parent */
  240. static int64_t
  241. sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
  242. {
  243. struct symbol *sym_l = left->parent;
  244. struct symbol *sym_r = right->parent;
  245. if (!sym_l || !sym_r)
  246. return cmp_null(sym_l, sym_r);
  247. return strcmp(sym_l->name, sym_r->name);
  248. }
  249. static int hist_entry__parent_snprintf(struct hist_entry *self, char *bf,
  250. size_t size, unsigned int width)
  251. {
  252. return repsep_snprintf(bf, size, "%-*s", width,
  253. self->parent ? self->parent->name : "[other]");
  254. }
  255. struct sort_entry sort_parent = {
  256. .se_header = "Parent symbol",
  257. .se_cmp = sort__parent_cmp,
  258. .se_snprintf = hist_entry__parent_snprintf,
  259. .se_width_idx = HISTC_PARENT,
  260. };
  261. /* --sort cpu */
  262. static int64_t
  263. sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
  264. {
  265. return right->cpu - left->cpu;
  266. }
  267. static int hist_entry__cpu_snprintf(struct hist_entry *self, char *bf,
  268. size_t size, unsigned int width)
  269. {
  270. return repsep_snprintf(bf, size, "%-*d", width, self->cpu);
  271. }
  272. struct sort_entry sort_cpu = {
  273. .se_header = "CPU",
  274. .se_cmp = sort__cpu_cmp,
  275. .se_snprintf = hist_entry__cpu_snprintf,
  276. .se_width_idx = HISTC_CPU,
  277. };
  278. static int64_t
  279. sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
  280. {
  281. return _sort__dso_cmp(left->branch_info->from.map,
  282. right->branch_info->from.map);
  283. }
  284. static int hist_entry__dso_from_snprintf(struct hist_entry *self, char *bf,
  285. size_t size, unsigned int width)
  286. {
  287. return _hist_entry__dso_snprintf(self->branch_info->from.map,
  288. bf, size, width);
  289. }
  290. struct sort_entry sort_dso_from = {
  291. .se_header = "Source Shared Object",
  292. .se_cmp = sort__dso_from_cmp,
  293. .se_snprintf = hist_entry__dso_from_snprintf,
  294. .se_width_idx = HISTC_DSO_FROM,
  295. };
  296. static int64_t
  297. sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
  298. {
  299. return _sort__dso_cmp(left->branch_info->to.map,
  300. right->branch_info->to.map);
  301. }
  302. static int hist_entry__dso_to_snprintf(struct hist_entry *self, char *bf,
  303. size_t size, unsigned int width)
  304. {
  305. return _hist_entry__dso_snprintf(self->branch_info->to.map,
  306. bf, size, width);
  307. }
  308. static int64_t
  309. sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right)
  310. {
  311. struct addr_map_symbol *from_l = &left->branch_info->from;
  312. struct addr_map_symbol *from_r = &right->branch_info->from;
  313. if (!from_l->sym && !from_r->sym)
  314. return right->level - left->level;
  315. return _sort__sym_cmp(from_l->sym, from_r->sym, from_l->addr,
  316. from_r->addr);
  317. }
  318. static int64_t
  319. sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
  320. {
  321. struct addr_map_symbol *to_l = &left->branch_info->to;
  322. struct addr_map_symbol *to_r = &right->branch_info->to;
  323. if (!to_l->sym && !to_r->sym)
  324. return right->level - left->level;
  325. return _sort__sym_cmp(to_l->sym, to_r->sym, to_l->addr, to_r->addr);
  326. }
  327. static int hist_entry__sym_from_snprintf(struct hist_entry *self, char *bf,
  328. size_t size,
  329. unsigned int width __maybe_unused)
  330. {
  331. struct addr_map_symbol *from = &self->branch_info->from;
  332. return _hist_entry__sym_snprintf(from->map, from->sym, from->addr,
  333. self->level, bf, size, width);
  334. }
  335. static int hist_entry__sym_to_snprintf(struct hist_entry *self, char *bf,
  336. size_t size,
  337. unsigned int width __maybe_unused)
  338. {
  339. struct addr_map_symbol *to = &self->branch_info->to;
  340. return _hist_entry__sym_snprintf(to->map, to->sym, to->addr,
  341. self->level, bf, size, width);
  342. }
  343. struct sort_entry sort_dso_to = {
  344. .se_header = "Target Shared Object",
  345. .se_cmp = sort__dso_to_cmp,
  346. .se_snprintf = hist_entry__dso_to_snprintf,
  347. .se_width_idx = HISTC_DSO_TO,
  348. };
  349. struct sort_entry sort_sym_from = {
  350. .se_header = "Source Symbol",
  351. .se_cmp = sort__sym_from_cmp,
  352. .se_snprintf = hist_entry__sym_from_snprintf,
  353. .se_width_idx = HISTC_SYMBOL_FROM,
  354. };
  355. struct sort_entry sort_sym_to = {
  356. .se_header = "Target Symbol",
  357. .se_cmp = sort__sym_to_cmp,
  358. .se_snprintf = hist_entry__sym_to_snprintf,
  359. .se_width_idx = HISTC_SYMBOL_TO,
  360. };
  361. static int64_t
  362. sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right)
  363. {
  364. const unsigned char mp = left->branch_info->flags.mispred !=
  365. right->branch_info->flags.mispred;
  366. const unsigned char p = left->branch_info->flags.predicted !=
  367. right->branch_info->flags.predicted;
  368. return mp || p;
  369. }
  370. static int hist_entry__mispredict_snprintf(struct hist_entry *self, char *bf,
  371. size_t size, unsigned int width){
  372. static const char *out = "N/A";
  373. if (self->branch_info->flags.predicted)
  374. out = "N";
  375. else if (self->branch_info->flags.mispred)
  376. out = "Y";
  377. return repsep_snprintf(bf, size, "%-*s", width, out);
  378. }
  379. struct sort_entry sort_mispredict = {
  380. .se_header = "Branch Mispredicted",
  381. .se_cmp = sort__mispredict_cmp,
  382. .se_snprintf = hist_entry__mispredict_snprintf,
  383. .se_width_idx = HISTC_MISPREDICT,
  384. };
  385. struct sort_dimension {
  386. const char *name;
  387. struct sort_entry *entry;
  388. int taken;
  389. };
  390. #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
  391. static struct sort_dimension sort_dimensions[] = {
  392. DIM(SORT_PID, "pid", sort_thread),
  393. DIM(SORT_COMM, "comm", sort_comm),
  394. DIM(SORT_DSO, "dso", sort_dso),
  395. DIM(SORT_DSO_FROM, "dso_from", sort_dso_from),
  396. DIM(SORT_DSO_TO, "dso_to", sort_dso_to),
  397. DIM(SORT_SYM, "symbol", sort_sym),
  398. DIM(SORT_SYM_TO, "symbol_from", sort_sym_from),
  399. DIM(SORT_SYM_FROM, "symbol_to", sort_sym_to),
  400. DIM(SORT_PARENT, "parent", sort_parent),
  401. DIM(SORT_CPU, "cpu", sort_cpu),
  402. DIM(SORT_MISPREDICT, "mispredict", sort_mispredict),
  403. DIM(SORT_SRCLINE, "srcline", sort_srcline),
  404. };
  405. int sort_dimension__add(const char *tok)
  406. {
  407. unsigned int i;
  408. for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
  409. struct sort_dimension *sd = &sort_dimensions[i];
  410. if (strncasecmp(tok, sd->name, strlen(tok)))
  411. continue;
  412. if (sd->entry == &sort_parent) {
  413. int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
  414. if (ret) {
  415. char err[BUFSIZ];
  416. regerror(ret, &parent_regex, err, sizeof(err));
  417. pr_err("Invalid regex: %s\n%s", parent_pattern, err);
  418. return -EINVAL;
  419. }
  420. sort__has_parent = 1;
  421. } else if (sd->entry == &sort_sym ||
  422. sd->entry == &sort_sym_from ||
  423. sd->entry == &sort_sym_to) {
  424. sort__has_sym = 1;
  425. }
  426. if (sd->taken)
  427. return 0;
  428. if (sd->entry->se_collapse)
  429. sort__need_collapse = 1;
  430. if (list_empty(&hist_entry__sort_list)) {
  431. if (!strcmp(sd->name, "pid"))
  432. sort__first_dimension = SORT_PID;
  433. else if (!strcmp(sd->name, "comm"))
  434. sort__first_dimension = SORT_COMM;
  435. else if (!strcmp(sd->name, "dso"))
  436. sort__first_dimension = SORT_DSO;
  437. else if (!strcmp(sd->name, "symbol"))
  438. sort__first_dimension = SORT_SYM;
  439. else if (!strcmp(sd->name, "parent"))
  440. sort__first_dimension = SORT_PARENT;
  441. else if (!strcmp(sd->name, "cpu"))
  442. sort__first_dimension = SORT_CPU;
  443. else if (!strcmp(sd->name, "symbol_from"))
  444. sort__first_dimension = SORT_SYM_FROM;
  445. else if (!strcmp(sd->name, "symbol_to"))
  446. sort__first_dimension = SORT_SYM_TO;
  447. else if (!strcmp(sd->name, "dso_from"))
  448. sort__first_dimension = SORT_DSO_FROM;
  449. else if (!strcmp(sd->name, "dso_to"))
  450. sort__first_dimension = SORT_DSO_TO;
  451. else if (!strcmp(sd->name, "mispredict"))
  452. sort__first_dimension = SORT_MISPREDICT;
  453. }
  454. list_add_tail(&sd->entry->list, &hist_entry__sort_list);
  455. sd->taken = 1;
  456. return 0;
  457. }
  458. return -ESRCH;
  459. }
  460. void setup_sorting(const char * const usagestr[], const struct option *opts)
  461. {
  462. char *tmp, *tok, *str = strdup(sort_order);
  463. for (tok = strtok_r(str, ", ", &tmp);
  464. tok; tok = strtok_r(NULL, ", ", &tmp)) {
  465. if (sort_dimension__add(tok) < 0) {
  466. error("Unknown --sort key: `%s'", tok);
  467. usage_with_options(usagestr, opts);
  468. }
  469. }
  470. free(str);
  471. }
  472. void sort_entry__setup_elide(struct sort_entry *self, struct strlist *list,
  473. const char *list_name, FILE *fp)
  474. {
  475. if (list && strlist__nr_entries(list) == 1) {
  476. if (fp != NULL)
  477. fprintf(fp, "# %s: %s\n", list_name,
  478. strlist__entry(list, 0)->s);
  479. self->elide = true;
  480. }
  481. }