sort.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290
  1. #include "sort.h"
  2. regex_t parent_regex;
  3. char default_parent_pattern[] = "^sys_|^do_page_fault";
  4. char *parent_pattern = default_parent_pattern;
  5. char default_sort_order[] = "comm,dso,symbol";
  6. char *sort_order = default_sort_order;
  7. int sort__need_collapse = 0;
  8. int sort__has_parent = 0;
  9. enum sort_type sort__first_dimension;
  10. unsigned int dsos__col_width;
  11. unsigned int comms__col_width;
  12. unsigned int threads__col_width;
  13. static unsigned int parent_symbol__col_width;
  14. char * field_sep;
  15. LIST_HEAD(hist_entry__sort_list);
  16. struct sort_entry sort_thread = {
  17. .header = "Command: Pid",
  18. .cmp = sort__thread_cmp,
  19. .print = sort__thread_print,
  20. .width = &threads__col_width,
  21. };
  22. struct sort_entry sort_comm = {
  23. .header = "Command",
  24. .cmp = sort__comm_cmp,
  25. .collapse = sort__comm_collapse,
  26. .print = sort__comm_print,
  27. .width = &comms__col_width,
  28. };
  29. struct sort_entry sort_dso = {
  30. .header = "Shared Object",
  31. .cmp = sort__dso_cmp,
  32. .print = sort__dso_print,
  33. .width = &dsos__col_width,
  34. };
  35. struct sort_entry sort_sym = {
  36. .header = "Symbol",
  37. .cmp = sort__sym_cmp,
  38. .print = sort__sym_print,
  39. };
  40. struct sort_entry sort_parent = {
  41. .header = "Parent symbol",
  42. .cmp = sort__parent_cmp,
  43. .print = sort__parent_print,
  44. .width = &parent_symbol__col_width,
  45. };
  46. struct sort_dimension {
  47. const char *name;
  48. struct sort_entry *entry;
  49. int taken;
  50. };
  51. static struct sort_dimension sort_dimensions[] = {
  52. { .name = "pid", .entry = &sort_thread, },
  53. { .name = "comm", .entry = &sort_comm, },
  54. { .name = "dso", .entry = &sort_dso, },
  55. { .name = "symbol", .entry = &sort_sym, },
  56. { .name = "parent", .entry = &sort_parent, },
  57. };
  58. int64_t cmp_null(void *l, void *r)
  59. {
  60. if (!l && !r)
  61. return 0;
  62. else if (!l)
  63. return -1;
  64. else
  65. return 1;
  66. }
  67. /* --sort pid */
  68. int64_t
  69. sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
  70. {
  71. return right->thread->pid - left->thread->pid;
  72. }
  73. int repsep_fprintf(FILE *fp, const char *fmt, ...)
  74. {
  75. int n;
  76. va_list ap;
  77. va_start(ap, fmt);
  78. if (!field_sep)
  79. n = vfprintf(fp, fmt, ap);
  80. else {
  81. char *bf = NULL;
  82. n = vasprintf(&bf, fmt, ap);
  83. if (n > 0) {
  84. char *sep = bf;
  85. while (1) {
  86. sep = strchr(sep, *field_sep);
  87. if (sep == NULL)
  88. break;
  89. *sep = '.';
  90. }
  91. }
  92. fputs(bf, fp);
  93. free(bf);
  94. }
  95. va_end(ap);
  96. return n;
  97. }
  98. size_t
  99. sort__thread_print(FILE *fp, struct hist_entry *self, unsigned int width)
  100. {
  101. return repsep_fprintf(fp, "%*s:%5d", width - 6,
  102. self->thread->comm ?: "", self->thread->pid);
  103. }
  104. size_t
  105. sort__comm_print(FILE *fp, struct hist_entry *self, unsigned int width)
  106. {
  107. return repsep_fprintf(fp, "%*s", width, self->thread->comm);
  108. }
  109. /* --sort dso */
  110. int64_t
  111. sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
  112. {
  113. struct dso *dso_l = left->map ? left->map->dso : NULL;
  114. struct dso *dso_r = right->map ? right->map->dso : NULL;
  115. const char *dso_name_l, *dso_name_r;
  116. if (!dso_l || !dso_r)
  117. return cmp_null(dso_l, dso_r);
  118. if (verbose) {
  119. dso_name_l = dso_l->long_name;
  120. dso_name_r = dso_r->long_name;
  121. } else {
  122. dso_name_l = dso_l->short_name;
  123. dso_name_r = dso_r->short_name;
  124. }
  125. return strcmp(dso_name_l, dso_name_r);
  126. }
  127. size_t
  128. sort__dso_print(FILE *fp, struct hist_entry *self, unsigned int width)
  129. {
  130. if (self->map && self->map->dso) {
  131. const char *dso_name = !verbose ? self->map->dso->short_name :
  132. self->map->dso->long_name;
  133. return repsep_fprintf(fp, "%-*s", width, dso_name);
  134. }
  135. return repsep_fprintf(fp, "%*llx", width, (u64)self->ip);
  136. }
  137. /* --sort symbol */
  138. int64_t
  139. sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
  140. {
  141. u64 ip_l, ip_r;
  142. if (left->sym == right->sym)
  143. return 0;
  144. ip_l = left->sym ? left->sym->start : left->ip;
  145. ip_r = right->sym ? right->sym->start : right->ip;
  146. return (int64_t)(ip_r - ip_l);
  147. }
  148. size_t
  149. sort__sym_print(FILE *fp, struct hist_entry *self, unsigned int width __used)
  150. {
  151. size_t ret = 0;
  152. if (verbose) {
  153. char o = self->map ? dso__symtab_origin(self->map->dso) : '!';
  154. ret += repsep_fprintf(fp, "%#018llx %c ", (u64)self->ip, o);
  155. }
  156. ret += repsep_fprintf(fp, "[%c] ", self->level);
  157. if (self->sym)
  158. ret += repsep_fprintf(fp, "%s", self->sym->name);
  159. else
  160. ret += repsep_fprintf(fp, "%#016llx", (u64)self->ip);
  161. return ret;
  162. }
  163. /* --sort comm */
  164. int64_t
  165. sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
  166. {
  167. return right->thread->pid - left->thread->pid;
  168. }
  169. int64_t
  170. sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
  171. {
  172. char *comm_l = left->thread->comm;
  173. char *comm_r = right->thread->comm;
  174. if (!comm_l || !comm_r)
  175. return cmp_null(comm_l, comm_r);
  176. return strcmp(comm_l, comm_r);
  177. }
  178. /* --sort parent */
  179. int64_t
  180. sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
  181. {
  182. struct symbol *sym_l = left->parent;
  183. struct symbol *sym_r = right->parent;
  184. if (!sym_l || !sym_r)
  185. return cmp_null(sym_l, sym_r);
  186. return strcmp(sym_l->name, sym_r->name);
  187. }
  188. size_t
  189. sort__parent_print(FILE *fp, struct hist_entry *self, unsigned int width)
  190. {
  191. return repsep_fprintf(fp, "%-*s", width,
  192. self->parent ? self->parent->name : "[other]");
  193. }
  194. int sort_dimension__add(const char *tok)
  195. {
  196. unsigned int i;
  197. for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
  198. struct sort_dimension *sd = &sort_dimensions[i];
  199. if (sd->taken)
  200. continue;
  201. if (strncasecmp(tok, sd->name, strlen(tok)))
  202. continue;
  203. if (sd->entry->collapse)
  204. sort__need_collapse = 1;
  205. if (sd->entry == &sort_parent) {
  206. int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
  207. if (ret) {
  208. char err[BUFSIZ];
  209. regerror(ret, &parent_regex, err, sizeof(err));
  210. fprintf(stderr, "Invalid regex: %s\n%s",
  211. parent_pattern, err);
  212. exit(-1);
  213. }
  214. sort__has_parent = 1;
  215. }
  216. if (list_empty(&hist_entry__sort_list)) {
  217. if (!strcmp(sd->name, "pid"))
  218. sort__first_dimension = SORT_PID;
  219. else if (!strcmp(sd->name, "comm"))
  220. sort__first_dimension = SORT_COMM;
  221. else if (!strcmp(sd->name, "dso"))
  222. sort__first_dimension = SORT_DSO;
  223. else if (!strcmp(sd->name, "symbol"))
  224. sort__first_dimension = SORT_SYM;
  225. else if (!strcmp(sd->name, "parent"))
  226. sort__first_dimension = SORT_PARENT;
  227. }
  228. list_add_tail(&sd->entry->list, &hist_entry__sort_list);
  229. sd->taken = 1;
  230. return 0;
  231. }
  232. return -ESRCH;
  233. }