[deliverable/linux.git] / tools / perf / util / sort.h

#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 <subcmd/parse-options.h>
#include "parse-events.h"
#include "hist.h"
#include "thread.h"

extern regex_t parent_regex;
extern const char *sort_order;
extern const char *field_order;
extern const char default_parent_pattern[];
extern const char *parent_pattern;
extern const char *default_sort_order;
extern regex_t ignore_callees_regex;
extern int have_ignore_callees;
extern enum sort_mode sort__mode;
extern struct sort_entry sort_comm;
extern struct sort_entry sort_dso;
extern struct sort_entry sort_sym;
extern struct sort_entry sort_parent;
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;
extern enum sort_type sort__first_dimension;
extern const char default_mem_sort_order[];

struct he_stat {
	u64			period;
	u64			period_sys;
	u64			period_us;
	u64			period_guest_sys;
	u64			period_guest_us;
	u64			weight;
	u32			nr_events;
};

struct hist_entry_diff {
	bool	computed;
	union {
		/* PERF_HPP__DELTA */
		double	period_ratio_delta;

		/* PERF_HPP__RATIO */
		double	period_ratio;

		/* HISTC_WEIGHTED_DIFF */
		s64	wdiff;
	};
};

struct hist_entry_ops {
	void	*(*new)(size_t size);
	void	(*free)(void *ptr);
};

/**
 * 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
 */
struct hist_entry {
	struct rb_node		rb_node_in;
	struct rb_node		rb_node;
	union {
		struct list_head node;
		struct list_head head;
	} pairs;
	struct he_stat		stat;
	struct he_stat		*stat_acc;
	struct map_symbol	ms;
	struct thread		*thread;
	struct comm		*comm;
	u64			ip;
	u64			transaction;
	s32			socket;
	s32			cpu;
	u8			cpumode;
	u8			depth;

	/* We are added by hists__add_dummy_entry. */
	bool			dummy;
	bool			leaf;

	char			level;
	u8			filtered;
	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;
			bool	init_have_children;
			bool	unfolded;
			bool	has_children;
			bool	has_no_entry;
		};
	};
	char			*srcline;
	char			*srcfile;
	struct symbol		*parent;
	struct branch_info	*branch_info;
	struct hists		*hists;
	struct mem_info		*mem_info;
	void			*raw_data;
	u32			raw_size;
	void			*trace_output;
	struct perf_hpp_list	*hpp_list;
	struct hist_entry	*parent_he;
	struct hist_entry_ops	*ops;
	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 */
	};
	struct callchain_root	callchain[0]; /* must be last member */
};

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;
}

static inline void hist_entry__add_pair(struct hist_entry *pair,
					struct hist_entry *he)
{
	list_add_tail(&pair->pairs.node, &he->pairs.head);
}

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;
}

static inline u64 cl_address(u64 address)
{
	/* return the cacheline of the address */
	return (address & ~(cacheline_size - 1));
}

static inline u64 cl_offset(u64 address)
{
	/* return the cacheline of the address */
	return (address & (cacheline_size - 1));
}

enum sort_mode {
	SORT_MODE__NORMAL,
	SORT_MODE__BRANCH,
	SORT_MODE__MEMORY,
	SORT_MODE__TOP,
	SORT_MODE__DIFF,
	SORT_MODE__TRACEPOINT,
};

enum sort_type {
	/* common sort keys */
	SORT_PID,
	SORT_COMM,
	SORT_DSO,
	SORT_SYM,
	SORT_PARENT,
	SORT_CPU,
	SORT_SOCKET,
	SORT_SRCLINE,
	SORT_SRCFILE,
	SORT_LOCAL_WEIGHT,
	SORT_GLOBAL_WEIGHT,
	SORT_TRANSACTION,
	SORT_TRACE,

	/* branch stack specific sort keys */
	__SORT_BRANCH_STACK,
	SORT_DSO_FROM = __SORT_BRANCH_STACK,
	SORT_DSO_TO,
	SORT_SYM_FROM,
	SORT_SYM_TO,
	SORT_MISPREDICT,
	SORT_ABORT,
	SORT_IN_TX,
	SORT_CYCLES,
	SORT_SRCLINE_FROM,
	SORT_SRCLINE_TO,

	/* memory mode specific sort keys */
	__SORT_MEMORY_MODE,
	SORT_MEM_DADDR_SYMBOL = __SORT_MEMORY_MODE,
	SORT_MEM_DADDR_DSO,
	SORT_MEM_LOCKED,
	SORT_MEM_TLB,
	SORT_MEM_LVL,
	SORT_MEM_SNOOP,
	SORT_MEM_DCACHELINE,
	SORT_MEM_IADDR_SYMBOL,
};

/*
 * configurable sorting bits
 */

struct sort_entry {
	const char *se_header;

	int64_t (*se_cmp)(struct hist_entry *, struct hist_entry *);
	int64_t (*se_collapse)(struct hist_entry *, struct hist_entry *);
	int64_t	(*se_sort)(struct hist_entry *, struct hist_entry *);
	int	(*se_snprintf)(struct hist_entry *he, char *bf, size_t size,
			       unsigned int width);
	int	(*se_filter)(struct hist_entry *he, int type, const void *arg);
	u8	se_width_idx;
};

extern struct sort_entry sort_thread;
extern struct list_head hist_entry__sort_list;

struct perf_evlist;
struct pevent;
int setup_sorting(struct perf_evlist *evlist);
int setup_output_field(void);
void reset_output_field(void);
void sort__setup_elide(FILE *fp);
void perf_hpp__set_elide(int idx, bool elide);

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

bool is_strict_order(const char *order);

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