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"
21 #include "util/parse-options.h"
22 #include "util/parse-events.h"
28 static char const *input_name = "perf.data";
29 static char *vmlinux = NULL;
31 static char default_sort_order[] = "comm,dso";
32 static char *sort_order = default_sort_order;
35 static int show_mask = SHOW_KERNEL | SHOW_USER | SHOW_HV;
37 static int dump_trace = 0;
38 #define dprintf(x...) do { if (dump_trace) printf(x); } while (0)
39 #define cdprintf(x...) do { if (dump_trace) color_fprintf(stdout, color, x); } while (0)
42 static int full_paths;
44 static unsigned long page_size;
45 static unsigned long mmap_window = 32;
47 struct ip_chain_event {
56 struct perf_event_header header;
59 unsigned char __more_data[];
63 struct perf_event_header header;
68 char filename[PATH_MAX];
72 struct perf_event_header header;
78 struct perf_event_header header;
83 struct perf_event_header header;
89 typedef union event_union {
90 struct perf_event_header header;
92 struct mmap_event mmap;
93 struct comm_event comm;
94 struct fork_event fork;
95 struct period_event period;
98 static LIST_HEAD(dsos);
99 static struct dso *kernel_dso;
100 static struct dso *vdso;
102 static void dsos__add(struct dso *dso)
104 list_add_tail(&dso->node, &dsos);
107 static struct dso *dsos__find(const char *name)
111 list_for_each_entry(pos, &dsos, node)
112 if (strcmp(pos->name, name) == 0)
117 static struct dso *dsos__findnew(const char *name)
119 struct dso *dso = dsos__find(name);
125 dso = dso__new(name, 0);
129 nr = dso__load(dso, NULL, verbose);
132 fprintf(stderr, "Failed to open: %s\n", name);
135 if (!nr && verbose) {
137 "No symbols found in: %s, maybe install a debug package?\n",
150 static void dsos__fprintf(FILE *fp)
154 list_for_each_entry(pos, &dsos, node)
155 dso__fprintf(pos, fp);
158 static struct symbol *vdso__find_symbol(struct dso *dso, __u64 ip)
160 return dso__find_symbol(kernel_dso, ip);
163 static int load_kernel(void)
167 kernel_dso = dso__new("[kernel]", 0);
171 err = dso__load_kernel(kernel_dso, vmlinux, NULL, verbose);
173 dso__delete(kernel_dso);
176 dsos__add(kernel_dso);
178 vdso = dso__new("[vdso]", 0);
182 vdso->find_symbol = vdso__find_symbol;
189 static char __cwd[PATH_MAX];
190 static char *cwd = __cwd;
193 static int strcommon(const char *pathname)
197 while (pathname[n] == cwd[n] && n < cwdlen)
204 struct list_head node;
208 __u64 (*map_ip)(struct map *, __u64);
212 static __u64 map__map_ip(struct map *map, __u64 ip)
214 return ip - map->start + map->pgoff;
217 static __u64 vdso__map_ip(struct map *map, __u64 ip)
222 static inline int is_anon_memory(const char *filename)
224 return strcmp(filename, "//anon") == 0;
227 static struct map *map__new(struct mmap_event *event)
229 struct map *self = malloc(sizeof(*self));
232 const char *filename = event->filename;
233 char newfilename[PATH_MAX];
237 int n = strcommon(filename);
240 snprintf(newfilename, sizeof(newfilename),
241 ".%s", filename + n);
242 filename = newfilename;
246 anon = is_anon_memory(filename);
249 snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", event->pid);
250 filename = newfilename;
253 self->start = event->start;
254 self->end = event->start + event->len;
255 self->pgoff = event->pgoff;
257 self->dso = dsos__findnew(filename);
258 if (self->dso == NULL)
261 if (self->dso == vdso || anon)
262 self->map_ip = vdso__map_ip;
264 self->map_ip = map__map_ip;
272 static struct map *map__clone(struct map *self)
274 struct map *map = malloc(sizeof(*self));
279 memcpy(map, self, sizeof(*self));
284 static int map__overlap(struct map *l, struct map *r)
286 if (l->start > r->start) {
292 if (l->end > r->start)
298 static size_t map__fprintf(struct map *self, FILE *fp)
300 return fprintf(fp, " %Lx-%Lx %Lx %s\n",
301 self->start, self->end, self->pgoff, self->dso->name);
306 struct rb_node rb_node;
307 struct list_head maps;
312 static struct thread *thread__new(pid_t pid)
314 struct thread *self = malloc(sizeof(*self));
318 self->comm = malloc(32);
320 snprintf(self->comm, 32, ":%d", self->pid);
321 INIT_LIST_HEAD(&self->maps);
327 static int thread__set_comm(struct thread *self, const char *comm)
331 self->comm = strdup(comm);
332 return self->comm ? 0 : -ENOMEM;
335 static size_t thread__fprintf(struct thread *self, FILE *fp)
338 size_t ret = fprintf(fp, "Thread %d %s\n", self->pid, self->comm);
340 list_for_each_entry(pos, &self->maps, node)
341 ret += map__fprintf(pos, fp);
347 static struct rb_root threads;
348 static struct thread *last_match;
350 static struct thread *threads__findnew(pid_t pid)
352 struct rb_node **p = &threads.rb_node;
353 struct rb_node *parent = NULL;
357 * Font-end cache - PID lookups come in blocks,
358 * so most of the time we dont have to look up
361 if (last_match && last_match->pid == pid)
366 th = rb_entry(parent, struct thread, rb_node);
368 if (th->pid == pid) {
379 th = thread__new(pid);
381 rb_link_node(&th->rb_node, parent, p);
382 rb_insert_color(&th->rb_node, &threads);
389 static void thread__insert_map(struct thread *self, struct map *map)
391 struct map *pos, *tmp;
393 list_for_each_entry_safe(pos, tmp, &self->maps, node) {
394 if (map__overlap(pos, map)) {
395 list_del_init(&pos->node);
401 list_add_tail(&map->node, &self->maps);
404 static int thread__fork(struct thread *self, struct thread *parent)
410 self->comm = strdup(parent->comm);
414 list_for_each_entry(map, &parent->maps, node) {
415 struct map *new = map__clone(map);
418 thread__insert_map(self, new);
424 static struct map *thread__find_map(struct thread *self, __u64 ip)
431 list_for_each_entry(pos, &self->maps, node)
432 if (ip >= pos->start && ip <= pos->end)
438 static size_t threads__fprintf(FILE *fp)
443 for (nd = rb_first(&threads); nd; nd = rb_next(nd)) {
444 struct thread *pos = rb_entry(nd, struct thread, rb_node);
446 ret += thread__fprintf(pos, fp);
453 * histogram, sorted on item, collects counts
456 static struct rb_root hist;
459 struct rb_node rb_node;
461 struct thread *thread;
472 * configurable sorting bits
476 struct list_head list;
480 int64_t (*cmp)(struct hist_entry *, struct hist_entry *);
481 int64_t (*collapse)(struct hist_entry *, struct hist_entry *);
482 size_t (*print)(FILE *fp, struct hist_entry *);
488 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
490 return right->thread->pid - left->thread->pid;
494 sort__thread_print(FILE *fp, struct hist_entry *self)
496 return fprintf(fp, "%16s:%5d", self->thread->comm ?: "", self->thread->pid);
499 static struct sort_entry sort_thread = {
500 .header = " Command: Pid",
501 .cmp = sort__thread_cmp,
502 .print = sort__thread_print,
508 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
510 return right->thread->pid - left->thread->pid;
514 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
516 char *comm_l = left->thread->comm;
517 char *comm_r = right->thread->comm;
519 if (!comm_l || !comm_r) {
520 if (!comm_l && !comm_r)
528 return strcmp(comm_l, comm_r);
532 sort__comm_print(FILE *fp, struct hist_entry *self)
534 return fprintf(fp, "%16s", self->thread->comm);
537 static struct sort_entry sort_comm = {
538 .header = " Command",
539 .cmp = sort__comm_cmp,
540 .collapse = sort__comm_collapse,
541 .print = sort__comm_print,
547 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
549 struct dso *dso_l = left->dso;
550 struct dso *dso_r = right->dso;
552 if (!dso_l || !dso_r) {
553 if (!dso_l && !dso_r)
561 return strcmp(dso_l->name, dso_r->name);
565 sort__dso_print(FILE *fp, struct hist_entry *self)
568 return fprintf(fp, "%-25s", self->dso->name);
570 return fprintf(fp, "%016llx ", (__u64)self->ip);
573 static struct sort_entry sort_dso = {
574 .header = "Shared Object ",
575 .cmp = sort__dso_cmp,
576 .print = sort__dso_print,
582 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
586 if (left->sym == right->sym)
589 ip_l = left->sym ? left->sym->start : left->ip;
590 ip_r = right->sym ? right->sym->start : right->ip;
592 return (int64_t)(ip_r - ip_l);
596 sort__sym_print(FILE *fp, struct hist_entry *self)
601 ret += fprintf(fp, "%#018llx ", (__u64)self->ip);
604 ret += fprintf(fp, "[%c] %s",
605 self->dso == kernel_dso ? 'k' : '.', self->sym->name);
607 ret += fprintf(fp, "%#016llx", (__u64)self->ip);
613 static struct sort_entry sort_sym = {
615 .cmp = sort__sym_cmp,
616 .print = sort__sym_print,
619 static int sort__need_collapse = 0;
621 struct sort_dimension {
623 struct sort_entry *entry;
627 static struct sort_dimension sort_dimensions[] = {
628 { .name = "pid", .entry = &sort_thread, },
629 { .name = "comm", .entry = &sort_comm, },
630 { .name = "dso", .entry = &sort_dso, },
631 { .name = "symbol", .entry = &sort_sym, },
634 static LIST_HEAD(hist_entry__sort_list);
636 static int sort_dimension__add(char *tok)
640 for (i = 0; i < ARRAY_SIZE(sort_dimensions); i++) {
641 struct sort_dimension *sd = &sort_dimensions[i];
646 if (strncasecmp(tok, sd->name, strlen(tok)))
649 if (sd->entry->collapse)
650 sort__need_collapse = 1;
652 list_add_tail(&sd->entry->list, &hist_entry__sort_list);
662 hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
664 struct sort_entry *se;
667 list_for_each_entry(se, &hist_entry__sort_list, list) {
668 cmp = se->cmp(left, right);
677 hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
679 struct sort_entry *se;
682 list_for_each_entry(se, &hist_entry__sort_list, list) {
683 int64_t (*f)(struct hist_entry *, struct hist_entry *);
685 f = se->collapse ?: se->cmp;
687 cmp = f(left, right);
696 hist_entry__fprintf(FILE *fp, struct hist_entry *self, __u64 total_samples)
698 struct sort_entry *se;
702 double percent = self->count * 100.0 / total_samples;
703 char *color = PERF_COLOR_NORMAL;
706 * We color high-overhead entries in red, mid-overhead
707 * entries in green - and keep the low overhead places
710 if (percent >= 5.0) {
711 color = PERF_COLOR_RED;
714 color = PERF_COLOR_GREEN;
717 ret = color_fprintf(fp, color, " %6.2f%%",
718 (self->count * 100.0) / total_samples);
720 ret = fprintf(fp, "%12Ld ", self->count);
722 list_for_each_entry(se, &hist_entry__sort_list, list) {
724 ret += se->print(fp, self);
727 ret += fprintf(fp, "\n");
733 * collect histogram counts
737 hist_entry__add(struct thread *thread, struct map *map, struct dso *dso,
738 struct symbol *sym, __u64 ip, char level, __u64 count)
740 struct rb_node **p = &hist.rb_node;
741 struct rb_node *parent = NULL;
742 struct hist_entry *he;
743 struct hist_entry entry = {
756 he = rb_entry(parent, struct hist_entry, rb_node);
758 cmp = hist_entry__cmp(&entry, he);
771 he = malloc(sizeof(*he));
775 rb_link_node(&he->rb_node, parent, p);
776 rb_insert_color(&he->rb_node, &hist);
781 static void hist_entry__free(struct hist_entry *he)
787 * collapse the histogram
790 static struct rb_root collapse_hists;
792 static void collapse__insert_entry(struct hist_entry *he)
794 struct rb_node **p = &collapse_hists.rb_node;
795 struct rb_node *parent = NULL;
796 struct hist_entry *iter;
801 iter = rb_entry(parent, struct hist_entry, rb_node);
803 cmp = hist_entry__collapse(iter, he);
806 iter->count += he->count;
807 hist_entry__free(he);
817 rb_link_node(&he->rb_node, parent, p);
818 rb_insert_color(&he->rb_node, &collapse_hists);
821 static void collapse__resort(void)
823 struct rb_node *next;
824 struct hist_entry *n;
826 if (!sort__need_collapse)
829 next = rb_first(&hist);
831 n = rb_entry(next, struct hist_entry, rb_node);
832 next = rb_next(&n->rb_node);
834 rb_erase(&n->rb_node, &hist);
835 collapse__insert_entry(n);
840 * reverse the map, sort on count.
843 static struct rb_root output_hists;
845 static void output__insert_entry(struct hist_entry *he)
847 struct rb_node **p = &output_hists.rb_node;
848 struct rb_node *parent = NULL;
849 struct hist_entry *iter;
853 iter = rb_entry(parent, struct hist_entry, rb_node);
855 if (he->count > iter->count)
861 rb_link_node(&he->rb_node, parent, p);
862 rb_insert_color(&he->rb_node, &output_hists);
865 static void output__resort(void)
867 struct rb_node *next;
868 struct hist_entry *n;
869 struct rb_root *tree = &hist;
871 if (sort__need_collapse)
872 tree = &collapse_hists;
874 next = rb_first(tree);
877 n = rb_entry(next, struct hist_entry, rb_node);
878 next = rb_next(&n->rb_node);
880 rb_erase(&n->rb_node, tree);
881 output__insert_entry(n);
885 static size_t output__fprintf(FILE *fp, __u64 total_samples)
887 struct hist_entry *pos;
888 struct sort_entry *se;
894 fprintf(fp, "# (%Ld samples)\n", (__u64)total_samples);
897 fprintf(fp, "# Overhead");
898 list_for_each_entry(se, &hist_entry__sort_list, list)
899 fprintf(fp, " %s", se->header);
902 fprintf(fp, "# ........");
903 list_for_each_entry(se, &hist_entry__sort_list, list) {
907 for (i = 0; i < strlen(se->header); i++)
914 for (nd = rb_first(&output_hists); nd; nd = rb_next(nd)) {
915 pos = rb_entry(nd, struct hist_entry, rb_node);
916 ret += hist_entry__fprintf(fp, pos, total_samples);
919 if (!strcmp(sort_order, default_sort_order)) {
921 fprintf(fp, "# (For more details, try: perf report --sort comm,dso,symbol)\n");
929 static void register_idle_thread(void)
931 struct thread *thread = threads__findnew(0);
933 if (thread == NULL ||
934 thread__set_comm(thread, "[idle]")) {
935 fprintf(stderr, "problem inserting idle task.\n");
940 static unsigned long total = 0,
947 process_overflow_event(event_t *event, unsigned long offset, unsigned long head)
951 struct dso *dso = NULL;
952 struct thread *thread = threads__findnew(event->ip.pid);
953 __u64 ip = event->ip.ip;
955 struct map *map = NULL;
956 void *more_data = event->ip.__more_data;
957 struct ip_chain_event *chain;
959 if (event->header.type & PERF_SAMPLE_PERIOD) {
960 period = *(__u64 *)more_data;
961 more_data += sizeof(__u64);
964 dprintf("%p [%p]: PERF_EVENT (IP, %d): %d: %p period: %Ld\n",
965 (void *)(offset + head),
966 (void *)(long)(event->header.size),
972 if (event->header.type & PERF_SAMPLE_CALLCHAIN) {
975 chain = (void *)more_data;
978 dprintf("... chain: u:%d, k:%d, nr:%d\n",
983 for (i = 0; i < chain->nr; i++)
984 dprintf("..... %2d: %p\n", i, (void *)chain->ips[i]);
988 dprintf(" ... thread: %s:%d\n", thread->comm, thread->pid);
990 if (thread == NULL) {
991 fprintf(stderr, "problem processing %d event, skipping it.\n",
996 if (event->header.misc & PERF_EVENT_MISC_KERNEL) {
1002 dprintf(" ...... dso: %s\n", dso->name);
1004 } else if (event->header.misc & PERF_EVENT_MISC_USER) {
1009 map = thread__find_map(thread, ip);
1011 ip = map->map_ip(map, ip);
1015 * If this is outside of all known maps,
1016 * and is a negative address, try to look it
1017 * up in the kernel dso, as it might be a
1018 * vsyscall (which executes in user-mode):
1020 if ((long long)ip < 0)
1023 dprintf(" ...... dso: %s\n", dso ? dso->name : "<not found>");
1028 dprintf(" ...... dso: [hypervisor]\n");
1031 if (show & show_mask) {
1032 struct symbol *sym = NULL;
1035 sym = dso->find_symbol(dso, ip);
1037 if (hist_entry__add(thread, map, dso, sym, ip, level, period)) {
1039 "problem incrementing symbol count, skipping event\n");
1049 process_mmap_event(event_t *event, unsigned long offset, unsigned long head)
1051 struct thread *thread = threads__findnew(event->mmap.pid);
1052 struct map *map = map__new(&event->mmap);
1054 dprintf("%p [%p]: PERF_EVENT_MMAP %d: [%p(%p) @ %p]: %s\n",
1055 (void *)(offset + head),
1056 (void *)(long)(event->header.size),
1058 (void *)(long)event->mmap.start,
1059 (void *)(long)event->mmap.len,
1060 (void *)(long)event->mmap.pgoff,
1061 event->mmap.filename);
1063 if (thread == NULL || map == NULL) {
1064 dprintf("problem processing PERF_EVENT_MMAP, skipping event.\n");
1068 thread__insert_map(thread, map);
1075 process_comm_event(event_t *event, unsigned long offset, unsigned long head)
1077 struct thread *thread = threads__findnew(event->comm.pid);
1079 dprintf("%p [%p]: PERF_EVENT_COMM: %s:%d\n",
1080 (void *)(offset + head),
1081 (void *)(long)(event->header.size),
1082 event->comm.comm, event->comm.pid);
1084 if (thread == NULL ||
1085 thread__set_comm(thread, event->comm.comm)) {
1086 dprintf("problem processing PERF_EVENT_COMM, skipping event.\n");
1095 process_fork_event(event_t *event, unsigned long offset, unsigned long head)
1097 struct thread *thread = threads__findnew(event->fork.pid);
1098 struct thread *parent = threads__findnew(event->fork.ppid);
1100 dprintf("%p [%p]: PERF_EVENT_FORK: %d:%d\n",
1101 (void *)(offset + head),
1102 (void *)(long)(event->header.size),
1103 event->fork.pid, event->fork.ppid);
1105 if (!thread || !parent || thread__fork(thread, parent)) {
1106 dprintf("problem processing PERF_EVENT_FORK, skipping event.\n");
1115 process_period_event(event_t *event, unsigned long offset, unsigned long head)
1117 dprintf("%p [%p]: PERF_EVENT_PERIOD: time:%Ld, id:%Ld: period:%Ld\n",
1118 (void *)(offset + head),
1119 (void *)(long)(event->header.size),
1122 event->period.sample_period);
1127 static void trace_event(event_t *event)
1129 unsigned char *raw_event = (void *)event;
1130 char *color = PERF_COLOR_BLUE;
1137 cdprintf("\n. ... raw event: size %d bytes\n", event->header.size);
1139 for (i = 0; i < event->header.size; i++) {
1140 if ((i & 15) == 0) {
1142 cdprintf(" %04x: ", i);
1145 cdprintf(" %02x", raw_event[i]);
1147 if (((i & 15) == 15) || i == event->header.size-1) {
1149 for (j = 0; j < 15-(i & 15); j++)
1151 for (j = 0; j < (i & 15); j++) {
1152 if (isprint(raw_event[i-15+j]))
1153 cdprintf("%c", raw_event[i-15+j]);
1164 process_event(event_t *event, unsigned long offset, unsigned long head)
1168 if (event->header.misc & PERF_EVENT_MISC_OVERFLOW)
1169 return process_overflow_event(event, offset, head);
1171 switch (event->header.type) {
1172 case PERF_EVENT_MMAP:
1173 return process_mmap_event(event, offset, head);
1175 case PERF_EVENT_COMM:
1176 return process_comm_event(event, offset, head);
1178 case PERF_EVENT_FORK:
1179 return process_fork_event(event, offset, head);
1181 case PERF_EVENT_PERIOD:
1182 return process_period_event(event, offset, head);
1184 * We dont process them right now but they are fine:
1187 case PERF_EVENT_THROTTLE:
1188 case PERF_EVENT_UNTHROTTLE:
1198 static int __cmd_report(void)
1200 int ret, rc = EXIT_FAILURE;
1201 unsigned long offset = 0;
1202 unsigned long head = 0;
1208 register_idle_thread();
1210 input = open(input_name, O_RDONLY);
1212 fprintf(stderr, " failed to open file: %s", input_name);
1213 if (!strcmp(input_name, "perf.data"))
1214 fprintf(stderr, " (try 'perf record' first)");
1215 fprintf(stderr, "\n");
1219 ret = fstat(input, &stat);
1221 perror("failed to stat file");
1225 if (!stat.st_size) {
1226 fprintf(stderr, "zero-sized file, nothing to do!\n");
1230 if (load_kernel() < 0) {
1231 perror("failed to load kernel symbols");
1232 return EXIT_FAILURE;
1236 if (getcwd(__cwd, sizeof(__cwd)) == NULL) {
1237 perror("failed to get the current directory");
1238 return EXIT_FAILURE;
1240 cwdlen = strlen(cwd);
1246 buf = (char *)mmap(NULL, page_size * mmap_window, PROT_READ,
1247 MAP_SHARED, input, offset);
1248 if (buf == MAP_FAILED) {
1249 perror("failed to mmap file");
1254 event = (event_t *)(buf + head);
1256 size = event->header.size;
1260 if (head + event->header.size >= page_size * mmap_window) {
1261 unsigned long shift = page_size * (head / page_size);
1264 ret = munmap(buf, page_size * mmap_window);
1272 size = event->header.size;
1274 dprintf("\n%p [%p]: event: %d\n",
1275 (void *)(offset + head),
1276 (void *)(long)event->header.size,
1277 event->header.type);
1279 if (!size || process_event(event, offset, head) < 0) {
1281 dprintf("%p [%p]: skipping unknown header type: %d\n",
1282 (void *)(offset + head),
1283 (void *)(long)(event->header.size),
1284 event->header.type);
1289 * assume we lost track of the stream, check alignment, and
1290 * increment a single u64 in the hope to catch on again 'soon'.
1293 if (unlikely(head & 7))
1301 if (offset + head < stat.st_size)
1307 dprintf(" IP events: %10ld\n", total);
1308 dprintf(" mmap events: %10ld\n", total_mmap);
1309 dprintf(" comm events: %10ld\n", total_comm);
1310 dprintf(" fork events: %10ld\n", total_fork);
1311 dprintf(" unknown events: %10ld\n", total_unknown);
1317 threads__fprintf(stdout);
1320 dsos__fprintf(stdout);
1324 output__fprintf(stdout, total);
1329 static const char * const report_usage[] = {
1330 "perf report [<options>] <command>",
1334 static const struct option options[] = {
1335 OPT_STRING('i', "input", &input_name, "file",
1337 OPT_BOOLEAN('v', "verbose", &verbose,
1338 "be more verbose (show symbol address, etc)"),
1339 OPT_BOOLEAN('D', "dump-raw-trace", &dump_trace,
1340 "dump raw trace in ASCII"),
1341 OPT_STRING('k', "vmlinux", &vmlinux, "file", "vmlinux pathname"),
1342 OPT_STRING('s', "sort", &sort_order, "key[,key2...]",
1343 "sort by key(s): pid, comm, dso, symbol. Default: pid,symbol"),
1344 OPT_BOOLEAN('P', "full-paths", &full_paths,
1345 "Don't shorten the pathnames taking into account the cwd"),
1349 static void setup_sorting(void)
1351 char *tmp, *tok, *str = strdup(sort_order);
1353 for (tok = strtok_r(str, ", ", &tmp);
1354 tok; tok = strtok_r(NULL, ", ", &tmp)) {
1355 if (sort_dimension__add(tok) < 0) {
1356 error("Unknown --sort key: `%s'", tok);
1357 usage_with_options(report_usage, options);
1364 int cmd_report(int argc, const char **argv, const char *prefix)
1368 page_size = getpagesize();
1370 argc = parse_options(argc, argv, options, report_usage, 0);
1375 * Any (unrecognized) arguments left?
1378 usage_with_options(report_usage, options);
1382 return __cmd_report();