callchain.h 6.16 KB
Newer Older
1 2 3 4
#ifndef __PERF_CALLCHAIN_H
#define __PERF_CALLCHAIN_H

#include "../perf.h"
5
#include <linux/list.h>
6
#include <linux/rbtree.h>
7
#include "event.h"
8
#include "symbol.h"
9

10 11 12
#define HELP_PAD "\t\t\t\t"

#define CALLCHAIN_HELP "setup and enables call-graph (stack chain/backtrace):\n\n"
13 14

#ifdef HAVE_DWARF_UNWIND_SUPPORT
15
# define RECORD_MODE_HELP  HELP_PAD "record_mode:\tcall graph recording mode (fp|dwarf|lbr)\n"
16
#else
17
# define RECORD_MODE_HELP  HELP_PAD "record_mode:\tcall graph recording mode (fp|lbr)\n"
18 19
#endif

20 21 22 23 24 25 26 27 28 29 30 31 32
#define RECORD_SIZE_HELP						\
	HELP_PAD "record_size:\tif record_mode is 'dwarf', max size of stack recording (<bytes>)\n" \
	HELP_PAD "\t\tdefault: 8192 (bytes)\n"

#define CALLCHAIN_RECORD_HELP  CALLCHAIN_HELP RECORD_MODE_HELP RECORD_SIZE_HELP

#define CALLCHAIN_REPORT_HELP						\
	HELP_PAD "print_type:\tcall graph printing style (graph|flat|fractal|none)\n" \
	HELP_PAD "threshold:\tminimum call graph inclusion threshold (<percent>)\n" \
	HELP_PAD "print_limit:\tmaximum number of call graph entry (<number>)\n" \
	HELP_PAD "order:\t\tcall graph order (caller|callee)\n" \
	HELP_PAD "sort_key:\tcall graph sort key (function|address)\n"	\
	HELP_PAD "branch:\t\tinclude last branch info to call graph (branch)\n"
33

34 35 36 37
enum perf_call_graph_mode {
	CALLCHAIN_NONE,
	CALLCHAIN_FP,
	CALLCHAIN_DWARF,
38
	CALLCHAIN_LBR,
39 40 41
	CALLCHAIN_MAX
};

42
enum chain_mode {
43
	CHAIN_NONE,
44 45 46
	CHAIN_FLAT,
	CHAIN_GRAPH_ABS,
	CHAIN_GRAPH_REL
47
};
48

49 50 51 52 53
enum chain_order {
	ORDER_CALLER,
	ORDER_CALLEE
};

54 55
struct callchain_node {
	struct callchain_node	*parent;
56
	struct list_head	val;
57 58 59 60
	struct rb_node		rb_node_in; /* to insert nodes in an rbtree */
	struct rb_node		rb_node;    /* to sort nodes in an output tree */
	struct rb_root		rb_root_in; /* input tree of children */
	struct rb_root		rb_root;    /* sorted output tree of children */
61 62
	unsigned int		val_nr;
	u64			hit;
63
	u64			children_hit;
64 65
};

66 67 68 69 70
struct callchain_root {
	u64			max_depth;
	struct callchain_node	node;
};

71 72
struct callchain_param;

73
typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
74 75
				 u64, struct callchain_param *);

76 77 78 79 80
enum chain_key {
	CCKEY_FUNCTION,
	CCKEY_ADDRESS
};

81
struct callchain_param {
82 83 84
	bool			enabled;
	enum perf_call_graph_mode record_mode;
	u32			dump_size;
85
	enum chain_mode 	mode;
86
	u32			print_limit;
87 88
	double			min_percent;
	sort_chain_func_t	sort;
89
	enum chain_order	order;
90
	bool			order_set;
91
	enum chain_key		key;
92
	bool			branch_callstack;
93 94
};

95 96
extern struct callchain_param callchain_param;

97
struct callchain_list {
98
	u64			ip;
99
	struct map_symbol	ms;
100 101 102 103
	struct /* for TUI */ {
		bool		unfolded;
		bool		has_children;
	};
104
	char		       *srcline;
105 106 107
	struct list_head	list;
};

108 109 110
/*
 * A callchain cursor is a single linked list that
 * let one feed a callchain progressively.
111
 * It keeps persistent allocated entries to minimize
112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128
 * allocations.
 */
struct callchain_cursor_node {
	u64				ip;
	struct map			*map;
	struct symbol			*sym;
	struct callchain_cursor_node	*next;
};

struct callchain_cursor {
	u64				nr;
	struct callchain_cursor_node	*first;
	struct callchain_cursor_node	**last;
	u64				pos;
	struct callchain_cursor_node	*curr;
};

129 130
extern __thread struct callchain_cursor callchain_cursor;

131
static inline void callchain_init(struct callchain_root *root)
132
{
133
	INIT_LIST_HEAD(&root->node.val);
134

135 136
	root->node.parent = NULL;
	root->node.hit = 0;
137
	root->node.children_hit = 0;
138
	root->node.rb_root_in = RB_ROOT;
139
	root->max_depth = 0;
140 141
}

142
static inline u64 callchain_cumul_hits(struct callchain_node *node)
143 144 145 146
{
	return node->hit + node->children_hit;
}

147
int callchain_register_param(struct callchain_param *param);
148 149 150 151 152 153
int callchain_append(struct callchain_root *root,
		     struct callchain_cursor *cursor,
		     u64 period);

int callchain_merge(struct callchain_cursor *cursor,
		    struct callchain_root *dst, struct callchain_root *src);
154

155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189
/*
 * Initialize a cursor before adding entries inside, but keep
 * the previously allocated entries as a cache.
 */
static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
{
	cursor->nr = 0;
	cursor->last = &cursor->first;
}

int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
			    struct map *map, struct symbol *sym);

/* Close a cursor writing session. Initialize for the reader */
static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
{
	cursor->curr = cursor->first;
	cursor->pos = 0;
}

/* Cursor reading iteration helpers */
static inline struct callchain_cursor_node *
callchain_cursor_current(struct callchain_cursor *cursor)
{
	if (cursor->pos == cursor->nr)
		return NULL;

	return cursor->curr;
}

static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
{
	cursor->curr = cursor->curr->next;
	cursor->pos++;
}
190 191

struct option;
192
struct hist_entry;
193 194

int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
195 196
int record_callchain_opt(const struct option *opt, const char *arg, int unset);

197 198 199 200
int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
			      struct perf_evsel *evsel, struct addr_location *al,
			      int max_stack);
int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
201 202
int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
			bool hide_unresolved);
203

204
extern const char record_callchain_help[];
205
extern int parse_callchain_record(const char *arg, struct callchain_param *param);
206
int parse_callchain_record_opt(const char *arg, struct callchain_param *param);
207
int parse_callchain_report_opt(const char *arg);
208
int parse_callchain_top_opt(const char *arg);
209
int perf_callchain_config(const char *var, const char *value);
210 211 212 213 214 215 216 217 218

static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
					     struct callchain_cursor *src)
{
	*dest = *src;

	dest->first = src->curr;
	dest->nr -= src->pos;
}
219 220

#ifdef HAVE_SKIP_CALLCHAIN_IDX
221
extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
222
#else
223
static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
224 225 226 227 228 229
			struct ip_callchain *chain __maybe_unused)
{
	return -1;
}
#endif

230 231 232
char *callchain_list__sym_name(struct callchain_list *cl,
			       char *bf, size_t bfsize, bool show_dso);

233 234
void free_callchain(struct callchain_root *root);

235
#endif	/* __PERF_CALLCHAIN_H */