blob: 544d99ac169c710bc74819418be1d297553b4b55 [file] [log] [blame]
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02001#ifndef __PERF_CALLCHAIN_H
2#define __PERF_CALLCHAIN_H
3
4#include "../perf.h"
Arnaldo Carvalho de Melo5da50252009-07-01 14:46:08 -03005#include <linux/list.h>
Arnaldo Carvalho de Melo43cbcd82009-07-01 12:28:37 -03006#include <linux/rbtree.h>
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -03007#include "event.h"
Frederic Weisbecker44249612009-07-01 05:35:14 +02008#include "symbol.h"
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02009
Namhyung Kim76a26542015-10-22 23:28:32 +090010#define HELP_PAD "\t\t\t\t"
11
12#define CALLCHAIN_HELP "setup and enables call-graph (stack chain/backtrace):\n\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090013
14#ifdef HAVE_DWARF_UNWIND_SUPPORT
Namhyung Kim76a26542015-10-22 23:28:32 +090015# define RECORD_MODE_HELP HELP_PAD "record_mode:\tcall graph recording mode (fp|dwarf|lbr)\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090016#else
Namhyung Kim76a26542015-10-22 23:28:32 +090017# define RECORD_MODE_HELP HELP_PAD "record_mode:\tcall graph recording mode (fp|lbr)\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090018#endif
19
Namhyung Kim76a26542015-10-22 23:28:32 +090020#define RECORD_SIZE_HELP \
21 HELP_PAD "record_size:\tif record_mode is 'dwarf', max size of stack recording (<bytes>)\n" \
22 HELP_PAD "\t\tdefault: 8192 (bytes)\n"
23
24#define CALLCHAIN_RECORD_HELP CALLCHAIN_HELP RECORD_MODE_HELP RECORD_SIZE_HELP
25
26#define CALLCHAIN_REPORT_HELP \
Namhyung Kim26e77922015-11-09 14:45:37 +090027 HELP_PAD "print_type:\tcall graph printing style (graph|flat|fractal|folded|none)\n" \
Namhyung Kim76a26542015-10-22 23:28:32 +090028 HELP_PAD "threshold:\tminimum call graph inclusion threshold (<percent>)\n" \
29 HELP_PAD "print_limit:\tmaximum number of call graph entry (<number>)\n" \
30 HELP_PAD "order:\t\tcall graph order (caller|callee)\n" \
31 HELP_PAD "sort_key:\tcall graph sort key (function|address)\n" \
32 HELP_PAD "branch:\t\tinclude last branch info to call graph (branch)\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090033
Jiri Olsa2c83bc02014-05-05 12:46:17 +020034enum perf_call_graph_mode {
35 CALLCHAIN_NONE,
36 CALLCHAIN_FP,
37 CALLCHAIN_DWARF,
Kan Liangaad2b212015-01-05 13:23:04 -050038 CALLCHAIN_LBR,
Jiri Olsa2c83bc02014-05-05 12:46:17 +020039 CALLCHAIN_MAX
40};
41
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020042enum chain_mode {
Frederic Weisbeckerb1a88342009-08-08 02:16:24 +020043 CHAIN_NONE,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020044 CHAIN_FLAT,
45 CHAIN_GRAPH_ABS,
Namhyung Kim26e77922015-11-09 14:45:37 +090046 CHAIN_GRAPH_REL,
47 CHAIN_FOLDED,
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020048};
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020049
Sam Liaod797fdc2011-06-07 23:49:46 +080050enum chain_order {
51 ORDER_CALLER,
52 ORDER_CALLEE
53};
54
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020055struct callchain_node {
56 struct callchain_node *parent;
Ingo Molnarf37a2912009-07-01 12:37:06 +020057 struct list_head val;
Namhyung Kime3695172013-10-11 14:15:36 +090058 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
59 struct rb_node rb_node; /* to sort nodes in an output tree */
60 struct rb_root rb_root_in; /* input tree of children */
61 struct rb_root rb_root; /* sorted output tree of children */
Ingo Molnarf37a2912009-07-01 12:37:06 +020062 unsigned int val_nr;
63 u64 hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +020064 u64 children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020065};
66
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020067struct callchain_root {
68 u64 max_depth;
69 struct callchain_node node;
70};
71
Frederic Weisbecker805d1272009-07-05 07:39:21 +020072struct callchain_param;
73
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020074typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020075 u64, struct callchain_param *);
76
Andi Kleen99571ab2013-07-18 15:33:57 -070077enum chain_key {
78 CCKEY_FUNCTION,
79 CCKEY_ADDRESS
80};
81
Frederic Weisbecker805d1272009-07-05 07:39:21 +020082struct callchain_param {
Namhyung Kim72a128a2014-09-23 10:01:41 +090083 bool enabled;
84 enum perf_call_graph_mode record_mode;
85 u32 dump_size;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020086 enum chain_mode mode;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -030087 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020088 double min_percent;
89 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +080090 enum chain_order order;
Namhyung Kim792aeaf2015-10-22 16:45:46 +090091 bool order_set;
Andi Kleen99571ab2013-07-18 15:33:57 -070092 enum chain_key key;
Andi Kleen8b7bad52014-11-12 18:05:20 -080093 bool branch_callstack;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020094};
95
Arnaldo Carvalho de Melo8f651ea2014-10-09 16:12:24 -030096extern struct callchain_param callchain_param;
97
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020098struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +020099 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -0300100 struct map_symbol ms;
Namhyung Kim3698dab2015-05-05 23:55:46 +0900101 struct /* for TUI */ {
102 bool unfolded;
103 bool has_children;
104 };
Andi Kleen23f09812014-11-12 18:05:24 -0800105 char *srcline;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200106 struct list_head list;
107};
108
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100109/*
110 * A callchain cursor is a single linked list that
111 * let one feed a callchain progressively.
Masanari Iida3fd44cd2012-07-18 01:20:59 +0900112 * It keeps persistent allocated entries to minimize
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100113 * allocations.
114 */
115struct callchain_cursor_node {
116 u64 ip;
117 struct map *map;
118 struct symbol *sym;
119 struct callchain_cursor_node *next;
120};
121
122struct callchain_cursor {
123 u64 nr;
124 struct callchain_cursor_node *first;
125 struct callchain_cursor_node **last;
126 u64 pos;
127 struct callchain_cursor_node *curr;
128};
129
Namhyung Kim47260642012-05-31 14:43:26 +0900130extern __thread struct callchain_cursor callchain_cursor;
131
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200132static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200133{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200134 INIT_LIST_HEAD(&root->node.val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +0200135
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200136 root->node.parent = NULL;
137 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +0200138 root->node.children_hit = 0;
Namhyung Kime3695172013-10-11 14:15:36 +0900139 root->node.rb_root_in = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200140 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200141}
142
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100143static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200144{
145 return node->hit + node->children_hit;
146}
147
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100148int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100149int callchain_append(struct callchain_root *root,
150 struct callchain_cursor *cursor,
151 u64 period);
152
153int callchain_merge(struct callchain_cursor *cursor,
154 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300155
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100156/*
157 * Initialize a cursor before adding entries inside, but keep
158 * the previously allocated entries as a cache.
159 */
160static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
161{
162 cursor->nr = 0;
163 cursor->last = &cursor->first;
164}
165
166int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
167 struct map *map, struct symbol *sym);
168
169/* Close a cursor writing session. Initialize for the reader */
170static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
171{
172 cursor->curr = cursor->first;
173 cursor->pos = 0;
174}
175
176/* Cursor reading iteration helpers */
177static inline struct callchain_cursor_node *
178callchain_cursor_current(struct callchain_cursor *cursor)
179{
180 if (cursor->pos == cursor->nr)
181 return NULL;
182
183 return cursor->curr;
184}
185
186static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
187{
188 cursor->curr = cursor->curr->next;
189 cursor->pos++;
190}
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300191
192struct option;
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900193struct hist_entry;
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300194
195int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
Jiri Olsa09b0fd42013-10-26 16:25:33 +0200196int record_callchain_opt(const struct option *opt, const char *arg, int unset);
197
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900198int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
199 struct perf_evsel *evsel, struct addr_location *al,
200 int max_stack);
201int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
Namhyung Kimc7405d82013-10-31 13:58:30 +0900202int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
203 bool hide_unresolved);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900204
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300205extern const char record_callchain_help[];
Kan Liang076a30c2015-08-06 15:44:52 -0400206extern int parse_callchain_record(const char *arg, struct callchain_param *param);
Kan Liangc3a6a8c2015-08-04 04:30:20 -0400207int parse_callchain_record_opt(const char *arg, struct callchain_param *param);
Don Zickuscff6bb42014-04-07 14:55:24 -0400208int parse_callchain_report_opt(const char *arg);
Namhyung Kima2c10d32015-10-22 15:28:49 +0900209int parse_callchain_top_opt(const char *arg);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900210int perf_callchain_config(const char *var, const char *value);
Namhyung Kimbe1f13e2012-09-10 13:38:00 +0900211
212static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
213 struct callchain_cursor *src)
214{
215 *dest = *src;
216
217 dest->first = src->curr;
218 dest->nr -= src->pos;
219}
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700220
221#ifdef HAVE_SKIP_CALLCHAIN_IDX
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300222extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700223#else
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300224static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700225 struct ip_callchain *chain __maybe_unused)
226{
227 return -1;
228}
229#endif
230
Andi Kleen2989cca2014-11-12 18:05:23 -0800231char *callchain_list__sym_name(struct callchain_list *cl,
232 char *bf, size_t bfsize, bool show_dso);
233
Namhyung Kimd1149602014-12-30 14:38:13 +0900234void free_callchain(struct callchain_root *root);
235
John Kacur8b40f522009-09-24 18:02:18 +0200236#endif /* __PERF_CALLCHAIN_H */