[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 "parse-options.h"
#include "parse-events.h"

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

extern regex_t parent_regex;
extern const char *sort_order;
extern const char default_parent_pattern[];
extern const char *parent_pattern;
extern const char default_sort_order[];
extern int sort__need_collapse;
extern int sort__has_parent;
extern char *field_sep;
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 enum sort_type sort__first_dimension;

/**
 * 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;
	u64			period;
	u64			period_sys;
	u64			period_us;
	u64			period_guest_sys;
	u64			period_guest_us;
	struct map_symbol	ms;
	struct thread		*thread;
	u64			ip;
	s32			cpu;
	u32			nr_events;

	/* XXX These two should move to some tree widget lib */
	u16			row_offset;
	u16			nr_rows;

	bool			init_have_children;
	char			level;
	u8			filtered;
	struct symbol		*parent;
	union {
		unsigned long	  position;
		struct hist_entry *pair;
		struct rb_root	  sorted_chain;
	};
	struct callchain_root	callchain[0];
};

enum sort_type {
	SORT_PID,
	SORT_COMM,
	SORT_DSO,
	SORT_SYM,
	SORT_PARENT,
	SORT_CPU,
};

/*
 * configurable sorting bits
 */

struct sort_entry {
	struct list_head list;

	const char *se_header;

	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);
	u8	se_width_idx;
	bool	elide;
};

extern struct sort_entry sort_thread;
extern struct list_head hist_entry__sort_list;

void setup_sorting(const char * const usagestr[], const struct option *opts);
extern int sort_dimension__add(const char *);
void sort_entry__setup_elide(struct sort_entry *self, struct strlist *list,
			     const char *list_name, FILE *fp);

#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
	21	#include "parse-options.h"
	22	#include "parse-events.h"
	23
	24	#include "thread.h"
	25	#include "sort.h"
	26
	27	extern regex_t parent_regex;
edb7c60e ACM	28	extern const char *sort_order;
	29	extern const char default_parent_pattern[];
	30	extern const char *parent_pattern;
	31	extern const char default_sort_order[];
dd68ada2 JK	32	extern int sort__need_collapse;
	33	extern int sort__has_parent;
	34	extern char *field_sep;
	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;
a4fb581b	39	extern enum sort_type sort__first_dimension;
dd68ada2	40
0f0cbf7a ACM	41	/**
	42	* struct hist_entry - histogram entry
	43	*
	44	* @row_offset - offset from the first callchain expanded to appear on screen
	45	* @nr_rows - rows expanded in callchain, recalculated on folding/unfolding
	46	*/
dd68ada2	47	struct hist_entry {
1980c2eb	48	struct rb_node rb_node_in;
dd68ada2	49	struct rb_node rb_node;
c82ee828 ACM	50	u64 period;
	51	u64 period_sys;
	52	u64 period_us;
	53	u64 period_guest_sys;
	54	u64 period_guest_us;
59fd5306	55	struct map_symbol ms;
a5e29aca	56	struct thread *thread;
dd68ada2	57	u64 ip;
f60f3593	58	s32 cpu;
c82ee828	59	u32 nr_events;
0f0cbf7a ACM	60
	61	/* XXX These two should move to some tree widget lib */
	62	u16 row_offset;
	63	u16 nr_rows;
	64
	65	bool init_have_children;
dd68ada2	66	char level;
a5e29aca	67	u8 filtered;
83753190	68	struct symbol *parent;
86a9eee0 ACM	69	union {
	70	unsigned long position;
	71	struct hist_entry *pair;
	72	struct rb_root sorted_chain;
	73	};
d2009c51	74	struct callchain_root callchain[0];
dd68ada2 JK	75	};
dd68ada2 JK	76
a4fb581b FW	77	enum sort_type {
	78	SORT_PID,
	79	SORT_COMM,
	80	SORT_DSO,
	81	SORT_SYM,
f60f3593 AS	82	SORT_PARENT,
f60f3593 AS	83	SORT_CPU,
a4fb581b FW	84	};
a4fb581b FW	85
dd68ada2 JK	86	/*
	87	* configurable sorting bits
	88	*/
	89
	90	struct sort_entry {
	91	struct list_head list;
	92
fcd14984	93	const char *se_header;
dd68ada2	94
fcd14984 FW	95	int64_t (se_cmp)(struct hist_entry , struct hist_entry *);
	96	int64_t (se_collapse)(struct hist_entry , struct hist_entry *);
	97	int (se_snprintf)(struct hist_entry self, char *bf, size_t size,
	98	unsigned int width);
8a6c5b26	99	u8 se_width_idx;
dd68ada2 JK	100	bool elide;
	101	};
	102
	103	extern struct sort_entry sort_thread;
	104	extern struct list_head hist_entry__sort_list;
	105
c8829c7a	106	void setup_sorting(const char * const usagestr[], const struct option *opts);
dd68ada2	107	extern int sort_dimension__add(const char *);
c351c281 ACM	108	void sort_entry__setup_elide(struct sort_entry self, struct strlist list,
c351c281 ACM	109	const char list_name, FILE fp);
dd68ada2 JK	110
dd68ada2 JK	111	#endif /* __PERF_SORT_H */