7aa72a00bc8e91eccfaa29e3b2b0875fb43bce24
[platform/adaptation/renesas_rcar/renesas_kernel.git] / tools / perf / util / sort.h
1 #ifndef __PERF_SORT_H
2 #define __PERF_SORT_H
3 #include "../builtin.h"
4
5 #include "util.h"
6
7 #include "color.h"
8 #include <linux/list.h>
9 #include "cache.h"
10 #include <linux/rbtree.h>
11 #include "symbol.h"
12 #include "string.h"
13 #include "callchain.h"
14 #include "strlist.h"
15 #include "values.h"
16
17 #include "../perf.h"
18 #include "debug.h"
19 #include "header.h"
20
21 #include "parse-options.h"
22 #include "parse-events.h"
23
24 #include "thread.h"
25 #include "sort.h"
26
27 extern regex_t parent_regex;
28 extern const char *sort_order;
29 extern const char default_parent_pattern[];
30 extern const char *parent_pattern;
31 extern const char default_sort_order[];
32 extern int sort__need_collapse;
33 extern int sort__has_parent;
34 extern bool sort__branch_mode;
35 extern char *field_sep;
36 extern struct sort_entry sort_comm;
37 extern struct sort_entry sort_dso;
38 extern struct sort_entry sort_sym;
39 extern struct sort_entry sort_parent;
40 extern struct sort_entry sort_lbr_dso;
41 extern struct sort_entry sort_lbr_sym;
42 extern enum sort_type sort__first_dimension;
43
44 /**
45  * struct hist_entry - histogram entry
46  *
47  * @row_offset - offset from the first callchain expanded to appear on screen
48  * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
49  */
50 struct hist_entry {
51         struct rb_node          rb_node_in;
52         struct rb_node          rb_node;
53         u64                     period;
54         u64                     period_sys;
55         u64                     period_us;
56         u64                     period_guest_sys;
57         u64                     period_guest_us;
58         struct map_symbol       ms;
59         struct thread           *thread;
60         u64                     ip;
61         s32                     cpu;
62         u32                     nr_events;
63
64         /* XXX These two should move to some tree widget lib */
65         u16                     row_offset;
66         u16                     nr_rows;
67
68         bool                    init_have_children;
69         char                    level;
70         bool                    used;
71         u8                      filtered;
72         struct symbol           *parent;
73         union {
74                 unsigned long     position;
75                 struct hist_entry *pair;
76                 struct rb_root    sorted_chain;
77         };
78         struct branch_info      *branch_info;
79         struct callchain_root   callchain[0];
80 };
81
82 enum sort_type {
83         SORT_PID,
84         SORT_COMM,
85         SORT_DSO,
86         SORT_SYM,
87         SORT_PARENT,
88         SORT_CPU,
89         SORT_DSO_FROM,
90         SORT_DSO_TO,
91         SORT_SYM_FROM,
92         SORT_SYM_TO,
93         SORT_MISPREDICT,
94 };
95
96 /*
97  * configurable sorting bits
98  */
99
100 struct sort_entry {
101         struct list_head list;
102
103         const char *se_header;
104
105         int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
106         int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
107         int     (*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
108                                unsigned int width);
109         u8      se_width_idx;
110         bool    elide;
111 };
112
113 extern struct sort_entry sort_thread;
114 extern struct list_head hist_entry__sort_list;
115
116 void setup_sorting(const char * const usagestr[], const struct option *opts);
117 extern int sort_dimension__add(const char *);
118 void sort_entry__setup_elide(struct sort_entry *self, struct strlist *list,
119                              const char *list_name, FILE *fp);
120
121 #endif  /* __PERF_SORT_H */