Loading...
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
26extern regex_t parent_regex;
27extern const char *sort_order;
28extern const char default_parent_pattern[];
29extern const char *parent_pattern;
30extern const char default_sort_order[];
31extern regex_t ignore_callees_regex;
32extern int have_ignore_callees;
33extern int sort__need_collapse;
34extern int sort__has_parent;
35extern int sort__has_sym;
36extern enum sort_mode sort__mode;
37extern struct sort_entry sort_comm;
38extern struct sort_entry sort_dso;
39extern struct sort_entry sort_sym;
40extern struct sort_entry sort_parent;
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;
45extern enum sort_type sort__first_dimension;
46
47struct he_stat {
48 u64 period;
49 u64 period_sys;
50 u64 period_us;
51 u64 period_guest_sys;
52 u64 period_guest_us;
53 u64 weight;
54 u32 nr_events;
55};
56
57struct hist_entry_diff {
58 bool computed;
59
60 /* PERF_HPP__DELTA */
61 double period_ratio_delta;
62
63 /* PERF_HPP__RATIO */
64 double period_ratio;
65
66 /* HISTC_WEIGHTED_DIFF */
67 s64 wdiff;
68};
69
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 */
76struct hist_entry {
77 struct rb_node rb_node_in;
78 struct rb_node rb_node;
79 union {
80 struct list_head node;
81 struct list_head head;
82 } pairs;
83 struct he_stat stat;
84 struct map_symbol ms;
85 struct thread *thread;
86 struct comm *comm;
87 u64 ip;
88 u64 transaction;
89 s32 cpu;
90
91 struct hist_entry_diff diff;
92
93 /* We are added by hists__add_dummy_entry. */
94 bool dummy;
95
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;
101 char level;
102 bool used;
103 u8 filtered;
104 char *srcline;
105 struct symbol *parent;
106 unsigned long position;
107 struct rb_root sorted_chain;
108 struct branch_info *branch_info;
109 struct hists *hists;
110 struct mem_info *mem_info;
111 struct callchain_root callchain[0]; /* must be last member */
112};
113
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
126static inline void hist_entry__add_pair(struct hist_entry *pair,
127 struct hist_entry *he)
128{
129 list_add_tail(&pair->pairs.node, &he->pairs.head);
130}
131
132enum sort_mode {
133 SORT_MODE__NORMAL,
134 SORT_MODE__BRANCH,
135 SORT_MODE__MEMORY,
136};
137
138enum sort_type {
139 /* common sort keys */
140 SORT_PID,
141 SORT_COMM,
142 SORT_DSO,
143 SORT_SYM,
144 SORT_PARENT,
145 SORT_CPU,
146 SORT_SRCLINE,
147 SORT_LOCAL_WEIGHT,
148 SORT_GLOBAL_WEIGHT,
149 SORT_TRANSACTION,
150
151 /* branch stack specific sort keys */
152 __SORT_BRANCH_STACK,
153 SORT_DSO_FROM = __SORT_BRANCH_STACK,
154 SORT_DSO_TO,
155 SORT_SYM_FROM,
156 SORT_SYM_TO,
157 SORT_MISPREDICT,
158 SORT_ABORT,
159 SORT_IN_TX,
160
161 /* memory mode specific sort keys */
162 __SORT_MEMORY_MODE,
163 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
164 SORT_MEM_DADDR_DSO,
165 SORT_MEM_LOCKED,
166 SORT_MEM_TLB,
167 SORT_MEM_LVL,
168 SORT_MEM_SNOOP,
169};
170
171/*
172 * configurable sorting bits
173 */
174
175struct sort_entry {
176 struct list_head list;
177
178 const char *se_header;
179
180 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
181 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
182 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
183 unsigned int width);
184 u8 se_width_idx;
185 bool elide;
186};
187
188extern struct sort_entry sort_thread;
189extern struct list_head hist_entry__sort_list;
190
191int setup_sorting(void);
192extern int sort_dimension__add(const char *);
193void sort__setup_elide(FILE *fp);
194
195int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
196
197#endif /* __PERF_SORT_H */
1/* SPDX-License-Identifier: GPL-2.0 */
2#ifndef __PERF_SORT_H
3#define __PERF_SORT_H
4#include "../builtin.h"
5
6#include <regex.h>
7
8#include "color.h"
9#include <linux/list.h>
10#include "cache.h"
11#include <linux/rbtree.h>
12#include "symbol.h"
13#include "string.h"
14#include "callchain.h"
15#include "values.h"
16
17#include "../perf.h"
18#include "debug.h"
19#include "header.h"
20
21#include <subcmd/parse-options.h>
22#include "parse-events.h"
23#include "hist.h"
24#include "srcline.h"
25
26struct thread;
27
28extern regex_t parent_regex;
29extern const char *sort_order;
30extern const char *field_order;
31extern const char default_parent_pattern[];
32extern const char *parent_pattern;
33extern const char *default_sort_order;
34extern regex_t ignore_callees_regex;
35extern int have_ignore_callees;
36extern enum sort_mode sort__mode;
37extern struct sort_entry sort_comm;
38extern struct sort_entry sort_dso;
39extern struct sort_entry sort_sym;
40extern struct sort_entry sort_parent;
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;
45extern struct sort_entry sort_srcline;
46extern enum sort_type sort__first_dimension;
47extern const char default_mem_sort_order[];
48
49struct he_stat {
50 u64 period;
51 u64 period_sys;
52 u64 period_us;
53 u64 period_guest_sys;
54 u64 period_guest_us;
55 u64 weight;
56 u32 nr_events;
57};
58
59struct namespace_id {
60 u64 dev;
61 u64 ino;
62};
63
64struct hist_entry_diff {
65 bool computed;
66 union {
67 /* PERF_HPP__DELTA */
68 double period_ratio_delta;
69
70 /* PERF_HPP__RATIO */
71 double period_ratio;
72
73 /* HISTC_WEIGHTED_DIFF */
74 s64 wdiff;
75 };
76};
77
78struct hist_entry_ops {
79 void *(*new)(size_t size);
80 void (*free)(void *ptr);
81};
82
83/**
84 * struct hist_entry - histogram entry
85 *
86 * @row_offset - offset from the first callchain expanded to appear on screen
87 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
88 */
89struct hist_entry {
90 struct rb_node rb_node_in;
91 struct rb_node rb_node;
92 union {
93 struct list_head node;
94 struct list_head head;
95 } pairs;
96 struct he_stat stat;
97 struct he_stat *stat_acc;
98 struct map_symbol ms;
99 struct thread *thread;
100 struct comm *comm;
101 struct namespace_id cgroup_id;
102 u64 ip;
103 u64 transaction;
104 s32 socket;
105 s32 cpu;
106 u8 cpumode;
107 u8 depth;
108
109 /* We are added by hists__add_dummy_entry. */
110 bool dummy;
111 bool leaf;
112
113 char level;
114 u8 filtered;
115 union {
116 /*
117 * Since perf diff only supports the stdio output, TUI
118 * fields are only accessed from perf report (or perf
119 * top). So make it a union to reduce memory usage.
120 */
121 struct hist_entry_diff diff;
122 struct /* for TUI */ {
123 u16 row_offset;
124 u16 nr_rows;
125 bool init_have_children;
126 bool unfolded;
127 bool has_children;
128 bool has_no_entry;
129 };
130 };
131 char *srcline;
132 char *srcfile;
133 struct symbol *parent;
134 struct branch_info *branch_info;
135 struct hists *hists;
136 struct mem_info *mem_info;
137 void *raw_data;
138 u32 raw_size;
139 void *trace_output;
140 struct perf_hpp_list *hpp_list;
141 struct hist_entry *parent_he;
142 struct hist_entry_ops *ops;
143 union {
144 /* this is for hierarchical entry structure */
145 struct {
146 struct rb_root hroot_in;
147 struct rb_root hroot_out;
148 }; /* non-leaf entries */
149 struct rb_root sorted_chain; /* leaf entry has callchains */
150 };
151 struct callchain_root callchain[0]; /* must be last member */
152};
153
154static inline bool hist_entry__has_pairs(struct hist_entry *he)
155{
156 return !list_empty(&he->pairs.node);
157}
158
159static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
160{
161 if (hist_entry__has_pairs(he))
162 return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
163 return NULL;
164}
165
166static inline void hist_entry__add_pair(struct hist_entry *pair,
167 struct hist_entry *he)
168{
169 list_add_tail(&pair->pairs.node, &he->pairs.head);
170}
171
172static inline float hist_entry__get_percent_limit(struct hist_entry *he)
173{
174 u64 period = he->stat.period;
175 u64 total_period = hists__total_period(he->hists);
176
177 if (unlikely(total_period == 0))
178 return 0;
179
180 if (symbol_conf.cumulate_callchain)
181 period = he->stat_acc->period;
182
183 return period * 100.0 / total_period;
184}
185
186static inline u64 cl_address(u64 address)
187{
188 /* return the cacheline of the address */
189 return (address & ~(cacheline_size - 1));
190}
191
192static inline u64 cl_offset(u64 address)
193{
194 /* return the cacheline of the address */
195 return (address & (cacheline_size - 1));
196}
197
198enum sort_mode {
199 SORT_MODE__NORMAL,
200 SORT_MODE__BRANCH,
201 SORT_MODE__MEMORY,
202 SORT_MODE__TOP,
203 SORT_MODE__DIFF,
204 SORT_MODE__TRACEPOINT,
205};
206
207enum sort_type {
208 /* common sort keys */
209 SORT_PID,
210 SORT_COMM,
211 SORT_DSO,
212 SORT_SYM,
213 SORT_PARENT,
214 SORT_CPU,
215 SORT_SOCKET,
216 SORT_SRCLINE,
217 SORT_SRCFILE,
218 SORT_LOCAL_WEIGHT,
219 SORT_GLOBAL_WEIGHT,
220 SORT_TRANSACTION,
221 SORT_TRACE,
222 SORT_SYM_SIZE,
223 SORT_DSO_SIZE,
224 SORT_CGROUP_ID,
225
226 /* branch stack specific sort keys */
227 __SORT_BRANCH_STACK,
228 SORT_DSO_FROM = __SORT_BRANCH_STACK,
229 SORT_DSO_TO,
230 SORT_SYM_FROM,
231 SORT_SYM_TO,
232 SORT_MISPREDICT,
233 SORT_ABORT,
234 SORT_IN_TX,
235 SORT_CYCLES,
236 SORT_SRCLINE_FROM,
237 SORT_SRCLINE_TO,
238
239 /* memory mode specific sort keys */
240 __SORT_MEMORY_MODE,
241 SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
242 SORT_MEM_DADDR_DSO,
243 SORT_MEM_LOCKED,
244 SORT_MEM_TLB,
245 SORT_MEM_LVL,
246 SORT_MEM_SNOOP,
247 SORT_MEM_DCACHELINE,
248 SORT_MEM_IADDR_SYMBOL,
249 SORT_MEM_PHYS_DADDR,
250};
251
252/*
253 * configurable sorting bits
254 */
255
256struct sort_entry {
257 const char *se_header;
258
259 int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
260 int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
261 int64_t (*se_sort)(struct hist_entry *, struct hist_entry *);
262 int (*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
263 unsigned int width);
264 int (*se_filter)(struct hist_entry *he, int type, const void *arg);
265 u8 se_width_idx;
266};
267
268extern struct sort_entry sort_thread;
269extern struct list_head hist_entry__sort_list;
270
271struct perf_evlist;
272struct pevent;
273int setup_sorting(struct perf_evlist *evlist);
274int setup_output_field(void);
275void reset_output_field(void);
276void sort__setup_elide(FILE *fp);
277void perf_hpp__set_elide(int idx, bool elide);
278
279int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);
280
281bool is_strict_order(const char *order);
282
283int hpp_dimension__add_output(unsigned col);
284void reset_dimensions(void);
285int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
286 struct perf_evlist *evlist,
287 int level);
288int output_field_add(struct perf_hpp_list *list, char *tok);
289int64_t
290sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
291int64_t
292sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
293int64_t
294sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
295char *hist_entry__get_srcline(struct hist_entry *he);
296#endif /* __PERF_SORT_H */