sort.c 14 KB

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