diff options
Diffstat (limited to 'tools/perf/builtin-report.c')
-rw-r--r-- | tools/perf/builtin-report.c | 1147 |
1 files changed, 199 insertions, 948 deletions
diff --git a/tools/perf/builtin-report.c b/tools/perf/builtin-report.c index 19669c20088e..383c4ab4f9af 100644 --- a/tools/perf/builtin-report.c +++ b/tools/perf/builtin-report.c | |||
@@ -26,20 +26,18 @@ | |||
26 | #include "util/parse-options.h" | 26 | #include "util/parse-options.h" |
27 | #include "util/parse-events.h" | 27 | #include "util/parse-events.h" |
28 | 28 | ||
29 | #include "util/data_map.h" | ||
29 | #include "util/thread.h" | 30 | #include "util/thread.h" |
31 | #include "util/sort.h" | ||
32 | #include "util/hist.h" | ||
30 | 33 | ||
31 | static char const *input_name = "perf.data"; | 34 | static char const *input_name = "perf.data"; |
32 | 35 | ||
33 | static char default_sort_order[] = "comm,dso,symbol"; | ||
34 | static char *sort_order = default_sort_order; | ||
35 | static char *dso_list_str, *comm_list_str, *sym_list_str, | 36 | static char *dso_list_str, *comm_list_str, *sym_list_str, |
36 | *col_width_list_str; | 37 | *col_width_list_str; |
37 | static struct strlist *dso_list, *comm_list, *sym_list; | 38 | static struct strlist *dso_list, *comm_list, *sym_list; |
38 | static char *field_sep; | ||
39 | 39 | ||
40 | static int force; | 40 | static int force; |
41 | static int input; | ||
42 | static int show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV; | ||
43 | 41 | ||
44 | static int full_paths; | 42 | static int full_paths; |
45 | static int show_nr_samples; | 43 | static int show_nr_samples; |
@@ -50,374 +48,38 @@ static struct perf_read_values show_threads_values; | |||
50 | static char default_pretty_printing_style[] = "normal"; | 48 | static char default_pretty_printing_style[] = "normal"; |
51 | static char *pretty_printing_style = default_pretty_printing_style; | 49 | static char *pretty_printing_style = default_pretty_printing_style; |
52 | 50 | ||
53 | static unsigned long page_size; | ||
54 | static unsigned long mmap_window = 32; | ||
55 | |||
56 | static char default_parent_pattern[] = "^sys_|^do_page_fault"; | ||
57 | static char *parent_pattern = default_parent_pattern; | ||
58 | static regex_t parent_regex; | ||
59 | |||
60 | static int exclude_other = 1; | 51 | static int exclude_other = 1; |
61 | 52 | ||
62 | static char callchain_default_opt[] = "fractal,0.5"; | 53 | static char callchain_default_opt[] = "fractal,0.5"; |
63 | 54 | ||
64 | static int callchain; | ||
65 | |||
66 | static char __cwd[PATH_MAX]; | ||
67 | static char *cwd = __cwd; | ||
68 | static int cwdlen; | ||
69 | |||
70 | static struct rb_root threads; | ||
71 | static struct thread *last_match; | ||
72 | |||
73 | static struct perf_header *header; | 55 | static struct perf_header *header; |
74 | 56 | ||
75 | static | ||
76 | struct callchain_param callchain_param = { | ||
77 | .mode = CHAIN_GRAPH_REL, | ||
78 | .min_percent = 0.5 | ||
79 | }; | ||
80 | |||
81 | static u64 sample_type; | 57 | static u64 sample_type; |
82 | 58 | ||
83 | static int repsep_fprintf(FILE *fp, const char *fmt, ...) | 59 | struct symbol_conf symbol_conf; |
84 | { | ||
85 | int n; | ||
86 | va_list ap; | ||
87 | |||
88 | va_start(ap, fmt); | ||
89 | if (!field_sep) | ||
90 | n = vfprintf(fp, fmt, ap); | ||
91 | else { | ||
92 | char *bf = NULL; | ||
93 | n = vasprintf(&bf, fmt, ap); | ||
94 | if (n > 0) { | ||
95 | char *sep = bf; | ||
96 | |||
97 | while (1) { | ||
98 | sep = strchr(sep, *field_sep); | ||
99 | if (sep == NULL) | ||
100 | break; | ||
101 | *sep = '.'; | ||
102 | } | ||
103 | } | ||
104 | fputs(bf, fp); | ||
105 | free(bf); | ||
106 | } | ||
107 | va_end(ap); | ||
108 | return n; | ||
109 | } | ||
110 | |||
111 | static unsigned int dsos__col_width, | ||
112 | comms__col_width, | ||
113 | threads__col_width; | ||
114 | 60 | ||
115 | /* | ||
116 | * histogram, sorted on item, collects counts | ||
117 | */ | ||
118 | |||
119 | static struct rb_root hist; | ||
120 | |||
121 | struct hist_entry { | ||
122 | struct rb_node rb_node; | ||
123 | |||
124 | struct thread *thread; | ||
125 | struct map *map; | ||
126 | struct dso *dso; | ||
127 | struct symbol *sym; | ||
128 | struct symbol *parent; | ||
129 | u64 ip; | ||
130 | char level; | ||
131 | struct callchain_node callchain; | ||
132 | struct rb_root sorted_chain; | ||
133 | |||
134 | u64 count; | ||
135 | }; | ||
136 | |||
137 | /* | ||
138 | * configurable sorting bits | ||
139 | */ | ||
140 | |||
141 | struct sort_entry { | ||
142 | struct list_head list; | ||
143 | |||
144 | const char *header; | ||
145 | |||
146 | int64_t (*cmp)(struct hist_entry *, struct hist_entry *); | ||
147 | int64_t (*collapse)(struct hist_entry *, struct hist_entry *); | ||
148 | size_t (*print)(FILE *fp, struct hist_entry *, unsigned int width); | ||
149 | unsigned int *width; | ||
150 | bool elide; | ||
151 | }; | ||
152 | |||
153 | static int64_t cmp_null(void *l, void *r) | ||
154 | { | ||
155 | if (!l && !r) | ||
156 | return 0; | ||
157 | else if (!l) | ||
158 | return -1; | ||
159 | else | ||
160 | return 1; | ||
161 | } | ||
162 | |||
163 | /* --sort pid */ | ||
164 | |||
165 | static int64_t | ||
166 | sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) | ||
167 | { | ||
168 | return right->thread->pid - left->thread->pid; | ||
169 | } | ||
170 | 61 | ||
171 | static size_t | 62 | static size_t |
172 | sort__thread_print(FILE *fp, struct hist_entry *self, unsigned int width) | 63 | callchain__fprintf_left_margin(FILE *fp, int left_margin) |
173 | { | 64 | { |
174 | return repsep_fprintf(fp, "%*s:%5d", width - 6, | 65 | int i; |
175 | self->thread->comm ?: "", self->thread->pid); | 66 | int ret; |
176 | } | ||
177 | |||
178 | static struct sort_entry sort_thread = { | ||
179 | .header = "Command: Pid", | ||
180 | .cmp = sort__thread_cmp, | ||
181 | .print = sort__thread_print, | ||
182 | .width = &threads__col_width, | ||
183 | }; | ||
184 | |||
185 | /* --sort comm */ | ||
186 | |||
187 | static int64_t | ||
188 | sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) | ||
189 | { | ||
190 | return right->thread->pid - left->thread->pid; | ||
191 | } | ||
192 | |||
193 | static int64_t | ||
194 | sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) | ||
195 | { | ||
196 | char *comm_l = left->thread->comm; | ||
197 | char *comm_r = right->thread->comm; | ||
198 | |||
199 | if (!comm_l || !comm_r) | ||
200 | return cmp_null(comm_l, comm_r); | ||
201 | |||
202 | return strcmp(comm_l, comm_r); | ||
203 | } | ||
204 | |||
205 | static size_t | ||
206 | sort__comm_print(FILE *fp, struct hist_entry *self, unsigned int width) | ||
207 | { | ||
208 | return repsep_fprintf(fp, "%*s", width, self->thread->comm); | ||
209 | } | ||
210 | |||
211 | static struct sort_entry sort_comm = { | ||
212 | .header = "Command", | ||
213 | .cmp = sort__comm_cmp, | ||
214 | .collapse = sort__comm_collapse, | ||
215 | .print = sort__comm_print, | ||
216 | .width = &comms__col_width, | ||
217 | }; | ||
218 | |||
219 | /* --sort dso */ | ||
220 | |||
221 | static int64_t | ||
222 | sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) | ||
223 | { | ||
224 | struct dso *dso_l = left->dso; | ||
225 | struct dso *dso_r = right->dso; | ||
226 | |||
227 | if (!dso_l || !dso_r) | ||
228 | return cmp_null(dso_l, dso_r); | ||
229 | |||
230 | return strcmp(dso_l->name, dso_r->name); | ||
231 | } | ||
232 | |||
233 | static size_t | ||
234 | sort__dso_print(FILE *fp, struct hist_entry *self, unsigned int width) | ||
235 | { | ||
236 | if (self->dso) | ||
237 | return repsep_fprintf(fp, "%-*s", width, self->dso->name); | ||
238 | |||
239 | return repsep_fprintf(fp, "%*llx", width, (u64)self->ip); | ||
240 | } | ||
241 | |||
242 | static struct sort_entry sort_dso = { | ||
243 | .header = "Shared Object", | ||
244 | .cmp = sort__dso_cmp, | ||
245 | .print = sort__dso_print, | ||
246 | .width = &dsos__col_width, | ||
247 | }; | ||
248 | |||
249 | /* --sort symbol */ | ||
250 | |||
251 | static int64_t | ||
252 | sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) | ||
253 | { | ||
254 | u64 ip_l, ip_r; | ||
255 | |||
256 | if (left->sym == right->sym) | ||
257 | return 0; | ||
258 | |||
259 | ip_l = left->sym ? left->sym->start : left->ip; | ||
260 | ip_r = right->sym ? right->sym->start : right->ip; | ||
261 | |||
262 | return (int64_t)(ip_r - ip_l); | ||
263 | } | ||
264 | |||
265 | static size_t | ||
266 | sort__sym_print(FILE *fp, struct hist_entry *self, unsigned int width __used) | ||
267 | { | ||
268 | size_t ret = 0; | ||
269 | 67 | ||
270 | if (verbose) | 68 | ret = fprintf(fp, " "); |
271 | ret += repsep_fprintf(fp, "%#018llx %c ", (u64)self->ip, | ||
272 | dso__symtab_origin(self->dso)); | ||
273 | 69 | ||
274 | ret += repsep_fprintf(fp, "[%c] ", self->level); | 70 | for (i = 0; i < left_margin; i++) |
275 | if (self->sym) { | 71 | ret += fprintf(fp, " "); |
276 | ret += repsep_fprintf(fp, "%s", self->sym->name); | ||
277 | |||
278 | if (self->sym->module) | ||
279 | ret += repsep_fprintf(fp, "\t[%s]", | ||
280 | self->sym->module->name); | ||
281 | } else { | ||
282 | ret += repsep_fprintf(fp, "%#016llx", (u64)self->ip); | ||
283 | } | ||
284 | 72 | ||
285 | return ret; | 73 | return ret; |
286 | } | 74 | } |
287 | 75 | ||
288 | static struct sort_entry sort_sym = { | 76 | static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask, |
289 | .header = "Symbol", | 77 | int left_margin) |
290 | .cmp = sort__sym_cmp, | ||
291 | .print = sort__sym_print, | ||
292 | }; | ||
293 | |||
294 | /* --sort parent */ | ||
295 | |||
296 | static int64_t | ||
297 | sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) | ||
298 | { | ||
299 | struct symbol *sym_l = left->parent; | ||
300 | struct symbol *sym_r = right->parent; | ||
301 | |||
302 | if (!sym_l || !sym_r) | ||
303 | return cmp_null(sym_l, sym_r); | ||
304 | |||
305 | return strcmp(sym_l->name, sym_r->name); | ||
306 | } | ||
307 | |||
308 | static size_t | ||
309 | sort__parent_print(FILE *fp, struct hist_entry *self, unsigned int width) | ||
310 | { | ||
311 | return repsep_fprintf(fp, "%-*s", width, | ||
312 | self->parent ? self->parent->name : "[other]"); | ||
313 | } | ||
314 | |||
315 | static unsigned int parent_symbol__col_width; | ||
316 | |||
317 | static struct sort_entry sort_parent = { | ||
318 | .header = "Parent symbol", | ||
319 | .cmp = sort__parent_cmp, | ||
320 | .print = sort__parent_print, | ||
321 | .width = &parent_symbol__col_width, | ||
322 | }; | ||
323 | |||
324 | static int sort__need_collapse = 0; | ||
325 | static int sort__has_parent = 0; | ||
326 | |||
327 | struct sort_dimension { | ||
328 | const char *name; | ||
329 | struct sort_entry *entry; | ||
330 | int taken; | ||
331 | }; | ||
332 | |||
333 | static struct sort_dimension sort_dimensions[] = { | ||
334 | { .name = "pid", .entry = &sort_thread, }, | ||
335 | { .name = "comm", .entry = &sort_comm, }, | ||
336 | { .name = "dso", .entry = &sort_dso, }, | ||
337 | { .name = "symbol", .entry = &sort_sym, }, | ||
338 | { .name = "parent", .entry = &sort_parent, }, | ||
339 | }; | ||
340 | |||
341 | static LIST_HEAD(hist_entry__sort_list); | ||
342 | |||
343 | static int sort_dimension__add(const char *tok) | ||
344 | { | ||
345 | unsigned int i; | ||
346 | |||
347 | for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) { | ||
348 | struct sort_dimension *sd = &sort_dimensions[i]; | ||
349 | |||
350 | if (sd->taken) | ||
351 | continue; | ||
352 | |||
353 | if (strncasecmp(tok, sd->name, strlen(tok))) | ||
354 | continue; | ||
355 | |||
356 | if (sd->entry->collapse) | ||
357 | sort__need_collapse = 1; | ||
358 | |||
359 | if (sd->entry == &sort_parent) { | ||
360 | int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED); | ||
361 | if (ret) { | ||
362 | char err[BUFSIZ]; | ||
363 | |||
364 | regerror(ret, &parent_regex, err, sizeof(err)); | ||
365 | fprintf(stderr, "Invalid regex: %s\n%s", | ||
366 | parent_pattern, err); | ||
367 | exit(-1); | ||
368 | } | ||
369 | sort__has_parent = 1; | ||
370 | } | ||
371 | |||
372 | list_add_tail(&sd->entry->list, &hist_entry__sort_list); | ||
373 | sd->taken = 1; | ||
374 | |||
375 | return 0; | ||
376 | } | ||
377 | |||
378 | return -ESRCH; | ||
379 | } | ||
380 | |||
381 | static int64_t | ||
382 | hist_entry__cmp(struct hist_entry *left, struct hist_entry *right) | ||
383 | { | ||
384 | struct sort_entry *se; | ||
385 | int64_t cmp = 0; | ||
386 | |||
387 | list_for_each_entry(se, &hist_entry__sort_list, list) { | ||
388 | cmp = se->cmp(left, right); | ||
389 | if (cmp) | ||
390 | break; | ||
391 | } | ||
392 | |||
393 | return cmp; | ||
394 | } | ||
395 | |||
396 | static int64_t | ||
397 | hist_entry__collapse(struct hist_entry *left, struct hist_entry *right) | ||
398 | { | ||
399 | struct sort_entry *se; | ||
400 | int64_t cmp = 0; | ||
401 | |||
402 | list_for_each_entry(se, &hist_entry__sort_list, list) { | ||
403 | int64_t (*f)(struct hist_entry *, struct hist_entry *); | ||
404 | |||
405 | f = se->collapse ?: se->cmp; | ||
406 | |||
407 | cmp = f(left, right); | ||
408 | if (cmp) | ||
409 | break; | ||
410 | } | ||
411 | |||
412 | return cmp; | ||
413 | } | ||
414 | |||
415 | static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask) | ||
416 | { | 78 | { |
417 | int i; | 79 | int i; |
418 | size_t ret = 0; | 80 | size_t ret = 0; |
419 | 81 | ||
420 | ret += fprintf(fp, "%s", " "); | 82 | ret += callchain__fprintf_left_margin(fp, left_margin); |
421 | 83 | ||
422 | for (i = 0; i < depth; i++) | 84 | for (i = 0; i < depth; i++) |
423 | if (depth_mask & (1 << i)) | 85 | if (depth_mask & (1 << i)) |
@@ -432,12 +94,12 @@ static size_t ipchain__fprintf_graph_line(FILE *fp, int depth, int depth_mask) | |||
432 | static size_t | 94 | static size_t |
433 | ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth, | 95 | ipchain__fprintf_graph(FILE *fp, struct callchain_list *chain, int depth, |
434 | int depth_mask, int count, u64 total_samples, | 96 | int depth_mask, int count, u64 total_samples, |
435 | int hits) | 97 | int hits, int left_margin) |
436 | { | 98 | { |
437 | int i; | 99 | int i; |
438 | size_t ret = 0; | 100 | size_t ret = 0; |
439 | 101 | ||
440 | ret += fprintf(fp, "%s", " "); | 102 | ret += callchain__fprintf_left_margin(fp, left_margin); |
441 | for (i = 0; i < depth; i++) { | 103 | for (i = 0; i < depth; i++) { |
442 | if (depth_mask & (1 << i)) | 104 | if (depth_mask & (1 << i)) |
443 | ret += fprintf(fp, "|"); | 105 | ret += fprintf(fp, "|"); |
@@ -475,8 +137,9 @@ static void init_rem_hits(void) | |||
475 | } | 137 | } |
476 | 138 | ||
477 | static size_t | 139 | static size_t |
478 | callchain__fprintf_graph(FILE *fp, struct callchain_node *self, | 140 | __callchain__fprintf_graph(FILE *fp, struct callchain_node *self, |
479 | u64 total_samples, int depth, int depth_mask) | 141 | u64 total_samples, int depth, int depth_mask, |
142 | int left_margin) | ||
480 | { | 143 | { |
481 | struct rb_node *node, *next; | 144 | struct rb_node *node, *next; |
482 | struct callchain_node *child; | 145 | struct callchain_node *child; |
@@ -517,7 +180,8 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self, | |||
517 | * But we keep the older depth mask for the line seperator | 180 | * But we keep the older depth mask for the line seperator |
518 | * to keep the level link until we reach the last child | 181 | * to keep the level link until we reach the last child |
519 | */ | 182 | */ |
520 | ret += ipchain__fprintf_graph_line(fp, depth, depth_mask); | 183 | ret += ipchain__fprintf_graph_line(fp, depth, depth_mask, |
184 | left_margin); | ||
521 | i = 0; | 185 | i = 0; |
522 | list_for_each_entry(chain, &child->val, list) { | 186 | list_for_each_entry(chain, &child->val, list) { |
523 | if (chain->ip >= PERF_CONTEXT_MAX) | 187 | if (chain->ip >= PERF_CONTEXT_MAX) |
@@ -525,11 +189,13 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self, | |||
525 | ret += ipchain__fprintf_graph(fp, chain, depth, | 189 | ret += ipchain__fprintf_graph(fp, chain, depth, |
526 | new_depth_mask, i++, | 190 | new_depth_mask, i++, |
527 | new_total, | 191 | new_total, |
528 | cumul); | 192 | cumul, |
193 | left_margin); | ||
529 | } | 194 | } |
530 | ret += callchain__fprintf_graph(fp, child, new_total, | 195 | ret += __callchain__fprintf_graph(fp, child, new_total, |
531 | depth + 1, | 196 | depth + 1, |
532 | new_depth_mask | (1 << depth)); | 197 | new_depth_mask | (1 << depth), |
198 | left_margin); | ||
533 | node = next; | 199 | node = next; |
534 | } | 200 | } |
535 | 201 | ||
@@ -543,9 +209,48 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self, | |||
543 | 209 | ||
544 | ret += ipchain__fprintf_graph(fp, &rem_hits, depth, | 210 | ret += ipchain__fprintf_graph(fp, &rem_hits, depth, |
545 | new_depth_mask, 0, new_total, | 211 | new_depth_mask, 0, new_total, |
546 | remaining); | 212 | remaining, left_margin); |
213 | } | ||
214 | |||
215 | return ret; | ||
216 | } | ||
217 | |||
218 | |||
219 | static size_t | ||
220 | callchain__fprintf_graph(FILE *fp, struct callchain_node *self, | ||
221 | u64 total_samples, int left_margin) | ||
222 | { | ||
223 | struct callchain_list *chain; | ||
224 | bool printed = false; | ||
225 | int i = 0; | ||
226 | int ret = 0; | ||
227 | |||
228 | list_for_each_entry(chain, &self->val, list) { | ||
229 | if (chain->ip >= PERF_CONTEXT_MAX) | ||
230 | continue; | ||
231 | |||
232 | if (!i++ && sort__first_dimension == SORT_SYM) | ||
233 | continue; | ||
234 | |||
235 | if (!printed) { | ||
236 | ret += callchain__fprintf_left_margin(fp, left_margin); | ||
237 | ret += fprintf(fp, "|\n"); | ||
238 | ret += callchain__fprintf_left_margin(fp, left_margin); | ||
239 | ret += fprintf(fp, "---"); | ||
240 | |||
241 | left_margin += 3; | ||
242 | printed = true; | ||
243 | } else | ||
244 | ret += callchain__fprintf_left_margin(fp, left_margin); | ||
245 | |||
246 | if (chain->sym) | ||
247 | ret += fprintf(fp, " %s\n", chain->sym->name); | ||
248 | else | ||
249 | ret += fprintf(fp, " %p\n", (void *)(long)chain->ip); | ||
547 | } | 250 | } |
548 | 251 | ||
252 | ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1, left_margin); | ||
253 | |||
549 | return ret; | 254 | return ret; |
550 | } | 255 | } |
551 | 256 | ||
@@ -577,7 +282,7 @@ callchain__fprintf_flat(FILE *fp, struct callchain_node *self, | |||
577 | 282 | ||
578 | static size_t | 283 | static size_t |
579 | hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self, | 284 | hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self, |
580 | u64 total_samples) | 285 | u64 total_samples, int left_margin) |
581 | { | 286 | { |
582 | struct rb_node *rb_node; | 287 | struct rb_node *rb_node; |
583 | struct callchain_node *chain; | 288 | struct callchain_node *chain; |
@@ -597,8 +302,8 @@ hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self, | |||
597 | break; | 302 | break; |
598 | case CHAIN_GRAPH_ABS: /* Falldown */ | 303 | case CHAIN_GRAPH_ABS: /* Falldown */ |
599 | case CHAIN_GRAPH_REL: | 304 | case CHAIN_GRAPH_REL: |
600 | ret += callchain__fprintf_graph(fp, chain, | 305 | ret += callchain__fprintf_graph(fp, chain, total_samples, |
601 | total_samples, 1, 1); | 306 | left_margin); |
602 | case CHAIN_NONE: | 307 | case CHAIN_NONE: |
603 | default: | 308 | default: |
604 | break; | 309 | break; |
@@ -610,7 +315,6 @@ hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self, | |||
610 | return ret; | 315 | return ret; |
611 | } | 316 | } |
612 | 317 | ||
613 | |||
614 | static size_t | 318 | static size_t |
615 | hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples) | 319 | hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples) |
616 | { | 320 | { |
@@ -644,8 +348,19 @@ hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples) | |||
644 | 348 | ||
645 | ret += fprintf(fp, "\n"); | 349 | ret += fprintf(fp, "\n"); |
646 | 350 | ||
647 | if (callchain) | 351 | if (callchain) { |
648 | hist_entry_callchain__fprintf(fp, self, total_samples); | 352 | int left_margin = 0; |
353 | |||
354 | if (sort__first_dimension == SORT_COMM) { | ||
355 | se = list_first_entry(&hist_entry__sort_list, typeof(*se), | ||
356 | list); | ||
357 | left_margin = se->width ? *se->width : 0; | ||
358 | left_margin -= thread__comm_len(self->thread); | ||
359 | } | ||
360 | |||
361 | hist_entry_callchain__fprintf(fp, self, total_samples, | ||
362 | left_margin); | ||
363 | } | ||
649 | 364 | ||
650 | return ret; | 365 | return ret; |
651 | } | 366 | } |
@@ -693,63 +408,6 @@ static int thread__set_comm_adjust(struct thread *self, const char *comm) | |||
693 | return 0; | 408 | return 0; |
694 | } | 409 | } |
695 | 410 | ||
696 | |||
697 | static struct symbol * | ||
698 | resolve_symbol(struct thread *thread, struct map **mapp, | ||
699 | struct dso **dsop, u64 *ipp) | ||
700 | { | ||
701 | struct dso *dso = dsop ? *dsop : NULL; | ||
702 | struct map *map = mapp ? *mapp : NULL; | ||
703 | u64 ip = *ipp; | ||
704 | |||
705 | if (!thread) | ||
706 | return NULL; | ||
707 | |||
708 | if (dso) | ||
709 | goto got_dso; | ||
710 | |||
711 | if (map) | ||
712 | goto got_map; | ||
713 | |||
714 | map = thread__find_map(thread, ip); | ||
715 | if (map != NULL) { | ||
716 | /* | ||
717 | * We have to do this here as we may have a dso | ||
718 | * with no symbol hit that has a name longer than | ||
719 | * the ones with symbols sampled. | ||
720 | */ | ||
721 | if (!sort_dso.elide && !map->dso->slen_calculated) | ||
722 | dso__calc_col_width(map->dso); | ||
723 | |||
724 | if (mapp) | ||
725 | *mapp = map; | ||
726 | got_map: | ||
727 | ip = map->map_ip(map, ip); | ||
728 | |||
729 | dso = map->dso; | ||
730 | } else { | ||
731 | /* | ||
732 | * If this is outside of all known maps, | ||
733 | * and is a negative address, try to look it | ||
734 | * up in the kernel dso, as it might be a | ||
735 | * vsyscall (which executes in user-mode): | ||
736 | */ | ||
737 | if ((long long)ip < 0) | ||
738 | dso = kernel_dso; | ||
739 | } | ||
740 | dump_printf(" ...... dso: %s\n", dso ? dso->name : "<not found>"); | ||
741 | dump_printf(" ...... map: %Lx -> %Lx\n", *ipp, ip); | ||
742 | *ipp = ip; | ||
743 | |||
744 | if (dsop) | ||
745 | *dsop = dso; | ||
746 | |||
747 | if (!dso) | ||
748 | return NULL; | ||
749 | got_dso: | ||
750 | return dso->find_symbol(dso, ip); | ||
751 | } | ||
752 | |||
753 | static int call__match(struct symbol *sym) | 411 | static int call__match(struct symbol *sym) |
754 | { | 412 | { |
755 | if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0)) | 413 | if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0)) |
@@ -758,11 +416,11 @@ static int call__match(struct symbol *sym) | |||
758 | return 0; | 416 | return 0; |
759 | } | 417 | } |
760 | 418 | ||
761 | static struct symbol ** | 419 | static struct symbol **resolve_callchain(struct thread *thread, |
762 | resolve_callchain(struct thread *thread, struct map *map __used, | 420 | struct ip_callchain *chain, |
763 | struct ip_callchain *chain, struct hist_entry *entry) | 421 | struct symbol **parent) |
764 | { | 422 | { |
765 | u64 context = PERF_CONTEXT_MAX; | 423 | u8 cpumode = PERF_RECORD_MISC_USER; |
766 | struct symbol **syms = NULL; | 424 | struct symbol **syms = NULL; |
767 | unsigned int i; | 425 | unsigned int i; |
768 | 426 | ||
@@ -776,34 +434,31 @@ resolve_callchain(struct thread *thread, struct map *map __used, | |||
776 | 434 | ||
777 | for (i = 0; i < chain->nr; i++) { | 435 | for (i = 0; i < chain->nr; i++) { |
778 | u64 ip = chain->ips[i]; | 436 | u64 ip = chain->ips[i]; |
779 | struct dso *dso = NULL; | 437 | struct addr_location al; |
780 | struct symbol *sym; | ||
781 | 438 | ||
782 | if (ip >= PERF_CONTEXT_MAX) { | 439 | if (ip >= PERF_CONTEXT_MAX) { |
783 | context = ip; | 440 | switch (ip) { |
441 | case PERF_CONTEXT_HV: | ||
442 | cpumode = PERF_RECORD_MISC_HYPERVISOR; break; | ||
443 | case PERF_CONTEXT_KERNEL: | ||
444 | cpumode = PERF_RECORD_MISC_KERNEL; break; | ||
445 | case PERF_CONTEXT_USER: | ||
446 | cpumode = PERF_RECORD_MISC_USER; break; | ||
447 | default: | ||
448 | break; | ||
449 | } | ||
784 | continue; | 450 | continue; |
785 | } | 451 | } |
786 | 452 | ||
787 | switch (context) { | 453 | thread__find_addr_location(thread, cpumode, MAP__FUNCTION, |
788 | case PERF_CONTEXT_HV: | 454 | ip, &al, NULL); |
789 | dso = hypervisor_dso; | 455 | if (al.sym != NULL) { |
790 | break; | 456 | if (sort__has_parent && !*parent && |
791 | case PERF_CONTEXT_KERNEL: | 457 | call__match(al.sym)) |
792 | dso = kernel_dso; | 458 | *parent = al.sym; |
793 | break; | ||
794 | default: | ||
795 | break; | ||
796 | } | ||
797 | |||
798 | sym = resolve_symbol(thread, NULL, &dso, &ip); | ||
799 | |||
800 | if (sym) { | ||
801 | if (sort__has_parent && call__match(sym) && | ||
802 | !entry->parent) | ||
803 | entry->parent = sym; | ||
804 | if (!callchain) | 459 | if (!callchain) |
805 | break; | 460 | break; |
806 | syms[i] = sym; | 461 | syms[i] = al.sym; |
807 | } | 462 | } |
808 | } | 463 | } |
809 | 464 | ||
@@ -814,178 +469,33 @@ resolve_callchain(struct thread *thread, struct map *map __used, | |||
814 | * collect histogram counts | 469 | * collect histogram counts |
815 | */ | 470 | */ |
816 | 471 | ||
817 | static int | 472 | static int hist_entry__add(struct addr_location *al, |
818 | hist_entry__add(struct thread *thread, struct map *map, struct dso *dso, | 473 | struct ip_callchain *chain, u64 count) |
819 | struct symbol *sym, u64 ip, struct ip_callchain *chain, | ||
820 | char level, u64 count) | ||
821 | { | 474 | { |
822 | struct rb_node **p = &hist.rb_node; | 475 | struct symbol **syms = NULL, *parent = NULL; |
823 | struct rb_node *parent = NULL; | 476 | bool hit; |
824 | struct hist_entry *he; | 477 | struct hist_entry *he; |
825 | struct symbol **syms = NULL; | ||
826 | struct hist_entry entry = { | ||
827 | .thread = thread, | ||
828 | .map = map, | ||
829 | .dso = dso, | ||
830 | .sym = sym, | ||
831 | .ip = ip, | ||
832 | .level = level, | ||
833 | .count = count, | ||
834 | .parent = NULL, | ||
835 | .sorted_chain = RB_ROOT | ||
836 | }; | ||
837 | int cmp; | ||
838 | 478 | ||
839 | if ((sort__has_parent || callchain) && chain) | 479 | if ((sort__has_parent || callchain) && chain) |
840 | syms = resolve_callchain(thread, map, chain, &entry); | 480 | syms = resolve_callchain(al->thread, chain, &parent); |
841 | 481 | ||
842 | while (*p != NULL) { | 482 | he = __hist_entry__add(al, parent, count, &hit); |
843 | parent = *p; | 483 | if (he == NULL) |
844 | he = rb_entry(parent, struct hist_entry, rb_node); | 484 | return -ENOMEM; |
845 | 485 | ||
846 | cmp = hist_entry__cmp(&entry, he); | 486 | if (hit) |
487 | he->count += count; | ||
847 | 488 | ||
848 | if (!cmp) { | ||
849 | he->count += count; | ||
850 | if (callchain) { | ||
851 | append_chain(&he->callchain, chain, syms); | ||
852 | free(syms); | ||
853 | } | ||
854 | return 0; | ||
855 | } | ||
856 | |||
857 | if (cmp < 0) | ||
858 | p = &(*p)->rb_left; | ||
859 | else | ||
860 | p = &(*p)->rb_right; | ||
861 | } | ||
862 | |||
863 | he = malloc(sizeof(*he)); | ||
864 | if (!he) | ||
865 | return -ENOMEM; | ||
866 | *he = entry; | ||
867 | if (callchain) { | 489 | if (callchain) { |
868 | callchain_init(&he->callchain); | 490 | if (!hit) |
491 | callchain_init(&he->callchain); | ||
869 | append_chain(&he->callchain, chain, syms); | 492 | append_chain(&he->callchain, chain, syms); |
870 | free(syms); | 493 | free(syms); |
871 | } | 494 | } |
872 | rb_link_node(&he->rb_node, parent, p); | ||
873 | rb_insert_color(&he->rb_node, &hist); | ||
874 | 495 | ||
875 | return 0; | 496 | return 0; |
876 | } | 497 | } |
877 | 498 | ||
878 | static void hist_entry__free(struct hist_entry *he) | ||
879 | { | ||
880 | free(he); | ||
881 | } | ||
882 | |||
883 | /* | ||
884 | * collapse the histogram | ||
885 | */ | ||
886 | |||
887 | static struct rb_root collapse_hists; | ||
888 | |||
889 | static void collapse__insert_entry(struct hist_entry *he) | ||
890 | { | ||
891 | struct rb_node **p = &collapse_hists.rb_node; | ||
892 | struct rb_node *parent = NULL; | ||
893 | struct hist_entry *iter; | ||
894 | int64_t cmp; | ||
895 | |||
896 | while (*p != NULL) { | ||
897 | parent = *p; | ||
898 | iter = rb_entry(parent, struct hist_entry, rb_node); | ||
899 | |||
900 | cmp = hist_entry__collapse(iter, he); | ||
901 | |||
902 | if (!cmp) { | ||
903 | iter->count += he->count; | ||
904 | hist_entry__free(he); | ||
905 | return; | ||
906 | } | ||
907 | |||
908 | if (cmp < 0) | ||
909 | p = &(*p)->rb_left; | ||
910 | else | ||
911 | p = &(*p)->rb_right; | ||
912 | } | ||
913 | |||
914 | rb_link_node(&he->rb_node, parent, p); | ||
915 | rb_insert_color(&he->rb_node, &collapse_hists); | ||
916 | } | ||
917 | |||
918 | static void collapse__resort(void) | ||
919 | { | ||
920 | struct rb_node *next; | ||
921 | struct hist_entry *n; | ||
922 | |||
923 | if (!sort__need_collapse) | ||
924 | return; | ||
925 | |||
926 | next = rb_first(&hist); | ||
927 | while (next) { | ||
928 | n = rb_entry(next, struct hist_entry, rb_node); | ||
929 | next = rb_next(&n->rb_node); | ||
930 | |||
931 | rb_erase(&n->rb_node, &hist); | ||
932 | collapse__insert_entry(n); | ||
933 | } | ||
934 | } | ||
935 | |||
936 | /* | ||
937 | * reverse the map, sort on count. | ||
938 | */ | ||
939 | |||
940 | static struct rb_root output_hists; | ||
941 | |||
942 | static void output__insert_entry(struct hist_entry *he, u64 min_callchain_hits) | ||
943 | { | ||
944 | struct rb_node **p = &output_hists.rb_node; | ||
945 | struct rb_node *parent = NULL; | ||
946 | struct hist_entry *iter; | ||
947 | |||
948 | if (callchain) | ||
949 | callchain_param.sort(&he->sorted_chain, &he->callchain, | ||
950 | min_callchain_hits, &callchain_param); | ||
951 | |||
952 | while (*p != NULL) { | ||
953 | parent = *p; | ||
954 | iter = rb_entry(parent, struct hist_entry, rb_node); | ||
955 | |||
956 | if (he->count > iter->count) | ||
957 | p = &(*p)->rb_left; | ||
958 | else | ||
959 | p = &(*p)->rb_right; | ||
960 | } | ||
961 | |||
962 | rb_link_node(&he->rb_node, parent, p); | ||
963 | rb_insert_color(&he->rb_node, &output_hists); | ||
964 | } | ||
965 | |||
966 | static void output__resort(u64 total_samples) | ||
967 | { | ||
968 | struct rb_node *next; | ||
969 | struct hist_entry *n; | ||
970 | struct rb_root *tree = &hist; | ||
971 | u64 min_callchain_hits; | ||
972 | |||
973 | min_callchain_hits = total_samples * (callchain_param.min_percent / 100); | ||
974 | |||
975 | if (sort__need_collapse) | ||
976 | tree = &collapse_hists; | ||
977 | |||
978 | next = rb_first(tree); | ||
979 | |||
980 | while (next) { | ||
981 | n = rb_entry(next, struct hist_entry, rb_node); | ||
982 | next = rb_next(&n->rb_node); | ||
983 | |||
984 | rb_erase(&n->rb_node, tree); | ||
985 | output__insert_entry(n, min_callchain_hits); | ||
986 | } | ||
987 | } | ||
988 | |||
989 | static size_t output__fprintf(FILE *fp, u64 total_samples) | 499 | static size_t output__fprintf(FILE *fp, u64 total_samples) |
990 | { | 500 | { |
991 | struct hist_entry *pos; | 501 | struct hist_entry *pos; |
@@ -1080,13 +590,6 @@ print_entries: | |||
1080 | return ret; | 590 | return ret; |
1081 | } | 591 | } |
1082 | 592 | ||
1083 | static unsigned long total = 0, | ||
1084 | total_mmap = 0, | ||
1085 | total_comm = 0, | ||
1086 | total_fork = 0, | ||
1087 | total_unknown = 0, | ||
1088 | total_lost = 0; | ||
1089 | |||
1090 | static int validate_chain(struct ip_callchain *chain, event_t *event) | 593 | static int validate_chain(struct ip_callchain *chain, event_t *event) |
1091 | { | 594 | { |
1092 | unsigned int chain_size; | 595 | unsigned int chain_size; |
@@ -1100,30 +603,22 @@ static int validate_chain(struct ip_callchain *chain, event_t *event) | |||
1100 | return 0; | 603 | return 0; |
1101 | } | 604 | } |
1102 | 605 | ||
1103 | static int | 606 | static int process_sample_event(event_t *event) |
1104 | process_sample_event(event_t *event, unsigned long offset, unsigned long head) | ||
1105 | { | 607 | { |
1106 | char level; | ||
1107 | int show = 0; | ||
1108 | struct dso *dso = NULL; | ||
1109 | struct thread *thread; | ||
1110 | u64 ip = event->ip.ip; | 608 | u64 ip = event->ip.ip; |
1111 | u64 period = 1; | 609 | u64 period = 1; |
1112 | struct map *map = NULL; | ||
1113 | void *more_data = event->ip.__more_data; | 610 | void *more_data = event->ip.__more_data; |
1114 | struct ip_callchain *chain = NULL; | 611 | struct ip_callchain *chain = NULL; |
1115 | int cpumode; | 612 | int cpumode; |
1116 | 613 | struct addr_location al; | |
1117 | thread = threads__findnew(event->ip.pid, &threads, &last_match); | 614 | struct thread *thread = threads__findnew(event->ip.pid); |
1118 | 615 | ||
1119 | if (sample_type & PERF_SAMPLE_PERIOD) { | 616 | if (sample_type & PERF_SAMPLE_PERIOD) { |
1120 | period = *(u64 *)more_data; | 617 | period = *(u64 *)more_data; |
1121 | more_data += sizeof(u64); | 618 | more_data += sizeof(u64); |
1122 | } | 619 | } |
1123 | 620 | ||
1124 | dump_printf("%p [%p]: PERF_RECORD_SAMPLE (IP, %d): %d/%d: %p period: %Ld\n", | 621 | dump_printf("(IP, %d): %d/%d: %p period: %Ld\n", |
1125 | (void *)(offset + head), | ||
1126 | (void *)(long)(event->header.size), | ||
1127 | event->header.misc, | 622 | event->header.misc, |
1128 | event->ip.pid, event->ip.tid, | 623 | event->ip.pid, event->ip.tid, |
1129 | (void *)(long)ip, | 624 | (void *)(long)ip, |
@@ -1137,7 +632,8 @@ process_sample_event(event_t *event, unsigned long offset, unsigned long head) | |||
1137 | dump_printf("... chain: nr:%Lu\n", chain->nr); | 632 | dump_printf("... chain: nr:%Lu\n", chain->nr); |
1138 | 633 | ||
1139 | if (validate_chain(chain, event) < 0) { | 634 | if (validate_chain(chain, event) < 0) { |
1140 | eprintf("call-chain problem with event, skipping it.\n"); | 635 | pr_debug("call-chain problem with event, " |
636 | "skipping it.\n"); | ||
1141 | return 0; | 637 | return 0; |
1142 | } | 638 | } |
1143 | 639 | ||
@@ -1147,163 +643,64 @@ process_sample_event(event_t *event, unsigned long offset, unsigned long head) | |||
1147 | } | 643 | } |
1148 | } | 644 | } |
1149 | 645 | ||
1150 | dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid); | ||
1151 | |||
1152 | if (thread == NULL) { | 646 | if (thread == NULL) { |
1153 | eprintf("problem processing %d event, skipping it.\n", | 647 | pr_debug("problem processing %d event, skipping it.\n", |
1154 | event->header.type); | 648 | event->header.type); |
1155 | return -1; | 649 | return -1; |
1156 | } | 650 | } |
1157 | 651 | ||
652 | dump_printf(" ... thread: %s:%d\n", thread->comm, thread->pid); | ||
653 | |||
1158 | if (comm_list && !strlist__has_entry(comm_list, thread->comm)) | 654 | if (comm_list && !strlist__has_entry(comm_list, thread->comm)) |
1159 | return 0; | 655 | return 0; |
1160 | 656 | ||
1161 | cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK; | 657 | cpumode = event->header.misc & PERF_RECORD_MISC_CPUMODE_MASK; |
1162 | 658 | ||
1163 | if (cpumode == PERF_RECORD_MISC_KERNEL) { | 659 | thread__find_addr_location(thread, cpumode, |
1164 | show = SHOW_KERNEL; | 660 | MAP__FUNCTION, ip, &al, NULL); |
1165 | level = 'k'; | 661 | /* |
1166 | 662 | * We have to do this here as we may have a dso with no symbol hit that | |
1167 | dso = kernel_dso; | 663 | * has a name longer than the ones with symbols sampled. |
1168 | 664 | */ | |
1169 | dump_printf(" ...... dso: %s\n", dso->name); | 665 | if (al.map && !sort_dso.elide && !al.map->dso->slen_calculated) |
1170 | 666 | dso__calc_col_width(al.map->dso); | |
1171 | } else if (cpumode == PERF_RECORD_MISC_USER) { | 667 | |
1172 | 668 | if (dso_list && | |
1173 | show = SHOW_USER; | 669 | (!al.map || !al.map->dso || |
1174 | level = '.'; | 670 | !(strlist__has_entry(dso_list, al.map->dso->short_name) || |
1175 | 671 | (al.map->dso->short_name != al.map->dso->long_name && | |
1176 | } else { | 672 | strlist__has_entry(dso_list, al.map->dso->long_name))))) |
1177 | show = SHOW_HV; | 673 | return 0; |
1178 | level = 'H'; | ||
1179 | |||
1180 | dso = hypervisor_dso; | ||
1181 | |||
1182 | dump_printf(" ...... dso: [hypervisor]\n"); | ||
1183 | } | ||
1184 | |||
1185 | if (show & show_mask) { | ||
1186 | struct symbol *sym = resolve_symbol(thread, &map, &dso, &ip); | ||
1187 | |||
1188 | if (dso_list && (!dso || !dso->name || | ||
1189 | !strlist__has_entry(dso_list, dso->name))) | ||
1190 | return 0; | ||
1191 | |||
1192 | if (sym_list && (!sym || !strlist__has_entry(sym_list, sym->name))) | ||
1193 | return 0; | ||
1194 | |||
1195 | if (hist_entry__add(thread, map, dso, sym, ip, chain, level, period)) { | ||
1196 | eprintf("problem incrementing symbol count, skipping event\n"); | ||
1197 | return -1; | ||
1198 | } | ||
1199 | } | ||
1200 | total += period; | ||
1201 | |||
1202 | return 0; | ||
1203 | } | ||
1204 | 674 | ||
1205 | static int | 675 | if (sym_list && al.sym && !strlist__has_entry(sym_list, al.sym->name)) |
1206 | process_mmap_event(event_t *event, unsigned long offset, unsigned long head) | ||
1207 | { | ||
1208 | struct thread *thread; | ||
1209 | struct map *map = map__new(&event->mmap, cwd, cwdlen); | ||
1210 | |||
1211 | thread = threads__findnew(event->mmap.pid, &threads, &last_match); | ||
1212 | |||
1213 | dump_printf("%p [%p]: PERF_RECORD_MMAP %d/%d: [%p(%p) @ %p]: %s\n", | ||
1214 | (void *)(offset + head), | ||
1215 | (void *)(long)(event->header.size), | ||
1216 | event->mmap.pid, | ||
1217 | event->mmap.tid, | ||
1218 | (void *)(long)event->mmap.start, | ||
1219 | (void *)(long)event->mmap.len, | ||
1220 | (void *)(long)event->mmap.pgoff, | ||
1221 | event->mmap.filename); | ||
1222 | |||
1223 | if (thread == NULL || map == NULL) { | ||
1224 | dump_printf("problem processing PERF_RECORD_MMAP, skipping event.\n"); | ||
1225 | return 0; | 676 | return 0; |
677 | |||
678 | if (hist_entry__add(&al, chain, period)) { | ||
679 | pr_debug("problem incrementing symbol count, skipping event\n"); | ||
680 | return -1; | ||
1226 | } | 681 | } |
1227 | 682 | ||
1228 | thread__insert_map(thread, map); | 683 | event__stats.total += period; |
1229 | total_mmap++; | ||
1230 | 684 | ||
1231 | return 0; | 685 | return 0; |
1232 | } | 686 | } |
1233 | 687 | ||
1234 | static int | 688 | static int process_comm_event(event_t *event) |
1235 | process_comm_event(event_t *event, unsigned long offset, unsigned long head) | ||
1236 | { | 689 | { |
1237 | struct thread *thread; | 690 | struct thread *thread = threads__findnew(event->comm.pid); |
1238 | |||
1239 | thread = threads__findnew(event->comm.pid, &threads, &last_match); | ||
1240 | 691 | ||
1241 | dump_printf("%p [%p]: PERF_RECORD_COMM: %s:%d\n", | 692 | dump_printf(": %s:%d\n", event->comm.comm, event->comm.pid); |
1242 | (void *)(offset + head), | ||
1243 | (void *)(long)(event->header.size), | ||
1244 | event->comm.comm, event->comm.pid); | ||
1245 | 693 | ||
1246 | if (thread == NULL || | 694 | if (thread == NULL || |
1247 | thread__set_comm_adjust(thread, event->comm.comm)) { | 695 | thread__set_comm_adjust(thread, event->comm.comm)) { |
1248 | dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n"); | 696 | dump_printf("problem processing PERF_RECORD_COMM, skipping event.\n"); |
1249 | return -1; | 697 | return -1; |
1250 | } | 698 | } |
1251 | total_comm++; | ||
1252 | |||
1253 | return 0; | ||
1254 | } | ||
1255 | |||
1256 | static int | ||
1257 | process_task_event(event_t *event, unsigned long offset, unsigned long head) | ||
1258 | { | ||
1259 | struct thread *thread; | ||
1260 | struct thread *parent; | ||
1261 | |||
1262 | thread = threads__findnew(event->fork.pid, &threads, &last_match); | ||
1263 | parent = threads__findnew(event->fork.ppid, &threads, &last_match); | ||
1264 | |||
1265 | dump_printf("%p [%p]: PERF_RECORD_%s: (%d:%d):(%d:%d)\n", | ||
1266 | (void *)(offset + head), | ||
1267 | (void *)(long)(event->header.size), | ||
1268 | event->header.type == PERF_RECORD_FORK ? "FORK" : "EXIT", | ||
1269 | event->fork.pid, event->fork.tid, | ||
1270 | event->fork.ppid, event->fork.ptid); | ||
1271 | |||
1272 | /* | ||
1273 | * A thread clone will have the same PID for both | ||
1274 | * parent and child. | ||
1275 | */ | ||
1276 | if (thread == parent) | ||
1277 | return 0; | ||
1278 | |||
1279 | if (event->header.type == PERF_RECORD_EXIT) | ||
1280 | return 0; | ||
1281 | |||
1282 | if (!thread || !parent || thread__fork(thread, parent)) { | ||
1283 | dump_printf("problem processing PERF_RECORD_FORK, skipping event.\n"); | ||
1284 | return -1; | ||
1285 | } | ||
1286 | total_fork++; | ||
1287 | 699 | ||
1288 | return 0; | 700 | return 0; |
1289 | } | 701 | } |
1290 | 702 | ||
1291 | static int | 703 | static int process_read_event(event_t *event) |
1292 | process_lost_event(event_t *event, unsigned long offset, unsigned long head) | ||
1293 | { | ||
1294 | dump_printf("%p [%p]: PERF_RECORD_LOST: id:%Ld: lost:%Ld\n", | ||
1295 | (void *)(offset + head), | ||
1296 | (void *)(long)(event->header.size), | ||
1297 | event->lost.id, | ||
1298 | event->lost.lost); | ||
1299 | |||
1300 | total_lost += event->lost.lost; | ||
1301 | |||
1302 | return 0; | ||
1303 | } | ||
1304 | |||
1305 | static int | ||
1306 | process_read_event(event_t *event, unsigned long offset, unsigned long head) | ||
1307 | { | 704 | { |
1308 | struct perf_event_attr *attr; | 705 | struct perf_event_attr *attr; |
1309 | 706 | ||
@@ -1319,238 +716,91 @@ process_read_event(event_t *event, unsigned long offset, unsigned long head) | |||
1319 | event->read.value); | 716 | event->read.value); |
1320 | } | 717 | } |
1321 | 718 | ||
1322 | dump_printf("%p [%p]: PERF_RECORD_READ: %d %d %s %Lu\n", | 719 | dump_printf(": %d %d %s %Lu\n", event->read.pid, event->read.tid, |
1323 | (void *)(offset + head), | 720 | attr ? __event_name(attr->type, attr->config) : "FAIL", |
1324 | (void *)(long)(event->header.size), | 721 | event->read.value); |
1325 | event->read.pid, | ||
1326 | event->read.tid, | ||
1327 | attr ? __event_name(attr->type, attr->config) | ||
1328 | : "FAIL", | ||
1329 | event->read.value); | ||
1330 | |||
1331 | return 0; | ||
1332 | } | ||
1333 | |||
1334 | static int | ||
1335 | process_event(event_t *event, unsigned long offset, unsigned long head) | ||
1336 | { | ||
1337 | trace_event(event); | ||
1338 | |||
1339 | switch (event->header.type) { | ||
1340 | case PERF_RECORD_SAMPLE: | ||
1341 | return process_sample_event(event, offset, head); | ||
1342 | |||
1343 | case PERF_RECORD_MMAP: | ||
1344 | return process_mmap_event(event, offset, head); | ||
1345 | |||
1346 | case PERF_RECORD_COMM: | ||
1347 | return process_comm_event(event, offset, head); | ||
1348 | |||
1349 | case PERF_RECORD_FORK: | ||
1350 | case PERF_RECORD_EXIT: | ||
1351 | return process_task_event(event, offset, head); | ||
1352 | |||
1353 | case PERF_RECORD_LOST: | ||
1354 | return process_lost_event(event, offset, head); | ||
1355 | |||
1356 | case PERF_RECORD_READ: | ||
1357 | return process_read_event(event, offset, head); | ||
1358 | |||
1359 | /* | ||
1360 | * We dont process them right now but they are fine: | ||
1361 | */ | ||
1362 | |||
1363 | case PERF_RECORD_THROTTLE: | ||
1364 | case PERF_RECORD_UNTHROTTLE: | ||
1365 | return 0; | ||
1366 | |||
1367 | default: | ||
1368 | return -1; | ||
1369 | } | ||
1370 | 722 | ||
1371 | return 0; | 723 | return 0; |
1372 | } | 724 | } |
1373 | 725 | ||
1374 | static int __cmd_report(void) | 726 | static int sample_type_check(u64 type) |
1375 | { | 727 | { |
1376 | int ret, rc = EXIT_FAILURE; | 728 | sample_type = type; |
1377 | unsigned long offset = 0; | ||
1378 | unsigned long head, shift; | ||
1379 | struct stat input_stat; | ||
1380 | struct thread *idle; | ||
1381 | event_t *event; | ||
1382 | uint32_t size; | ||
1383 | char *buf; | ||
1384 | |||
1385 | idle = register_idle_thread(&threads, &last_match); | ||
1386 | thread__comm_adjust(idle); | ||
1387 | |||
1388 | if (show_threads) | ||
1389 | perf_read_values_init(&show_threads_values); | ||
1390 | |||
1391 | input = open(input_name, O_RDONLY); | ||
1392 | if (input < 0) { | ||
1393 | fprintf(stderr, " failed to open file: %s", input_name); | ||
1394 | if (!strcmp(input_name, "perf.data")) | ||
1395 | fprintf(stderr, " (try 'perf record' first)"); | ||
1396 | fprintf(stderr, "\n"); | ||
1397 | exit(-1); | ||
1398 | } | ||
1399 | |||
1400 | ret = fstat(input, &input_stat); | ||
1401 | if (ret < 0) { | ||
1402 | perror("failed to stat file"); | ||
1403 | exit(-1); | ||
1404 | } | ||
1405 | |||
1406 | if (!force && input_stat.st_uid && (input_stat.st_uid != geteuid())) { | ||
1407 | fprintf(stderr, "file: %s not owned by current user or root\n", input_name); | ||
1408 | exit(-1); | ||
1409 | } | ||
1410 | |||
1411 | if (!input_stat.st_size) { | ||
1412 | fprintf(stderr, "zero-sized file, nothing to do!\n"); | ||
1413 | exit(0); | ||
1414 | } | ||
1415 | |||
1416 | header = perf_header__read(input); | ||
1417 | head = header->data_offset; | ||
1418 | |||
1419 | sample_type = perf_header__sample_type(header); | ||
1420 | 729 | ||
1421 | if (!(sample_type & PERF_SAMPLE_CALLCHAIN)) { | 730 | if (!(sample_type & PERF_SAMPLE_CALLCHAIN)) { |
1422 | if (sort__has_parent) { | 731 | if (sort__has_parent) { |
1423 | fprintf(stderr, "selected --sort parent, but no" | 732 | fprintf(stderr, "selected --sort parent, but no" |
1424 | " callchain data. Did you call" | 733 | " callchain data. Did you call" |
1425 | " perf record without -g?\n"); | 734 | " perf record without -g?\n"); |
1426 | exit(-1); | 735 | return -1; |
1427 | } | 736 | } |
1428 | if (callchain) { | 737 | if (callchain) { |
1429 | fprintf(stderr, "selected -g but no callchain data." | 738 | fprintf(stderr, "selected -g but no callchain data." |
1430 | " Did you call perf record without" | 739 | " Did you call perf record without" |
1431 | " -g?\n"); | 740 | " -g?\n"); |
1432 | exit(-1); | 741 | return -1; |
1433 | } | 742 | } |
1434 | } else if (callchain_param.mode != CHAIN_NONE && !callchain) { | 743 | } else if (callchain_param.mode != CHAIN_NONE && !callchain) { |
1435 | callchain = 1; | 744 | callchain = 1; |
1436 | if (register_callchain_param(&callchain_param) < 0) { | 745 | if (register_callchain_param(&callchain_param) < 0) { |
1437 | fprintf(stderr, "Can't register callchain" | 746 | fprintf(stderr, "Can't register callchain" |
1438 | " params\n"); | 747 | " params\n"); |
1439 | exit(-1); | 748 | return -1; |
1440 | } | 749 | } |
1441 | } | 750 | } |
1442 | 751 | ||
1443 | if (load_kernel() < 0) { | 752 | return 0; |
1444 | perror("failed to load kernel symbols"); | 753 | } |
1445 | return EXIT_FAILURE; | ||
1446 | } | ||
1447 | |||
1448 | if (!full_paths) { | ||
1449 | if (getcwd(__cwd, sizeof(__cwd)) == NULL) { | ||
1450 | perror("failed to get the current directory"); | ||
1451 | return EXIT_FAILURE; | ||
1452 | } | ||
1453 | cwdlen = strlen(cwd); | ||
1454 | } else { | ||
1455 | cwd = NULL; | ||
1456 | cwdlen = 0; | ||
1457 | } | ||
1458 | |||
1459 | shift = page_size * (head / page_size); | ||
1460 | offset += shift; | ||
1461 | head -= shift; | ||
1462 | |||
1463 | remap: | ||
1464 | buf = (char *)mmap(NULL, page_size * mmap_window, PROT_READ, | ||
1465 | MAP_SHARED, input, offset); | ||
1466 | if (buf == MAP_FAILED) { | ||
1467 | perror("failed to mmap file"); | ||
1468 | exit(-1); | ||
1469 | } | ||
1470 | |||
1471 | more: | ||
1472 | event = (event_t *)(buf + head); | ||
1473 | |||
1474 | size = event->header.size; | ||
1475 | if (!size) | ||
1476 | size = 8; | ||
1477 | |||
1478 | if (head + event->header.size >= page_size * mmap_window) { | ||
1479 | int munmap_ret; | ||
1480 | |||
1481 | shift = page_size * (head / page_size); | ||
1482 | |||
1483 | munmap_ret = munmap(buf, page_size * mmap_window); | ||
1484 | assert(munmap_ret == 0); | ||
1485 | |||
1486 | offset += shift; | ||
1487 | head -= shift; | ||
1488 | goto remap; | ||
1489 | } | ||
1490 | |||
1491 | size = event->header.size; | ||
1492 | |||
1493 | dump_printf("\n%p [%p]: event: %d\n", | ||
1494 | (void *)(offset + head), | ||
1495 | (void *)(long)event->header.size, | ||
1496 | event->header.type); | ||
1497 | |||
1498 | if (!size || process_event(event, offset, head) < 0) { | ||
1499 | |||
1500 | dump_printf("%p [%p]: skipping unknown header type: %d\n", | ||
1501 | (void *)(offset + head), | ||
1502 | (void *)(long)(event->header.size), | ||
1503 | event->header.type); | ||
1504 | |||
1505 | total_unknown++; | ||
1506 | |||
1507 | /* | ||
1508 | * assume we lost track of the stream, check alignment, and | ||
1509 | * increment a single u64 in the hope to catch on again 'soon'. | ||
1510 | */ | ||
1511 | 754 | ||
1512 | if (unlikely(head & 7)) | 755 | static struct perf_file_handler file_handler = { |
1513 | head &= ~7ULL; | 756 | .process_sample_event = process_sample_event, |
757 | .process_mmap_event = event__process_mmap, | ||
758 | .process_comm_event = process_comm_event, | ||
759 | .process_exit_event = event__process_task, | ||
760 | .process_fork_event = event__process_task, | ||
761 | .process_lost_event = event__process_lost, | ||
762 | .process_read_event = process_read_event, | ||
763 | .sample_type_check = sample_type_check, | ||
764 | }; | ||
1514 | 765 | ||
1515 | size = 8; | ||
1516 | } | ||
1517 | 766 | ||
1518 | head += size; | 767 | static int __cmd_report(void) |
768 | { | ||
769 | struct thread *idle; | ||
770 | int ret; | ||
1519 | 771 | ||
1520 | if (offset + head >= header->data_offset + header->data_size) | 772 | idle = register_idle_thread(); |
1521 | goto done; | 773 | thread__comm_adjust(idle); |
1522 | 774 | ||
1523 | if (offset + head < (unsigned long)input_stat.st_size) | 775 | if (show_threads) |
1524 | goto more; | 776 | perf_read_values_init(&show_threads_values); |
1525 | 777 | ||
1526 | done: | 778 | register_perf_file_handler(&file_handler); |
1527 | rc = EXIT_SUCCESS; | ||
1528 | close(input); | ||
1529 | 779 | ||
1530 | dump_printf(" IP events: %10ld\n", total); | 780 | ret = mmap_dispatch_perf_file(&header, input_name, force, |
1531 | dump_printf(" mmap events: %10ld\n", total_mmap); | 781 | full_paths, &event__cwdlen, &event__cwd); |
1532 | dump_printf(" comm events: %10ld\n", total_comm); | 782 | if (ret) |
1533 | dump_printf(" fork events: %10ld\n", total_fork); | 783 | return ret; |
1534 | dump_printf(" lost events: %10ld\n", total_lost); | ||
1535 | dump_printf(" unknown events: %10ld\n", total_unknown); | ||
1536 | 784 | ||
1537 | if (dump_trace) | 785 | if (dump_trace) { |
786 | event__print_totals(); | ||
1538 | return 0; | 787 | return 0; |
788 | } | ||
1539 | 789 | ||
1540 | if (verbose >= 3) | 790 | if (verbose > 3) |
1541 | threads__fprintf(stdout, &threads); | 791 | threads__fprintf(stdout); |
1542 | 792 | ||
1543 | if (verbose >= 2) | 793 | if (verbose > 2) |
1544 | dsos__fprintf(stdout); | 794 | dsos__fprintf(stdout); |
1545 | 795 | ||
1546 | collapse__resort(); | 796 | collapse__resort(); |
1547 | output__resort(total); | 797 | output__resort(event__stats.total); |
1548 | output__fprintf(stdout, total); | 798 | output__fprintf(stdout, event__stats.total); |
1549 | 799 | ||
1550 | if (show_threads) | 800 | if (show_threads) |
1551 | perf_read_values_destroy(&show_threads_values); | 801 | perf_read_values_destroy(&show_threads_values); |
1552 | 802 | ||
1553 | return rc; | 803 | return ret; |
1554 | } | 804 | } |
1555 | 805 | ||
1556 | static int | 806 | static int |
@@ -1606,7 +856,8 @@ setup: | |||
1606 | return 0; | 856 | return 0; |
1607 | } | 857 | } |
1608 | 858 | ||
1609 | static const char * const report_usage[] = { | 859 | //static const char * const report_usage[] = { |
860 | const char * const report_usage[] = { | ||
1610 | "perf report [<options>] <command>", | 861 | "perf report [<options>] <command>", |
1611 | NULL | 862 | NULL |
1612 | }; | 863 | }; |
@@ -1618,9 +869,10 @@ static const struct option options[] = { | |||
1618 | "be more verbose (show symbol address, etc)"), | 869 | "be more verbose (show symbol address, etc)"), |
1619 | OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, | 870 | OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace, |
1620 | "dump raw trace in ASCII"), | 871 | "dump raw trace in ASCII"), |
1621 | OPT_STRING('k', "vmlinux", &vmlinux_name, "file", "vmlinux pathname"), | 872 | OPT_STRING('k', "vmlinux", &symbol_conf.vmlinux_name, |
873 | "file", "vmlinux pathname"), | ||
1622 | OPT_BOOLEAN('f', "force", &force, "don't complain, do it"), | 874 | OPT_BOOLEAN('f', "force", &force, "don't complain, do it"), |
1623 | OPT_BOOLEAN('m', "modules", &modules, | 875 | OPT_BOOLEAN('m', "modules", &symbol_conf.use_modules, |
1624 | "load module symbols - WARNING: use only with -k and LIVE kernel"), | 876 | "load module symbols - WARNING: use only with -k and LIVE kernel"), |
1625 | OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples, | 877 | OPT_BOOLEAN('n', "show-nr-samples", &show_nr_samples, |
1626 | "Show a column with the number of samples"), | 878 | "Show a column with the number of samples"), |
@@ -1690,9 +942,8 @@ static void setup_list(struct strlist **list, const char *list_str, | |||
1690 | 942 | ||
1691 | int cmd_report(int argc, const char **argv, const char *prefix __used) | 943 | int cmd_report(int argc, const char **argv, const char *prefix __used) |
1692 | { | 944 | { |
1693 | symbol__init(); | 945 | if (symbol__init(&symbol_conf) < 0) |
1694 | 946 | return -1; | |
1695 | page_size = getpagesize(); | ||
1696 | 947 | ||
1697 | argc = parse_options(argc, argv, options, report_usage, 0); | 948 | argc = parse_options(argc, argv, options, report_usage, 0); |
1698 | 949 | ||