sort.h 5.0 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
#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"

#include "parse-options.h"
#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 31
extern const char default_parent_pattern[];
extern const char *parent_pattern;
extern const char default_sort_order[];
32 33
extern regex_t ignore_callees_regex;
extern int have_ignore_callees;
34 35
extern int sort__need_collapse;
extern int sort__has_parent;
N
Namhyung Kim 已提交
36
extern int sort__has_sym;
37
extern enum sort_mode sort__mode;
38 39 40 41
extern struct sort_entry sort_comm;
extern struct sort_entry sort_dso;
extern struct sort_entry sort_sym;
extern struct sort_entry sort_parent;
42 43 44 45
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;
46
extern enum sort_type sort__first_dimension;
47
extern const char default_mem_sort_order[];
48

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

59 60
struct hist_entry_diff {
	bool	computed;
61 62 63
	union {
		/* PERF_HPP__DELTA */
		double	period_ratio_delta;
64

65 66
		/* PERF_HPP__RATIO */
		double	period_ratio;
67

68 69 70
		/* HISTC_WEIGHTED_DIFF */
		s64	wdiff;
	};
71 72
};

73 74 75 76 77 78
/**
 * 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
 */
79
struct hist_entry {
80
	struct rb_node		rb_node_in;
81
	struct rb_node		rb_node;
82 83 84 85
	union {
		struct list_head node;
		struct list_head head;
	} pairs;
86
	struct he_stat		stat;
87
	struct he_stat		*stat_acc;
88
	struct map_symbol	ms;
89
	struct thread		*thread;
90
	struct comm		*comm;
91
	u64			ip;
92
	u64			transaction;
A
Arun Sharma 已提交
93
	s32			cpu;
94
	u8			cpumode;
95

96 97 98
	/* We are added by hists__add_dummy_entry. */
	bool			dummy;

99
	char			level;
100
	u8			filtered;
101 102 103 104 105 106 107 108 109 110
	union {
		/*
		 * Since perf diff only supports the stdio output, TUI
		 * fields are only accessed from perf report (or perf
		 * top).  So make it an union to reduce memory usage.
		 */
		struct hist_entry_diff	diff;
		struct /* for TUI */ {
			u16	row_offset;
			u16	nr_rows;
111
			bool	init_have_children;
112 113
		};
	};
114
	char			*srcline;
115
	struct symbol		*parent;
116
	struct rb_root		sorted_chain;
117
	struct branch_info	*branch_info;
118
	struct hists		*hists;
119 120
	struct mem_info		*mem_info;
	struct callchain_root	callchain[0]; /* must be last member */
121 122
};

123 124 125 126 127 128 129 130 131 132 133 134
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;
}

135 136
static inline void hist_entry__add_pair(struct hist_entry *pair,
					struct hist_entry *he)
137
{
138
	list_add_tail(&pair->pairs.node, &he->pairs.head);
139 140
}

141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
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;
}


156 157 158 159
enum sort_mode {
	SORT_MODE__NORMAL,
	SORT_MODE__BRANCH,
	SORT_MODE__MEMORY,
160 161
	SORT_MODE__TOP,
	SORT_MODE__DIFF,
162 163
};

164
enum sort_type {
165
	/* common sort keys */
166 167 168 169
	SORT_PID,
	SORT_COMM,
	SORT_DSO,
	SORT_SYM,
A
Arun Sharma 已提交
170 171
	SORT_PARENT,
	SORT_CPU,
172
	SORT_SRCLINE,
173 174
	SORT_LOCAL_WEIGHT,
	SORT_GLOBAL_WEIGHT,
175
	SORT_TRANSACTION,
176 177 178 179

	/* branch stack specific sort keys */
	__SORT_BRANCH_STACK,
	SORT_DSO_FROM = __SORT_BRANCH_STACK,
180 181 182 183
	SORT_DSO_TO,
	SORT_SYM_FROM,
	SORT_SYM_TO,
	SORT_MISPREDICT,
184 185
	SORT_ABORT,
	SORT_IN_TX,
186 187 188

	/* memory mode specific sort keys */
	__SORT_MEMORY_MODE,
189
	SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
190 191 192 193 194
	SORT_MEM_DADDR_DSO,
	SORT_MEM_LOCKED,
	SORT_MEM_TLB,
	SORT_MEM_LVL,
	SORT_MEM_SNOOP,
D
Don Zickus 已提交
195
	SORT_MEM_DCACHELINE,
196 197
};

198 199 200 201 202 203 204
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

205
	const char *se_header;
206

207 208
	int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
	int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
209
	int64_t	(*se_sort)(struct hist_entry *, struct hist_entry *);
210
	int	(*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
211
			       unsigned int width);
212
	u8	se_width_idx;
213 214 215 216 217
};

extern struct sort_entry sort_thread;
extern struct list_head hist_entry__sort_list;

218
int setup_sorting(void);
219
int setup_output_field(void);
220
void reset_output_field(void);
221
extern int sort_dimension__add(const char *);
222
void sort__setup_elide(FILE *fp);
223
void perf_hpp__set_elide(int idx, bool elide);
224

225 226
int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);

227
bool is_strict_order(const char *order);
228
#endif	/* __PERF_SORT_H */