perf annotate browser: Allow toggling the visualization of source code lines
[linux-2.6/linux-mips.git] / tools / perf / util / sort.c
blob1ee8f1e40f18528db9cb2d766fd572f36736f426
1 #include "sort.h"
2 #include "hist.h"
4 regex_t parent_regex;
5 const char default_parent_pattern[] = "^sys_|^do_page_fault";
6 const char *parent_pattern = default_parent_pattern;
7 const char default_sort_order[] = "comm,dso,symbol";
8 const char *sort_order = default_sort_order;
9 int sort__need_collapse = 0;
10 int sort__has_parent = 0;
12 enum sort_type sort__first_dimension;
14 char * field_sep;
16 LIST_HEAD(hist_entry__sort_list);
18 static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
20 int n;
21 va_list ap;
23 va_start(ap, fmt);
24 n = vsnprintf(bf, size, fmt, ap);
25 if (field_sep && n > 0) {
26 char *sep = bf;
28 while (1) {
29 sep = strchr(sep, *field_sep);
30 if (sep == NULL)
31 break;
32 *sep = '.';
35 va_end(ap);
36 return n;
39 static int64_t cmp_null(void *l, void *r)
41 if (!l && !r)
42 return 0;
43 else if (!l)
44 return -1;
45 else
46 return 1;
49 /* --sort pid */
51 static int64_t
52 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
54 return right->thread->pid - left->thread->pid;
57 static int hist_entry__thread_snprintf(struct hist_entry *self, char *bf,
58 size_t size, unsigned int width)
60 return repsep_snprintf(bf, size, "%*s:%5d", width,
61 self->thread->comm ?: "", self->thread->pid);
64 struct sort_entry sort_thread = {
65 .se_header = "Command: Pid",
66 .se_cmp = sort__thread_cmp,
67 .se_snprintf = hist_entry__thread_snprintf,
68 .se_width_idx = HISTC_THREAD,
71 /* --sort comm */
73 static int64_t
74 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
76 return right->thread->pid - left->thread->pid;
79 static int64_t
80 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
82 char *comm_l = left->thread->comm;
83 char *comm_r = right->thread->comm;
85 if (!comm_l || !comm_r)
86 return cmp_null(comm_l, comm_r);
88 return strcmp(comm_l, comm_r);
91 static int hist_entry__comm_snprintf(struct hist_entry *self, char *bf,
92 size_t size, unsigned int width)
94 return repsep_snprintf(bf, size, "%*s", width, self->thread->comm);
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,
105 /* --sort dso */
107 static int64_t
108 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
110 struct dso *dso_l = left->ms.map ? left->ms.map->dso : NULL;
111 struct dso *dso_r = right->ms.map ? right->ms.map->dso : NULL;
112 const char *dso_name_l, *dso_name_r;
114 if (!dso_l || !dso_r)
115 return cmp_null(dso_l, dso_r);
117 if (verbose) {
118 dso_name_l = dso_l->long_name;
119 dso_name_r = dso_r->long_name;
120 } else {
121 dso_name_l = dso_l->short_name;
122 dso_name_r = dso_r->short_name;
125 return strcmp(dso_name_l, dso_name_r);
128 static int hist_entry__dso_snprintf(struct hist_entry *self, char *bf,
129 size_t size, unsigned int width)
131 if (self->ms.map && self->ms.map->dso) {
132 const char *dso_name = !verbose ? self->ms.map->dso->short_name :
133 self->ms.map->dso->long_name;
134 return repsep_snprintf(bf, size, "%-*s", width, dso_name);
137 return repsep_snprintf(bf, size, "%-*s", width, "[unknown]");
140 struct sort_entry sort_dso = {
141 .se_header = "Shared Object",
142 .se_cmp = sort__dso_cmp,
143 .se_snprintf = hist_entry__dso_snprintf,
144 .se_width_idx = HISTC_DSO,
147 /* --sort symbol */
149 static int64_t
150 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
152 u64 ip_l, ip_r;
154 if (!left->ms.sym && !right->ms.sym)
155 return right->level - left->level;
157 if (!left->ms.sym || !right->ms.sym)
158 return cmp_null(left->ms.sym, right->ms.sym);
160 if (left->ms.sym == right->ms.sym)
161 return 0;
163 ip_l = left->ms.sym->start;
164 ip_r = right->ms.sym->start;
166 return (int64_t)(ip_r - ip_l);
169 static int hist_entry__sym_snprintf(struct hist_entry *self, char *bf,
170 size_t size, unsigned int width __used)
172 size_t ret = 0;
174 if (verbose) {
175 char o = self->ms.map ? dso__symtab_origin(self->ms.map->dso) : '!';
176 ret += repsep_snprintf(bf, size, "%-#*llx %c ",
177 BITS_PER_LONG / 4, self->ip, o);
180 ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", self->level);
181 if (self->ms.sym)
182 ret += repsep_snprintf(bf + ret, size - ret, "%s",
183 self->ms.sym->name);
184 else
185 ret += repsep_snprintf(bf + ret, size - ret, "%-#*llx",
186 BITS_PER_LONG / 4, self->ip);
188 return ret;
191 struct sort_entry sort_sym = {
192 .se_header = "Symbol",
193 .se_cmp = sort__sym_cmp,
194 .se_snprintf = hist_entry__sym_snprintf,
195 .se_width_idx = HISTC_SYMBOL,
198 /* --sort parent */
200 static int64_t
201 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
203 struct symbol *sym_l = left->parent;
204 struct symbol *sym_r = right->parent;
206 if (!sym_l || !sym_r)
207 return cmp_null(sym_l, sym_r);
209 return strcmp(sym_l->name, sym_r->name);
212 static int hist_entry__parent_snprintf(struct hist_entry *self, char *bf,
213 size_t size, unsigned int width)
215 return repsep_snprintf(bf, size, "%-*s", width,
216 self->parent ? self->parent->name : "[other]");
219 struct sort_entry sort_parent = {
220 .se_header = "Parent symbol",
221 .se_cmp = sort__parent_cmp,
222 .se_snprintf = hist_entry__parent_snprintf,
223 .se_width_idx = HISTC_PARENT,
226 /* --sort cpu */
228 static int64_t
229 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
231 return right->cpu - left->cpu;
234 static int hist_entry__cpu_snprintf(struct hist_entry *self, char *bf,
235 size_t size, unsigned int width)
237 return repsep_snprintf(bf, size, "%-*d", width, self->cpu);
240 struct sort_entry sort_cpu = {
241 .se_header = "CPU",
242 .se_cmp = sort__cpu_cmp,
243 .se_snprintf = hist_entry__cpu_snprintf,
244 .se_width_idx = HISTC_CPU,
247 struct sort_dimension {
248 const char *name;
249 struct sort_entry *entry;
250 int taken;
253 static struct sort_dimension sort_dimensions[] = {
254 { .name = "pid", .entry = &sort_thread, },
255 { .name = "comm", .entry = &sort_comm, },
256 { .name = "dso", .entry = &sort_dso, },
257 { .name = "symbol", .entry = &sort_sym, },
258 { .name = "parent", .entry = &sort_parent, },
259 { .name = "cpu", .entry = &sort_cpu, },
262 int sort_dimension__add(const char *tok)
264 unsigned int i;
266 for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
267 struct sort_dimension *sd = &sort_dimensions[i];
269 if (strncasecmp(tok, sd->name, strlen(tok)))
270 continue;
272 if (sd->entry == &sort_parent) {
273 int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
274 if (ret) {
275 char err[BUFSIZ];
277 regerror(ret, &parent_regex, err, sizeof(err));
278 pr_err("Invalid regex: %s\n%s", parent_pattern, err);
279 return -EINVAL;
281 sort__has_parent = 1;
284 if (sd->taken)
285 return 0;
287 if (sd->entry->se_collapse)
288 sort__need_collapse = 1;
290 if (list_empty(&hist_entry__sort_list)) {
291 if (!strcmp(sd->name, "pid"))
292 sort__first_dimension = SORT_PID;
293 else if (!strcmp(sd->name, "comm"))
294 sort__first_dimension = SORT_COMM;
295 else if (!strcmp(sd->name, "dso"))
296 sort__first_dimension = SORT_DSO;
297 else if (!strcmp(sd->name, "symbol"))
298 sort__first_dimension = SORT_SYM;
299 else if (!strcmp(sd->name, "parent"))
300 sort__first_dimension = SORT_PARENT;
301 else if (!strcmp(sd->name, "cpu"))
302 sort__first_dimension = SORT_CPU;
305 list_add_tail(&sd->entry->list, &hist_entry__sort_list);
306 sd->taken = 1;
308 return 0;
311 return -ESRCH;
314 void setup_sorting(const char * const usagestr[], const struct option *opts)
316 char *tmp, *tok, *str = strdup(sort_order);
318 for (tok = strtok_r(str, ", ", &tmp);
319 tok; tok = strtok_r(NULL, ", ", &tmp)) {
320 if (sort_dimension__add(tok) < 0) {
321 error("Unknown --sort key: `%s'", tok);
322 usage_with_options(usagestr, opts);
326 free(str);
329 void sort_entry__setup_elide(struct sort_entry *self, struct strlist *list,
330 const char *list_name, FILE *fp)
332 if (list && strlist__nr_entries(list) == 1) {
333 if (fp != NULL)
334 fprintf(fp, "# %s: %s\n", list_name,
335 strlist__entry(list, 0)->s);
336 self->elide = true;