sort.c 14 KB

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