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