sort.h 6.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
#ifndef __PERF_SORT_H
#define __PERF_SORT_H
#include "../builtin.h"

#include "util.h"

#include "color.h"
#include <linux/list.h>
#include "cache.h"
#include <linux/rbtree.h>
#include "symbol.h"
#include "string.h"
#include "callchain.h"
#include "strlist.h"
#include "values.h"

#include "../perf.h"
#include "debug.h"
#include "header.h"

21
#include <subcmd/parse-options.h>
22
#include "parse-events.h"
23
#include "hist.h"
24 25 26
#include "thread.h"

extern regex_t parent_regex;
27
extern const char *sort_order;
28
extern const char *field_order;
29 30
extern const char default_parent_pattern[];
extern const char *parent_pattern;
31
extern const char *default_sort_order;
32 33
extern regex_t ignore_callees_regex;
extern int have_ignore_callees;
34
extern enum sort_mode sort__mode;
35 36 37 38
extern struct sort_entry sort_comm;
extern struct sort_entry sort_dso;
extern struct sort_entry sort_sym;
extern struct sort_entry sort_parent;
39 40 41 42
extern struct sort_entry sort_dso_from;
extern struct sort_entry sort_dso_to;
extern struct sort_entry sort_sym_from;
extern struct sort_entry sort_sym_to;
43
extern struct sort_entry sort_srcline;
44
extern enum sort_type sort__first_dimension;
45
extern const char default_mem_sort_order[];
46

47 48 49 50 51 52
struct he_stat {
	u64			period;
	u64			period_sys;
	u64			period_us;
	u64			period_guest_sys;
	u64			period_guest_us;
53
	u64			weight;
54 55 56
	u32			nr_events;
};

57 58 59 60 61
struct namespace_id {
	u64			dev;
	u64			ino;
};

62 63
struct hist_entry_diff {
	bool	computed;
64 65 66
	union {
		/* PERF_HPP__DELTA */
		double	period_ratio_delta;
67

68 69
		/* PERF_HPP__RATIO */
		double	period_ratio;
70

71 72 73
		/* HISTC_WEIGHTED_DIFF */
		s64	wdiff;
	};
74 75
};

J
Jiri Olsa 已提交
76 77 78 79 80
struct hist_entry_ops {
	void	*(*new)(size_t size);
	void	(*free)(void *ptr);
};

81 82 83 84 85 86
/**
 * struct hist_entry - histogram entry
 *
 * @row_offset - offset from the first callchain expanded to appear on screen
 * @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
 */
87
struct hist_entry {
88
	struct rb_node		rb_node_in;
89
	struct rb_node		rb_node;
90 91 92 93
	union {
		struct list_head node;
		struct list_head head;
	} pairs;
94
	struct he_stat		stat;
95
	struct he_stat		*stat_acc;
96
	struct map_symbol	ms;
97
	struct thread		*thread;
98
	struct comm		*comm;
99
	struct namespace_id	cgroup_id;
100
	u64			ip;
101
	u64			transaction;
102
	s32			socket;
A
Arun Sharma 已提交
103
	s32			cpu;
104
	u8			cpumode;
105
	u8			depth;
106

107 108
	/* We are added by hists__add_dummy_entry. */
	bool			dummy;
109
	bool			leaf;
110

111
	char			level;
112
	u8			filtered;
113 114 115 116
	union {
		/*
		 * Since perf diff only supports the stdio output, TUI
		 * fields are only accessed from perf report (or perf
117
		 * top).  So make it a union to reduce memory usage.
118 119 120 121 122
		 */
		struct hist_entry_diff	diff;
		struct /* for TUI */ {
			u16	row_offset;
			u16	nr_rows;
123
			bool	init_have_children;
124 125
			bool	unfolded;
			bool	has_children;
126
			bool	has_no_entry;
127 128
		};
	};
129
	char			*srcline;
130
	char			*srcfile;
131
	struct symbol		*parent;
132
	struct branch_info	*branch_info;
133
	struct hists		*hists;
134
	struct mem_info		*mem_info;
135 136
	void			*raw_data;
	u32			raw_size;
137
	void			*trace_output;
138
	struct perf_hpp_list	*hpp_list;
139
	struct hist_entry	*parent_he;
J
Jiri Olsa 已提交
140
	struct hist_entry_ops	*ops;
141 142 143 144 145 146 147 148
	union {
		/* this is for hierarchical entry structure */
		struct {
			struct rb_root	hroot_in;
			struct rb_root  hroot_out;
		};				/* non-leaf entries */
		struct rb_root	sorted_chain;	/* leaf entry has callchains */
	};
149
	struct callchain_root	callchain[0]; /* must be last member */
150 151
};

152 153 154 155 156 157 158 159 160 161 162 163
static inline bool hist_entry__has_pairs(struct hist_entry *he)
{
	return !list_empty(&he->pairs.node);
}

static inline struct hist_entry *hist_entry__next_pair(struct hist_entry *he)
{
	if (hist_entry__has_pairs(he))
		return list_entry(he->pairs.node.next, struct hist_entry, pairs.node);
	return NULL;
}

164 165
static inline void hist_entry__add_pair(struct hist_entry *pair,
					struct hist_entry *he)
166
{
167
	list_add_tail(&pair->pairs.node, &he->pairs.head);
168 169
}

170 171 172 173 174 175 176 177 178 179 180 181 182 183
static inline float hist_entry__get_percent_limit(struct hist_entry *he)
{
	u64 period = he->stat.period;
	u64 total_period = hists__total_period(he->hists);

	if (unlikely(total_period == 0))
		return 0;

	if (symbol_conf.cumulate_callchain)
		period = he->stat_acc->period;

	return period * 100.0 / total_period;
}

J
Jiri Olsa 已提交
184 185 186 187 188
static inline u64 cl_address(u64 address)
{
	/* return the cacheline of the address */
	return (address & ~(cacheline_size - 1));
}
189

190 191 192 193 194 195
static inline u64 cl_offset(u64 address)
{
	/* return the cacheline of the address */
	return (address & (cacheline_size - 1));
}

196 197 198 199
enum sort_mode {
	SORT_MODE__NORMAL,
	SORT_MODE__BRANCH,
	SORT_MODE__MEMORY,
200 201
	SORT_MODE__TOP,
	SORT_MODE__DIFF,
202
	SORT_MODE__TRACEPOINT,
203 204
};

205
enum sort_type {
206
	/* common sort keys */
207 208 209 210
	SORT_PID,
	SORT_COMM,
	SORT_DSO,
	SORT_SYM,
A
Arun Sharma 已提交
211 212
	SORT_PARENT,
	SORT_CPU,
213
	SORT_SOCKET,
214
	SORT_SRCLINE,
215
	SORT_SRCFILE,
216 217
	SORT_LOCAL_WEIGHT,
	SORT_GLOBAL_WEIGHT,
218
	SORT_TRANSACTION,
N
Namhyung Kim 已提交
219
	SORT_TRACE,
220
	SORT_SYM_SIZE,
221
	SORT_CGROUP_ID,
222 223 224 225

	/* branch stack specific sort keys */
	__SORT_BRANCH_STACK,
	SORT_DSO_FROM = __SORT_BRANCH_STACK,
226 227 228 229
	SORT_DSO_TO,
	SORT_SYM_FROM,
	SORT_SYM_TO,
	SORT_MISPREDICT,
230 231
	SORT_ABORT,
	SORT_IN_TX,
232
	SORT_CYCLES,
233 234
	SORT_SRCLINE_FROM,
	SORT_SRCLINE_TO,
235 236 237

	/* memory mode specific sort keys */
	__SORT_MEMORY_MODE,
238
	SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
239 240 241 242 243
	SORT_MEM_DADDR_DSO,
	SORT_MEM_LOCKED,
	SORT_MEM_TLB,
	SORT_MEM_LVL,
	SORT_MEM_SNOOP,
D
Don Zickus 已提交
244
	SORT_MEM_DCACHELINE,
245
	SORT_MEM_IADDR_SYMBOL,
246 247
};

248 249 250 251 252
/*
 * configurable sorting bits
 */

struct sort_entry {
253
	const char *se_header;
254

255 256
	int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
	int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
257
	int64_t	(*se_sort)(struct hist_entry *, struct hist_entry *);
258
	int	(*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
259
			       unsigned int width);
260
	int	(*se_filter)(struct hist_entry *he, int type, const void *arg);
261
	u8	se_width_idx;
262 263 264 265 266
};

extern struct sort_entry sort_thread;
extern struct list_head hist_entry__sort_list;

267 268 269
struct perf_evlist;
struct pevent;
int setup_sorting(struct perf_evlist *evlist);
270
int setup_output_field(void);
271
void reset_output_field(void);
272
void sort__setup_elide(FILE *fp);
273
void perf_hpp__set_elide(int idx, bool elide);
274

275 276
int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);

277
bool is_strict_order(const char *order);
278 279

int hpp_dimension__add_output(unsigned col);
280
void reset_dimensions(void);
281 282 283 284
int sort_dimension__add(struct perf_hpp_list *list, const char *tok,
			struct perf_evlist *evlist,
			int level);
int output_field_add(struct perf_hpp_list *list, char *tok);
285 286 287 288 289 290
int64_t
sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right);
int64_t
sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right);
int64_t
sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right);
J
Jiri Olsa 已提交
291
char *hist_entry__get_srcline(struct hist_entry *he);
292
#endif	/* __PERF_SORT_H */