perf tools: Call perf_hpp__init() before setting up GUI browsers
[deliverable/linux.git] / tools / perf / util / sort.h
CommitLineData
dd68ada2
JK
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"
dd68ada2
JK
25
26extern regex_t parent_regex;
edb7c60e
ACM
27extern const char *sort_order;
28extern const char default_parent_pattern[];
29extern const char *parent_pattern;
30extern const char default_sort_order[];
b21484f1
GP
31extern regex_t ignore_callees_regex;
32extern int have_ignore_callees;
dd68ada2
JK
33extern int sort__need_collapse;
34extern int sort__has_parent;
1af55640 35extern int sort__has_sym;
55369fc1 36extern enum sort_mode sort__mode;
dd68ada2
JK
37extern struct sort_entry sort_comm;
38extern struct sort_entry sort_dso;
39extern struct sort_entry sort_sym;
40extern struct sort_entry sort_parent;
a68c2c58
SE
41extern struct sort_entry sort_dso_from;
42extern struct sort_entry sort_dso_to;
43extern struct sort_entry sort_sym_from;
44extern struct sort_entry sort_sym_to;
a4fb581b 45extern enum sort_type sort__first_dimension;
dd68ada2 46
b24c28f7
NK
47struct he_stat {
48 u64 period;
49 u64 period_sys;
50 u64 period_us;
51 u64 period_guest_sys;
52 u64 period_guest_us;
05484298 53 u64 weight;
b24c28f7
NK
54 u32 nr_events;
55};
56
96c47f19
JO
57struct hist_entry_diff {
58 bool computed;
59
96c47f19
JO
60 /* PERF_HPP__DELTA */
61 double period_ratio_delta;
62
63 /* PERF_HPP__RATIO */
64 double period_ratio;
81d5f958
JO
65
66 /* HISTC_WEIGHTED_DIFF */
67 s64 wdiff;
96c47f19
JO
68};
69
0f0cbf7a
ACM
70/**
71 * struct hist_entry - histogram entry
72 *
73 * @row_offset - offset from the first callchain expanded to appear on screen
74 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
75 */
dd68ada2 76struct hist_entry {
1980c2eb 77 struct rb_node rb_node_in;
dd68ada2 78 struct rb_node rb_node;
b821c732
ACM
79 union {
80 struct list_head node;
81 struct list_head head;
82 } pairs;
b24c28f7 83 struct he_stat stat;
59fd5306 84 struct map_symbol ms;
a5e29aca 85 struct thread *thread;
4dfced35 86 struct comm *comm;
dd68ada2 87 u64 ip;
475eeab9 88 u64 transaction;
f60f3593 89 s32 cpu;
0f0cbf7a 90
96c47f19
JO
91 struct hist_entry_diff diff;
92
e0af43d2
JO
93 /* We are added by hists__add_dummy_entry. */
94 bool dummy;
95
0f0cbf7a
ACM
96 /* XXX These two should move to some tree widget lib */
97 u16 row_offset;
98 u16 nr_rows;
99
100 bool init_have_children;
dd68ada2 101 char level;
df71d95f 102 bool used;
a5e29aca 103 u8 filtered;
409a8be6 104 char *srcline;
83753190 105 struct symbol *parent;
dd464345 106 unsigned long position;
b821c732 107 struct rb_root sorted_chain;
b5387528 108 struct branch_info *branch_info;
ae359f19 109 struct hists *hists;
98a3b32c
SE
110 struct mem_info *mem_info;
111 struct callchain_root callchain[0]; /* must be last member */
dd68ada2
JK
112};
113
b821c732
ACM
114static inline bool hist_entry__has_pairs(struct hist_entry *he)
115{
116 return !list_empty(&he->pairs.node);
117}
118
119static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
120{
121 if (hist_entry__has_pairs(he))
122 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
123 return NULL;
124}
125
4d23322a
JO
126static inline void hist_entry__add_pair(struct hist_entry *pair,
127 struct hist_entry *he)
b821c732 128{
4d23322a 129 list_add_tail(&pair->pairs.node, &he->pairs.head);
b821c732
ACM
130}
131
55369fc1
NK
132enum sort_mode {
133 SORT_MODE__NORMAL,
134 SORT_MODE__BRANCH,
135 SORT_MODE__MEMORY,
512ae1bd
NK
136 SORT_MODE__TOP,
137 SORT_MODE__DIFF,
55369fc1
NK
138};
139
a4fb581b 140enum sort_type {
fc5871ed 141 /* common sort keys */
a4fb581b
FW
142 SORT_PID,
143 SORT_COMM,
144 SORT_DSO,
145 SORT_SYM,
f60f3593
AS
146 SORT_PARENT,
147 SORT_CPU,
fc5871ed 148 SORT_SRCLINE,
f9ea55d0
AK
149 SORT_LOCAL_WEIGHT,
150 SORT_GLOBAL_WEIGHT,
475eeab9 151 SORT_TRANSACTION,
fc5871ed
NK
152
153 /* branch stack specific sort keys */
154 __SORT_BRANCH_STACK,
155 SORT_DSO_FROM = __SORT_BRANCH_STACK,
b5387528
RAV
156 SORT_DSO_TO,
157 SORT_SYM_FROM,
158 SORT_SYM_TO,
159 SORT_MISPREDICT,
f5d05bce
AK
160 SORT_ABORT,
161 SORT_IN_TX,
afab87b9
NK
162
163 /* memory mode specific sort keys */
164 __SORT_MEMORY_MODE,
f9ea55d0 165 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
afab87b9
NK
166 SORT_MEM_DADDR_DSO,
167 SORT_MEM_LOCKED,
168 SORT_MEM_TLB,
169 SORT_MEM_LVL,
170 SORT_MEM_SNOOP,
a4fb581b
FW
171};
172
dd68ada2
JK
173/*
174 * configurable sorting bits
175 */
176
177struct sort_entry {
178 struct list_head list;
179
fcd14984 180 const char *se_header;
dd68ada2 181
fcd14984
FW
182 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
183 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
316c7136 184 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
fcd14984 185 unsigned int width);
8a6c5b26 186 u8 se_width_idx;
dd68ada2
JK
187 bool elide;
188};
189
190extern struct sort_entry sort_thread;
191extern struct list_head hist_entry__sort_list;
192
55309985 193int setup_sorting(void);
dd68ada2 194extern int sort_dimension__add(const char *);
08e71542 195void sort__setup_elide(FILE *fp);
dd68ada2 196
b21484f1
GP
197int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
198
dd68ada2 199#endif /* __PERF_SORT_H */
This page took 0.183712 seconds and 5 git commands to generate.