sort.h 4.1 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 23 24 25 26 27
#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"

#include "thread.h"
#include "sort.h"

extern regex_t parent_regex;
28 29 30 31
extern const char *sort_order;
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

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

58 59 60 61 62 63 64 65
struct hist_entry_diff {
	bool	computed;

	/* PERF_HPP__DELTA */
	double	period_ratio_delta;

	/* PERF_HPP__RATIO */
	double	period_ratio;
66 67 68

	/* HISTC_WEIGHTED_DIFF */
	s64	wdiff;
69 70
};

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

90 91
	struct hist_entry_diff	diff;

92 93 94
	/* We are added by hists__add_dummy_entry. */
	bool			dummy;

95 96 97 98 99
	/* XXX These two should move to some tree widget lib */
	u16			row_offset;
	u16			nr_rows;

	bool			init_have_children;
100
	char			level;
101
	bool			used;
102
	u8			filtered;
103
	char			*srcline;
104
	struct symbol		*parent;
105
	unsigned long		position;
106
	struct rb_root		sorted_chain;
107
	struct branch_info	*branch_info;
108
	struct hists		*hists;
109 110
	struct mem_info		*mem_info;
	struct callchain_root	callchain[0]; /* must be last member */
111 112
};

113 114 115 116 117 118 119 120 121 122 123 124
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;
}

125 126
static inline void hist_entry__add_pair(struct hist_entry *pair,
					struct hist_entry *he)
127
{
128
	list_add_tail(&pair->pairs.node, &he->pairs.head);
129 130
}

131 132 133 134 135 136
enum sort_mode {
	SORT_MODE__NORMAL,
	SORT_MODE__BRANCH,
	SORT_MODE__MEMORY,
};

137
enum sort_type {
138
	/* common sort keys */
139 140 141 142
	SORT_PID,
	SORT_COMM,
	SORT_DSO,
	SORT_SYM,
A
Arun Sharma 已提交
143 144
	SORT_PARENT,
	SORT_CPU,
145
	SORT_SRCLINE,
146 147
	SORT_LOCAL_WEIGHT,
	SORT_GLOBAL_WEIGHT,
148 149 150 151

	/* branch stack specific sort keys */
	__SORT_BRANCH_STACK,
	SORT_DSO_FROM = __SORT_BRANCH_STACK,
152 153 154 155
	SORT_DSO_TO,
	SORT_SYM_FROM,
	SORT_SYM_TO,
	SORT_MISPREDICT,
156 157
	SORT_ABORT,
	SORT_IN_TX,
158 159 160

	/* memory mode specific sort keys */
	__SORT_MEMORY_MODE,
161
	SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
162 163 164 165 166
	SORT_MEM_DADDR_DSO,
	SORT_MEM_LOCKED,
	SORT_MEM_TLB,
	SORT_MEM_LVL,
	SORT_MEM_SNOOP,
167 168
};

169 170 171 172 173 174 175
/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

176
	const char *se_header;
177

178 179 180 181
	int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
	int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
	int	(*se_snprintf)(struct hist_entry *self, char *bf, size_t size,
			       unsigned int width);
182
	u8	se_width_idx;
183 184 185 186 187 188
	bool	elide;
};

extern struct sort_entry sort_thread;
extern struct list_head hist_entry__sort_list;

189
int setup_sorting(void);
190
extern int sort_dimension__add(const char *);
191
void sort__setup_elide(FILE *fp);
192

193 194
int report_parse_ignore_callees_opt(const struct option *opt, const char *arg, int unset);

195
#endif	/* __PERF_SORT_H */