4 * Builtin report command: Analyze the perf.data input file,
5 * look up and read DSOs and symbol information and display
6 * a histogram of results, along various sorting keys.
10 #include "util/util.h"
12 #include "util/color.h"
13 #include "util/list.h"
14 #include "util/cache.h"
15 #include "util/rbtree.h"
16 #include "util/symbol.h"
17 #include "util/string.h"
18 #include "util/callchain.h"
19 #include "util/strlist.h"
22 #include "util/header.h"
24 #include "util/parse-options.h"
25 #include "util/parse-events.h"
31 static char const *input_name = "perf.data";
32 static char *vmlinux = NULL;
34 static char default_sort_order[] = "comm,dso";
35 static char *sort_order = default_sort_order;
36 static char *dso_list_str;
37 static struct strlist *dso_list;
40 static int show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;
42 static int dump_trace = 0;
43 #define dprintf(x...) do { if (dump_trace) printf(x); } while (0)
44 #define cdprintf(x...) do { if (dump_trace) color_fprintf(stdout, color, x); } while (0)
47 #define eprintf(x...) do { if (verbose) fprintf(stderr, x); } while (0)
49 static int full_paths;
51 static unsigned long page_size;
52 static unsigned long mmap_window = 32;
54 static char default_parent_pattern[] = "^sys_|^do_page_fault";
55 static char *parent_pattern = default_parent_pattern;
56 static regex_t parent_regex;
58 static int exclude_other = 1;
61 static u64 sample_type;
64 struct perf_event_header header;
67 unsigned char __more_data[];
71 struct perf_event_header header;
76 char filename[PATH_MAX];
80 struct perf_event_header header;
86 struct perf_event_header header;
91 struct perf_event_header header;
98 struct perf_event_header header;
104 struct perf_event_header header;
110 typedef union event_union {
111 struct perf_event_header header;
113 struct mmap_event mmap;
114 struct comm_event comm;
115 struct fork_event fork;
116 struct period_event period;
117 struct lost_event lost;
118 struct read_event read;
121 static LIST_HEAD(dsos);
122 static struct dso *kernel_dso;
123 static struct dso *vdso;
125 static void dsos__add(struct dso *dso)
127 list_add_tail(&dso->node, &dsos);
130 static struct dso *dsos__find(const char *name)
134 list_for_each_entry(pos, &dsos, node)
135 if (strcmp(pos->name, name) == 0)
140 static struct dso *dsos__findnew(const char *name)
142 struct dso *dso = dsos__find(name);
148 dso = dso__new(name, 0);
152 nr = dso__load(dso, NULL, verbose);
154 eprintf("Failed to open: %s\n", name);
158 eprintf("No symbols found in: %s, maybe install a debug package?\n", name);
169 static void dsos__fprintf(FILE *fp)
173 list_for_each_entry(pos, &dsos, node)
174 dso__fprintf(pos, fp);
177 static struct symbol *vdso__find_symbol(struct dso *dso, u64 ip)
179 return dso__find_symbol(kernel_dso, ip);
182 static int load_kernel(void)
186 kernel_dso = dso__new("[kernel]", 0);
190 err = dso__load_kernel(kernel_dso, vmlinux, NULL, verbose);
192 dso__delete(kernel_dso);
195 dsos__add(kernel_dso);
197 vdso = dso__new("[vdso]", 0);
201 vdso->find_symbol = vdso__find_symbol;
208 static char __cwd[PATH_MAX];
209 static char *cwd = __cwd;
212 static int strcommon(const char *pathname)
216 while (pathname[n] == cwd[n] && n < cwdlen)
223 struct list_head node;
227 u64 (*map_ip)(struct map *, u64);
231 static u64 map__map_ip(struct map *map, u64 ip)
233 return ip - map->start + map->pgoff;
236 static u64 vdso__map_ip(struct map *map, u64 ip)
241 static inline int is_anon_memory(const char *filename)
243 return strcmp(filename, "//anon") == 0;
246 static struct map *map__new(struct mmap_event *event)
248 struct map *self = malloc(sizeof(*self));
251 const char *filename = event->filename;
252 char newfilename[PATH_MAX];
256 int n = strcommon(filename);
259 snprintf(newfilename, sizeof(newfilename),
260 ".%s", filename + n);
261 filename = newfilename;
265 anon = is_anon_memory(filename);
268 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", event->pid);
269 filename = newfilename;
272 self->start = event->start;
273 self->end = event->start + event->len;
274 self->pgoff = event->pgoff;
276 self->dso = dsos__findnew(filename);
277 if (self->dso == NULL)
280 if (self->dso == vdso || anon)
281 self->map_ip = vdso__map_ip;
283 self->map_ip = map__map_ip;
291 static struct map *map__clone(struct map *self)
293 struct map *map = malloc(sizeof(*self));
298 memcpy(map, self, sizeof(*self));
303 static int map__overlap(struct map *l, struct map *r)
305 if (l->start > r->start) {
311 if (l->end > r->start)
317 static size_t map__fprintf(struct map *self, FILE *fp)
319 return fprintf(fp, " %Lx-%Lx %Lx %s\n",
320 self->start, self->end, self->pgoff, self->dso->name);
325 struct rb_node rb_node;
326 struct list_head maps;
331 static struct thread *thread__new(pid_t pid)
333 struct thread *self = malloc(sizeof(*self));
337 self->comm = malloc(32);
339 snprintf(self->comm, 32, ":%d", self->pid);
340 INIT_LIST_HEAD(&self->maps);
346 static int thread__set_comm(struct thread *self, const char *comm)
350 self->comm = strdup(comm);
351 return self->comm ? 0 : -ENOMEM;
354 static size_t thread__fprintf(struct thread *self, FILE *fp)
357 size_t ret = fprintf(fp, "Thread %d %s\n", self->pid, self->comm);
359 list_for_each_entry(pos, &self->maps, node)
360 ret += map__fprintf(pos, fp);
366 static struct rb_root threads;
367 static struct thread *last_match;
369 static struct thread *threads__findnew(pid_t pid)
371 struct rb_node **p = &threads.rb_node;
372 struct rb_node *parent = NULL;
376 * Font-end cache - PID lookups come in blocks,
377 * so most of the time we dont have to look up
380 if (last_match && last_match->pid == pid)
385 th = rb_entry(parent, struct thread, rb_node);
387 if (th->pid == pid) {
398 th = thread__new(pid);
400 rb_link_node(&th->rb_node, parent, p);
401 rb_insert_color(&th->rb_node, &threads);
408 static void thread__insert_map(struct thread *self, struct map *map)
410 struct map *pos, *tmp;
412 list_for_each_entry_safe(pos, tmp, &self->maps, node) {
413 if (map__overlap(pos, map)) {
415 printf("overlapping maps:\n");
416 map__fprintf(map, stdout);
417 map__fprintf(pos, stdout);
420 if (map->start <= pos->start && map->end > pos->start)
421 pos->start = map->end;
423 if (map->end >= pos->end && map->start < pos->end)
424 pos->end = map->start;
427 printf("after collision:\n");
428 map__fprintf(pos, stdout);
431 if (pos->start >= pos->end) {
432 list_del_init(&pos->node);
438 list_add_tail(&map->node, &self->maps);
441 static int thread__fork(struct thread *self, struct thread *parent)
447 self->comm = strdup(parent->comm);
451 list_for_each_entry(map, &parent->maps, node) {
452 struct map *new = map__clone(map);
455 thread__insert_map(self, new);
461 static struct map *thread__find_map(struct thread *self, u64 ip)
468 list_for_each_entry(pos, &self->maps, node)
469 if (ip >= pos->start && ip <= pos->end)
475 static size_t threads__fprintf(FILE *fp)
480 for (nd = rb_first(&threads); nd; nd = rb_next(nd)) {
481 struct thread *pos = rb_entry(nd, struct thread, rb_node);
483 ret += thread__fprintf(pos, fp);
490 * histogram, sorted on item, collects counts
493 static struct rb_root hist;
496 struct rb_node rb_node;
498 struct thread *thread;
502 struct symbol *parent;
505 struct callchain_node callchain;
506 struct rb_root sorted_chain;
512 * configurable sorting bits
516 struct list_head list;
520 int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
521 int64_t (*collapse)(struct hist_entry *, struct hist_entry *);
522 size_t (*print)(FILE *fp, struct hist_entry *);
525 static int64_t cmp_null(void *l, void *r)
538 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
540 return right->thread->pid - left->thread->pid;
544 sort__thread_print(FILE *fp, struct hist_entry *self)
546 return fprintf(fp, "%16s:%5d", self->thread->comm ?: "", self->thread->pid);
549 static struct sort_entry sort_thread = {
550 .header = " Command: Pid",
551 .cmp = sort__thread_cmp,
552 .print = sort__thread_print,
558 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
560 return right->thread->pid - left->thread->pid;
564 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
566 char *comm_l = left->thread->comm;
567 char *comm_r = right->thread->comm;
569 if (!comm_l || !comm_r)
570 return cmp_null(comm_l, comm_r);
572 return strcmp(comm_l, comm_r);
576 sort__comm_print(FILE *fp, struct hist_entry *self)
578 return fprintf(fp, "%16s", self->thread->comm);
581 static struct sort_entry sort_comm = {
582 .header = " Command",
583 .cmp = sort__comm_cmp,
584 .collapse = sort__comm_collapse,
585 .print = sort__comm_print,
591 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
593 struct dso *dso_l = left->dso;
594 struct dso *dso_r = right->dso;
596 if (!dso_l || !dso_r)
597 return cmp_null(dso_l, dso_r);
599 return strcmp(dso_l->name, dso_r->name);
603 sort__dso_print(FILE *fp, struct hist_entry *self)
606 return fprintf(fp, "%-25s", self->dso->name);
608 return fprintf(fp, "%016llx ", (u64)self->ip);
611 static struct sort_entry sort_dso = {
612 .header = "Shared Object ",
613 .cmp = sort__dso_cmp,
614 .print = sort__dso_print,
620 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
624 if (left->sym == right->sym)
627 ip_l = left->sym ? left->sym->start : left->ip;
628 ip_r = right->sym ? right->sym->start : right->ip;
630 return (int64_t)(ip_r - ip_l);
634 sort__sym_print(FILE *fp, struct hist_entry *self)
639 ret += fprintf(fp, "%#018llx ", (u64)self->ip);
642 ret += fprintf(fp, "[%c] %s",
643 self->dso == kernel_dso ? 'k' : '.', self->sym->name);
645 ret += fprintf(fp, "%#016llx", (u64)self->ip);
651 static struct sort_entry sort_sym = {
653 .cmp = sort__sym_cmp,
654 .print = sort__sym_print,
660 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
662 struct symbol *sym_l = left->parent;
663 struct symbol *sym_r = right->parent;
665 if (!sym_l || !sym_r)
666 return cmp_null(sym_l, sym_r);
668 return strcmp(sym_l->name, sym_r->name);
672 sort__parent_print(FILE *fp, struct hist_entry *self)
676 ret += fprintf(fp, "%-20s", self->parent ? self->parent->name : "[other]");
681 static struct sort_entry sort_parent = {
682 .header = "Parent symbol ",
683 .cmp = sort__parent_cmp,
684 .print = sort__parent_print,
687 static int sort__need_collapse = 0;
688 static int sort__has_parent = 0;
690 struct sort_dimension {
692 struct sort_entry *entry;
696 static struct sort_dimension sort_dimensions[] = {
697 { .name = "pid", .entry = &sort_thread, },
698 { .name = "comm", .entry = &sort_comm, },
699 { .name = "dso", .entry = &sort_dso, },
700 { .name = "symbol", .entry = &sort_sym, },
701 { .name = "parent", .entry = &sort_parent, },
704 static LIST_HEAD(hist_entry__sort_list);
706 static int sort_dimension__add(char *tok)
710 for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
711 struct sort_dimension *sd = &sort_dimensions[i];
716 if (strncasecmp(tok, sd->name, strlen(tok)))
719 if (sd->entry->collapse)
720 sort__need_collapse = 1;
722 if (sd->entry == &sort_parent) {
723 int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
727 regerror(ret, &parent_regex, err, sizeof(err));
728 fprintf(stderr, "Invalid regex: %s\n%s",
729 parent_pattern, err);
732 sort__has_parent = 1;
735 list_add_tail(&sd->entry->list, &hist_entry__sort_list);
745 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
747 struct sort_entry *se;
750 list_for_each_entry(se, &hist_entry__sort_list, list) {
751 cmp = se->cmp(left, right);
760 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
762 struct sort_entry *se;
765 list_for_each_entry(se, &hist_entry__sort_list, list) {
766 int64_t (*f)(struct hist_entry *, struct hist_entry *);
768 f = se->collapse ?: se->cmp;
770 cmp = f(left, right);
779 callchain__fprintf(FILE *fp, struct callchain_node *self, u64 total_samples)
781 struct callchain_list *chain;
787 ret += callchain__fprintf(fp, self->parent, total_samples);
790 list_for_each_entry(chain, &self->val, list)
791 ret += fprintf(fp, " %p\n", (void *)chain->ip);
797 hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
800 struct rb_node *rb_node;
801 struct callchain_node *chain;
804 rb_node = rb_first(&self->sorted_chain);
808 chain = rb_entry(rb_node, struct callchain_node, rb_node);
809 percent = chain->hit * 100.0 / total_samples;
810 ret += fprintf(fp, " %6.2f%%\n", percent);
811 ret += callchain__fprintf(fp, chain, total_samples);
812 ret += fprintf(fp, "\n");
813 rb_node = rb_next(rb_node);
821 hist_entry__fprintf(FILE *fp, struct hist_entry *self, u64 total_samples)
823 struct sort_entry *se;
826 if (exclude_other && !self->parent)
830 double percent = self->count * 100.0 / total_samples;
831 char *color = PERF_COLOR_NORMAL;
834 * We color high-overhead entries in red, mid-overhead
835 * entries in green - and keep the low overhead places
838 if (percent >= 5.0) {
839 color = PERF_COLOR_RED;
842 color = PERF_COLOR_GREEN;
845 ret = color_fprintf(fp, color, " %6.2f%%",
846 (self->count * 100.0) / total_samples);
848 ret = fprintf(fp, "%12Ld ", self->count);
850 list_for_each_entry(se, &hist_entry__sort_list, list) {
851 if (exclude_other && (se == &sort_parent))
855 ret += se->print(fp, self);
858 ret += fprintf(fp, "\n");
861 hist_entry_callchain__fprintf(fp, self, total_samples);
870 static struct symbol *
871 resolve_symbol(struct thread *thread, struct map **mapp,
872 struct dso **dsop, u64 *ipp)
874 struct dso *dso = dsop ? *dsop : NULL;
875 struct map *map = mapp ? *mapp : NULL;
887 map = thread__find_map(thread, ip);
892 ip = map->map_ip(map, ip);
897 * If this is outside of all known maps,
898 * and is a negative address, try to look it
899 * up in the kernel dso, as it might be a
900 * vsyscall (which executes in user-mode):
902 if ((long long)ip < 0)
905 dprintf(" ...... dso: %s\n", dso ? dso->name : "<not found>");
906 dprintf(" ...... map: %Lx -> %Lx\n", *ipp, ip);
915 return dso->find_symbol(dso, ip);
918 static int call__match(struct symbol *sym)
920 if (sym->name && !regexec(&parent_regex, sym->name, 0, NULL, 0))
927 * collect histogram counts
931 hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
932 struct symbol *sym, u64 ip, struct ip_callchain *chain,
933 char level, u64 count)
935 struct rb_node **p = &hist.rb_node;
936 struct rb_node *parent = NULL;
937 struct hist_entry *he;
938 struct hist_entry entry = {
947 .sorted_chain = RB_ROOT
951 if (sort__has_parent && chain) {
952 u64 context = PERF_CONTEXT_MAX;
955 for (i = 0; i < chain->nr; i++) {
956 u64 ip = chain->ips[i];
957 struct dso *dso = NULL;
960 if (ip >= PERF_CONTEXT_MAX) {
966 case PERF_CONTEXT_KERNEL:
973 sym = resolve_symbol(thread, NULL, &dso, &ip);
975 if (sym && call__match(sym)) {
984 he = rb_entry(parent, struct hist_entry, rb_node);
986 cmp = hist_entry__cmp(&entry, he);
991 append_chain(&he->callchain, chain);
1001 he = malloc(sizeof(*he));
1006 callchain_init(&he->callchain);
1007 append_chain(&he->callchain, chain);
1009 rb_link_node(&he->rb_node, parent, p);
1010 rb_insert_color(&he->rb_node, &hist);
1015 static void hist_entry__free(struct hist_entry *he)
1021 * collapse the histogram
1024 static struct rb_root collapse_hists;
1026 static void collapse__insert_entry(struct hist_entry *he)
1028 struct rb_node **p = &collapse_hists.rb_node;
1029 struct rb_node *parent = NULL;
1030 struct hist_entry *iter;
1033 while (*p != NULL) {
1035 iter = rb_entry(parent, struct hist_entry, rb_node);
1037 cmp = hist_entry__collapse(iter, he);
1040 iter->count += he->count;
1041 hist_entry__free(he);
1048 p = &(*p)->rb_right;
1051 rb_link_node(&he->rb_node, parent, p);
1052 rb_insert_color(&he->rb_node, &collapse_hists);
1055 static void collapse__resort(void)
1057 struct rb_node *next;
1058 struct hist_entry *n;
1060 if (!sort__need_collapse)
1063 next = rb_first(&hist);
1065 n = rb_entry(next, struct hist_entry, rb_node);
1066 next = rb_next(&n->rb_node);
1068 rb_erase(&n->rb_node, &hist);
1069 collapse__insert_entry(n);
1074 * reverse the map, sort on count.
1077 static struct rb_root output_hists;
1079 static void output__insert_entry(struct hist_entry *he)
1081 struct rb_node **p = &output_hists.rb_node;
1082 struct rb_node *parent = NULL;
1083 struct hist_entry *iter;
1086 sort_chain_to_rbtree(&he->sorted_chain, &he->callchain);
1088 while (*p != NULL) {
1090 iter = rb_entry(parent, struct hist_entry, rb_node);
1092 if (he->count > iter->count)
1095 p = &(*p)->rb_right;
1098 rb_link_node(&he->rb_node, parent, p);
1099 rb_insert_color(&he->rb_node, &output_hists);
1102 static void output__resort(void)
1104 struct rb_node *next;
1105 struct hist_entry *n;
1106 struct rb_root *tree = &hist;
1108 if (sort__need_collapse)
1109 tree = &collapse_hists;
1111 next = rb_first(tree);
1114 n = rb_entry(next, struct hist_entry, rb_node);
1115 next = rb_next(&n->rb_node);
1117 rb_erase(&n->rb_node, tree);
1118 output__insert_entry(n);
1122 static size_t output__fprintf(FILE *fp, u64 total_samples)
1124 struct hist_entry *pos;
1125 struct sort_entry *se;
1131 fprintf(fp, "# (%Ld samples)\n", (u64)total_samples);
1134 fprintf(fp, "# Overhead");
1135 list_for_each_entry(se, &hist_entry__sort_list, list) {
1136 if (exclude_other && (se == &sort_parent))
1138 fprintf(fp, " %s", se->header);
1142 fprintf(fp, "# ........");
1143 list_for_each_entry(se, &hist_entry__sort_list, list) {
1146 if (exclude_other && (se == &sort_parent))
1150 for (i = 0; i < strlen(se->header); i++)
1157 for (nd = rb_first(&output_hists); nd; nd = rb_next(nd)) {
1158 pos = rb_entry(nd, struct hist_entry, rb_node);
1159 ret += hist_entry__fprintf(fp, pos, total_samples);
1162 if (sort_order == default_sort_order &&
1163 parent_pattern == default_parent_pattern) {
1165 fprintf(fp, "# (For more details, try: perf report --sort comm,dso,symbol)\n");
1173 static void register_idle_thread(void)
1175 struct thread *thread = threads__findnew(0);
1177 if (thread == NULL ||
1178 thread__set_comm(thread, "[idle]")) {
1179 fprintf(stderr, "problem inserting idle task.\n");
1184 static unsigned long total = 0,
1191 static int validate_chain(struct ip_callchain *chain, event_t *event)
1193 unsigned int chain_size;
1195 chain_size = event->header.size;
1196 chain_size -= (unsigned long)&event->ip.__more_data - (unsigned long)event;
1198 if (chain->nr*sizeof(u64) > chain_size)
1205 process_sample_event(event_t *event, unsigned long offset, unsigned long head)
1209 struct dso *dso = NULL;
1210 struct thread *thread = threads__findnew(event->ip.pid);
1211 u64 ip = event->ip.ip;
1213 struct map *map = NULL;
1214 void *more_data = event->ip.__more_data;
1215 struct ip_callchain *chain = NULL;
1217 if (sample_type & PERF_SAMPLE_PERIOD) {
1218 period = *(u64 *)more_data;
1219 more_data += sizeof(u64);
1222 dprintf("%p [%p]: PERF_EVENT_SAMPLE (IP, %d): %d: %p period: %Ld\n",
1223 (void *)(offset + head),
1224 (void *)(long)(event->header.size),
1230 if (sample_type & PERF_SAMPLE_CALLCHAIN) {
1233 chain = (void *)more_data;
1235 dprintf("... chain: nr:%Lu\n", chain->nr);
1237 if (validate_chain(chain, event) < 0) {
1238 eprintf("call-chain problem with event, skipping it.\n");
1243 for (i = 0; i < chain->nr; i++)
1244 dprintf("..... %2d: %016Lx\n", i, chain->ips[i]);
1248 dprintf(" ... thread: %s:%d\n", thread->comm, thread->pid);
1250 if (thread == NULL) {
1251 eprintf("problem processing %d event, skipping it.\n",
1252 event->header.type);
1256 if (event->header.misc & PERF_EVENT_MISC_KERNEL) {
1262 dprintf(" ...... dso: %s\n", dso->name);
1264 } else if (event->header.misc & PERF_EVENT_MISC_USER) {
1272 dprintf(" ...... dso: [hypervisor]\n");
1275 if (show & show_mask) {
1276 struct symbol *sym = resolve_symbol(thread, &map, &dso, &ip);
1278 if (dso_list && dso && dso->name && !strlist__has_entry(dso_list, dso->name))
1281 if (hist_entry__add(thread, map, dso, sym, ip, chain, level, period)) {
1282 eprintf("problem incrementing symbol count, skipping event\n");
1292 process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
1294 struct thread *thread = threads__findnew(event->mmap.pid);
1295 struct map *map = map__new(&event->mmap);
1297 dprintf("%p [%p]: PERF_EVENT_MMAP %d: [%p(%p) @ %p]: %s\n",
1298 (void *)(offset + head),
1299 (void *)(long)(event->header.size),
1301 (void *)(long)event->mmap.start,
1302 (void *)(long)event->mmap.len,
1303 (void *)(long)event->mmap.pgoff,
1304 event->mmap.filename);
1306 if (thread == NULL || map == NULL) {
1307 dprintf("problem processing PERF_EVENT_MMAP, skipping event.\n");
1311 thread__insert_map(thread, map);
1318 process_comm_event(event_t *event, unsigned long offset, unsigned long head)
1320 struct thread *thread = threads__findnew(event->comm.pid);
1322 dprintf("%p [%p]: PERF_EVENT_COMM: %s:%d\n",
1323 (void *)(offset + head),
1324 (void *)(long)(event->header.size),
1325 event->comm.comm, event->comm.pid);
1327 if (thread == NULL ||
1328 thread__set_comm(thread, event->comm.comm)) {
1329 dprintf("problem processing PERF_EVENT_COMM, skipping event.\n");
1338 process_fork_event(event_t *event, unsigned long offset, unsigned long head)
1340 struct thread *thread = threads__findnew(event->fork.pid);
1341 struct thread *parent = threads__findnew(event->fork.ppid);
1343 dprintf("%p [%p]: PERF_EVENT_FORK: %d:%d\n",
1344 (void *)(offset + head),
1345 (void *)(long)(event->header.size),
1346 event->fork.pid, event->fork.ppid);
1348 if (!thread || !parent || thread__fork(thread, parent)) {
1349 dprintf("problem processing PERF_EVENT_FORK, skipping event.\n");
1358 process_period_event(event_t *event, unsigned long offset, unsigned long head)
1360 dprintf("%p [%p]: PERF_EVENT_PERIOD: time:%Ld, id:%Ld: period:%Ld\n",
1361 (void *)(offset + head),
1362 (void *)(long)(event->header.size),
1365 event->period.sample_period);
1371 process_lost_event(event_t *event, unsigned long offset, unsigned long head)
1373 dprintf("%p [%p]: PERF_EVENT_LOST: id:%Ld: lost:%Ld\n",
1374 (void *)(offset + head),
1375 (void *)(long)(event->header.size),
1379 total_lost += event->lost.lost;
1384 static void trace_event(event_t *event)
1386 unsigned char *raw_event = (void *)event;
1387 char *color = PERF_COLOR_BLUE;
1394 cdprintf("\n. ... raw event: size %d bytes\n", event->header.size);
1396 for (i = 0; i < event->header.size; i++) {
1397 if ((i & 15) == 0) {
1399 cdprintf(" %04x: ", i);
1402 cdprintf(" %02x", raw_event[i]);
1404 if (((i & 15) == 15) || i == event->header.size-1) {
1406 for (j = 0; j < 15-(i & 15); j++)
1408 for (j = 0; j < (i & 15); j++) {
1409 if (isprint(raw_event[i-15+j]))
1410 cdprintf("%c", raw_event[i-15+j]);
1421 process_read_event(event_t *event, unsigned long offset, unsigned long head)
1423 dprintf("%p [%p]: PERF_EVENT_READ: %d %d %Lu\n",
1424 (void *)(offset + head),
1425 (void *)(long)(event->header.size),
1434 process_event(event_t *event, unsigned long offset, unsigned long head)
1438 switch (event->header.type) {
1439 case PERF_EVENT_SAMPLE:
1440 return process_sample_event(event, offset, head);
1442 case PERF_EVENT_MMAP:
1443 return process_mmap_event(event, offset, head);
1445 case PERF_EVENT_COMM:
1446 return process_comm_event(event, offset, head);
1448 case PERF_EVENT_FORK:
1449 return process_fork_event(event, offset, head);
1451 case PERF_EVENT_PERIOD:
1452 return process_period_event(event, offset, head);
1454 case PERF_EVENT_LOST:
1455 return process_lost_event(event, offset, head);
1457 case PERF_EVENT_READ:
1458 return process_read_event(event, offset, head);
1461 * We dont process them right now but they are fine:
1464 case PERF_EVENT_THROTTLE:
1465 case PERF_EVENT_UNTHROTTLE:
1475 static struct perf_header *header;
1477 static u64 perf_header__sample_type(void)
1479 u64 sample_type = 0;
1482 for (i = 0; i < header->attrs; i++) {
1483 struct perf_header_attr *attr = header->attr[i];
1486 sample_type = attr->attr.sample_type;
1487 else if (sample_type != attr->attr.sample_type)
1488 die("non matching sample_type");
1494 static int __cmd_report(void)
1496 int ret, rc = EXIT_FAILURE;
1497 unsigned long offset = 0;
1498 unsigned long head, shift;
1504 register_idle_thread();
1506 input = open(input_name, O_RDONLY);
1508 fprintf(stderr, " failed to open file: %s", input_name);
1509 if (!strcmp(input_name, "perf.data"))
1510 fprintf(stderr, " (try 'perf record' first)");
1511 fprintf(stderr, "\n");
1515 ret = fstat(input, &stat);
1517 perror("failed to stat file");
1521 if (!stat.st_size) {
1522 fprintf(stderr, "zero-sized file, nothing to do!\n");
1526 header = perf_header__read(input);
1527 head = header->data_offset;
1529 sample_type = perf_header__sample_type();
1531 if (sort__has_parent && !(sample_type & PERF_SAMPLE_CALLCHAIN)) {
1532 fprintf(stderr, "selected --sort parent, but no callchain data\n");
1536 if (load_kernel() < 0) {
1537 perror("failed to load kernel symbols");
1538 return EXIT_FAILURE;
1542 if (getcwd(__cwd, sizeof(__cwd)) == NULL) {
1543 perror("failed to get the current directory");
1544 return EXIT_FAILURE;
1546 cwdlen = strlen(cwd);
1552 shift = page_size * (head / page_size);
1557 buf = (char *)mmap(NULL, page_size * mmap_window, PROT_READ,
1558 MAP_SHARED, input, offset);
1559 if (buf == MAP_FAILED) {
1560 perror("failed to mmap file");
1565 event = (event_t *)(buf + head);
1567 size = event->header.size;
1571 if (head + event->header.size >= page_size * mmap_window) {
1574 shift = page_size * (head / page_size);
1576 ret = munmap(buf, page_size * mmap_window);
1584 size = event->header.size;
1586 dprintf("\n%p [%p]: event: %d\n",
1587 (void *)(offset + head),
1588 (void *)(long)event->header.size,
1589 event->header.type);
1591 if (!size || process_event(event, offset, head) < 0) {
1593 dprintf("%p [%p]: skipping unknown header type: %d\n",
1594 (void *)(offset + head),
1595 (void *)(long)(event->header.size),
1596 event->header.type);
1601 * assume we lost track of the stream, check alignment, and
1602 * increment a single u64 in the hope to catch on again 'soon'.
1605 if (unlikely(head & 7))
1613 if (offset + head >= header->data_offset + header->data_size)
1616 if (offset + head < stat.st_size)
1623 dprintf(" IP events: %10ld\n", total);
1624 dprintf(" mmap events: %10ld\n", total_mmap);
1625 dprintf(" comm events: %10ld\n", total_comm);
1626 dprintf(" fork events: %10ld\n", total_fork);
1627 dprintf(" lost events: %10ld\n", total_lost);
1628 dprintf(" unknown events: %10ld\n", total_unknown);
1634 threads__fprintf(stdout);
1637 dsos__fprintf(stdout);
1641 output__fprintf(stdout, total);
1646 static const char * const report_usage[] = {
1647 "perf report [<options>] <command>",
1651 static const struct option options[] = {
1652 OPT_STRING('i', "input", &input_name, "file",
1654 OPT_BOOLEAN('v', "verbose", &verbose,
1655 "be more verbose (show symbol address, etc)"),
1656 OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
1657 "dump raw trace in ASCII"),
1658 OPT_STRING('k', "vmlinux", &vmlinux, "file", "vmlinux pathname"),
1659 OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
1660 "sort by key(s): pid, comm, dso, symbol, parent"),
1661 OPT_BOOLEAN('P', "full-paths", &full_paths,
1662 "Don't shorten the pathnames taking into account the cwd"),
1663 OPT_STRING('p', "parent", &parent_pattern, "regex",
1664 "regex filter to identify parent, see: '--sort parent'"),
1665 OPT_BOOLEAN('x', "exclude-other", &exclude_other,
1666 "Only display entries with parent-match"),
1667 OPT_BOOLEAN('c', "callchain", &callchain, "Display callchains"),
1668 OPT_STRING('d', "dsos", &dso_list_str, "dso[,dso...]",
1669 "only consider symbols in these dsos"),
1673 static void setup_sorting(void)
1675 char *tmp, *tok, *str = strdup(sort_order);
1677 for (tok = strtok_r(str, ", ", &tmp);
1678 tok; tok = strtok_r(NULL, ", ", &tmp)) {
1679 if (sort_dimension__add(tok) < 0) {
1680 error("Unknown --sort key: `%s'", tok);
1681 usage_with_options(report_usage, options);
1688 int cmd_report(int argc, const char **argv, const char *prefix)
1692 page_size = getpagesize();
1694 argc = parse_options(argc, argv, options, report_usage, 0);
1698 if (parent_pattern != default_parent_pattern)
1699 sort_dimension__add("parent");
1704 * Any (unrecognized) arguments left?
1707 usage_with_options(report_usage, options);
1710 dso_list = strlist__new(true, dso_list_str);
1712 fprintf(stderr, "problems parsing dso list\n");
1719 return __cmd_report();