blob: 5824134f983b001cfe38474122c1bfbc41ccbbde [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02002#ifndef __PERF_CALLCHAIN_H
3#define __PERF_CALLCHAIN_H
4
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 Melo9f4e8ff2019-01-27 12:02:41 +01007#include "map_symbol.h"
Jin Yaob851dd42017-07-18 20:13:15 +08008#include "branch.h"
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02009
Arnaldo Carvalho de Melo9c9e7542019-09-10 17:24:07 +010010struct addr_location;
Arnaldo Carvalho de Melo4cb3c6d2019-08-29 17:19:02 -030011struct evsel;
Arnaldo Carvalho de Melo9c9e7542019-09-10 17:24:07 +010012struct ip_callchain;
Arnaldo Carvalho de Melo7b644f92019-01-27 11:55:39 +010013struct map;
Arnaldo Carvalho de Melo9c9e7542019-09-10 17:24:07 +010014struct perf_sample;
15struct thread;
Jin Yao28904f42020-10-09 10:28:43 +080016struct hists;
Arnaldo Carvalho de Melo7b644f92019-01-27 11:55:39 +010017
Namhyung Kim76a26542015-10-22 23:28:32 +090018#define HELP_PAD "\t\t\t\t"
19
20#define CALLCHAIN_HELP "setup and enables call-graph (stack chain/backtrace):\n\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090021
Namhyung Kim76a26542015-10-22 23:28:32 +090022# define RECORD_MODE_HELP HELP_PAD "record_mode:\tcall graph recording mode (fp|dwarf|lbr)\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090023
Namhyung Kim76a26542015-10-22 23:28:32 +090024#define RECORD_SIZE_HELP \
25 HELP_PAD "record_size:\tif record_mode is 'dwarf', max size of stack recording (<bytes>)\n" \
26 HELP_PAD "\t\tdefault: 8192 (bytes)\n"
27
28#define CALLCHAIN_RECORD_HELP CALLCHAIN_HELP RECORD_MODE_HELP RECORD_SIZE_HELP
29
30#define CALLCHAIN_REPORT_HELP \
Namhyung Kim26e77922015-11-09 14:45:37 +090031 HELP_PAD "print_type:\tcall graph printing style (graph|flat|fractal|folded|none)\n" \
Namhyung Kim76a26542015-10-22 23:28:32 +090032 HELP_PAD "threshold:\tminimum call graph inclusion threshold (<percent>)\n" \
33 HELP_PAD "print_limit:\tmaximum number of call graph entry (<number>)\n" \
34 HELP_PAD "order:\t\tcall graph order (caller|callee)\n" \
35 HELP_PAD "sort_key:\tcall graph sort key (function|address)\n" \
Namhyung Kimf2af0082015-11-09 14:45:41 +090036 HELP_PAD "branch:\t\tinclude last branch info to call graph (branch)\n" \
37 HELP_PAD "value:\t\tcall graph value (percent|period|count)\n"
Namhyung Kim21cf6282015-10-22 15:28:48 +090038
Jiri Olsa2c83bc02014-05-05 12:46:17 +020039enum perf_call_graph_mode {
40 CALLCHAIN_NONE,
41 CALLCHAIN_FP,
42 CALLCHAIN_DWARF,
Kan Liangaad2b212015-01-05 13:23:04 -050043 CALLCHAIN_LBR,
Jiri Olsa2c83bc02014-05-05 12:46:17 +020044 CALLCHAIN_MAX
45};
46
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020047enum chain_mode {
Frederic Weisbeckerb1a88342009-08-08 02:16:24 +020048 CHAIN_NONE,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020049 CHAIN_FLAT,
50 CHAIN_GRAPH_ABS,
Namhyung Kim26e77922015-11-09 14:45:37 +090051 CHAIN_GRAPH_REL,
52 CHAIN_FOLDED,
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020053};
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020054
Sam Liaod797fdc2011-06-07 23:49:46 +080055enum chain_order {
56 ORDER_CALLER,
57 ORDER_CALLEE
58};
59
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020060struct callchain_node {
61 struct callchain_node *parent;
Ingo Molnarf37a2912009-07-01 12:37:06 +020062 struct list_head val;
Namhyung Kim4b3a3212015-11-09 14:45:43 +090063 struct list_head parent_val;
Namhyung Kime3695172013-10-11 14:15:36 +090064 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
65 struct rb_node rb_node; /* to sort nodes in an output tree */
66 struct rb_root rb_root_in; /* input tree of children */
67 struct rb_root rb_root; /* sorted output tree of children */
Ingo Molnarf37a2912009-07-01 12:37:06 +020068 unsigned int val_nr;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +090069 unsigned int count;
70 unsigned int children_count;
Ingo Molnarf37a2912009-07-01 12:37:06 +020071 u64 hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +020072 u64 children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020073};
74
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020075struct callchain_root {
76 u64 max_depth;
77 struct callchain_node node;
78};
79
Frederic Weisbecker805d1272009-07-05 07:39:21 +020080struct callchain_param;
81
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020082typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020083 u64, struct callchain_param *);
84
Andi Kleen99571ab2013-07-18 15:33:57 -070085enum chain_key {
86 CCKEY_FUNCTION,
Milian Wolff5dfa2102017-03-18 22:49:28 +010087 CCKEY_ADDRESS,
88 CCKEY_SRCLINE
Andi Kleen99571ab2013-07-18 15:33:57 -070089};
90
Namhyung Kimf2af0082015-11-09 14:45:41 +090091enum chain_value {
92 CCVAL_PERCENT,
93 CCVAL_PERIOD,
94 CCVAL_COUNT,
95};
96
Arnaldo Carvalho de Meloeabad8c2018-01-15 16:48:46 -030097extern bool dwarf_callchain_users;
98
Frederic Weisbecker805d1272009-07-05 07:39:21 +020099struct callchain_param {
Namhyung Kim72a128a2014-09-23 10:01:41 +0900100 bool enabled;
101 enum perf_call_graph_mode record_mode;
102 u32 dump_size;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200103 enum chain_mode mode;
Arnaldo Carvalho de Melo792d48b2016-04-28 19:03:42 -0300104 u16 max_stack;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -0300105 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200106 double min_percent;
107 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +0800108 enum chain_order order;
Namhyung Kim792aeaf2015-10-22 16:45:46 +0900109 bool order_set;
Andi Kleen99571ab2013-07-18 15:33:57 -0700110 enum chain_key key;
Andi Kleen8b7bad52014-11-12 18:05:20 -0800111 bool branch_callstack;
Namhyung Kimf2af0082015-11-09 14:45:41 +0900112 enum chain_value value;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200113};
114
Arnaldo Carvalho de Melo8f651ea2014-10-09 16:12:24 -0300115extern struct callchain_param callchain_param;
Jiri Olsa347ca872016-07-04 14:16:21 +0200116extern struct callchain_param callchain_param_default;
Arnaldo Carvalho de Melo8f651ea2014-10-09 16:12:24 -0300117
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200118struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +0200119 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -0300120 struct map_symbol ms;
Namhyung Kim3698dab2015-05-05 23:55:46 +0900121 struct /* for TUI */ {
122 bool unfolded;
123 bool has_children;
124 };
Jin Yao3dd029e2016-10-31 09:19:51 +0800125 u64 branch_count;
Jin Yaoa3366db02019-01-04 14:10:30 +0800126 u64 from_count;
Jin Yao3dd029e2016-10-31 09:19:51 +0800127 u64 predicted_count;
128 u64 abort_count;
129 u64 cycles_count;
130 u64 iter_count;
Jin Yaoc4ee0622017-08-07 21:05:15 +0800131 u64 iter_cycles;
Jin Yaob851dd42017-07-18 20:13:15 +0800132 struct branch_type_stat brtype_stat;
Milian Wolff40a342c2017-10-09 22:32:56 +0200133 const char *srcline;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200134 struct list_head list;
135};
136
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100137/*
138 * A callchain cursor is a single linked list that
139 * let one feed a callchain progressively.
Masanari Iida3fd44cd2012-07-18 01:20:59 +0900140 * It keeps persistent allocated entries to minimize
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100141 * allocations.
142 */
143struct callchain_cursor_node {
144 u64 ip;
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300145 struct map_symbol ms;
Milian Wolff40a342c2017-10-09 22:32:56 +0200146 const char *srcline;
Kan Liang7f1d3932020-03-19 13:25:11 -0700147 /* Indicate valid cursor node for LBR stitch */
148 bool valid;
149
Jin Yao410024d2016-10-31 09:19:49 +0800150 bool branch;
151 struct branch_flags branch_flags;
Jin Yaob851dd42017-07-18 20:13:15 +0800152 u64 branch_from;
Jin Yao410024d2016-10-31 09:19:49 +0800153 int nr_loop_iter;
Jin Yaoc4ee0622017-08-07 21:05:15 +0800154 u64 iter_cycles;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100155 struct callchain_cursor_node *next;
156};
157
Kan Liangff165622020-03-19 13:25:12 -0700158struct stitch_list {
159 struct list_head node;
160 struct callchain_cursor_node cursor;
161};
162
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100163struct callchain_cursor {
164 u64 nr;
165 struct callchain_cursor_node *first;
166 struct callchain_cursor_node **last;
167 u64 pos;
168 struct callchain_cursor_node *curr;
169};
170
Namhyung Kim47260642012-05-31 14:43:26 +0900171extern __thread struct callchain_cursor callchain_cursor;
172
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200173static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200174{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200175 INIT_LIST_HEAD(&root->node.val);
Jiri Olsa646a6e82015-11-21 11:23:55 +0100176 INIT_LIST_HEAD(&root->node.parent_val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +0200177
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200178 root->node.parent = NULL;
179 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +0200180 root->node.children_hit = 0;
Namhyung Kime3695172013-10-11 14:15:36 +0900181 root->node.rb_root_in = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200182 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200183}
184
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100185static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200186{
187 return node->hit + node->children_hit;
188}
189
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900190static inline unsigned callchain_cumul_counts(struct callchain_node *node)
191{
192 return node->count + node->children_count;
193}
194
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100195int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100196int callchain_append(struct callchain_root *root,
197 struct callchain_cursor *cursor,
198 u64 period);
199
200int callchain_merge(struct callchain_cursor *cursor,
201 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300202
Arnaldo Carvalho de Melo7b644f92019-01-27 11:55:39 +0100203void callchain_cursor_reset(struct callchain_cursor *cursor);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100204
205int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300206 struct map_symbol *ms,
Jin Yao410024d2016-10-31 09:19:49 +0800207 bool branch, struct branch_flags *flags,
Milian Wolff40a342c2017-10-09 22:32:56 +0200208 int nr_loop_iter, u64 iter_cycles, u64 branch_from,
209 const char *srcline);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100210
211/* Close a cursor writing session. Initialize for the reader */
212static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
213{
214 cursor->curr = cursor->first;
215 cursor->pos = 0;
216}
217
218/* Cursor reading iteration helpers */
219static inline struct callchain_cursor_node *
220callchain_cursor_current(struct callchain_cursor *cursor)
221{
222 if (cursor->pos == cursor->nr)
223 return NULL;
224
225 return cursor->curr;
226}
227
228static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
229{
230 cursor->curr = cursor->curr->next;
231 cursor->pos++;
232}
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300233
Namhyung Kim571f1eb2016-12-06 12:40:02 +0900234int callchain_cursor__copy(struct callchain_cursor *dst,
235 struct callchain_cursor *src);
236
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300237struct option;
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900238struct hist_entry;
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300239
240int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
Jiri Olsa09b0fd42013-10-26 16:25:33 +0200241int record_callchain_opt(const struct option *opt, const char *arg, int unset);
242
Arnaldo Carvalho de Melo0883e822016-04-15 16:37:17 -0300243struct record_opts;
244
245int record_opts__parse_callchain(struct record_opts *record,
246 struct callchain_param *callchain,
247 const char *arg, bool unset);
248
Arnaldo Carvalho de Melo91d7b2d2016-04-14 14:48:07 -0300249int sample__resolve_callchain(struct perf_sample *sample,
250 struct callchain_cursor *cursor, struct symbol **parent,
Jiri Olsa32dcd022019-07-21 13:23:51 +0200251 struct evsel *evsel, struct addr_location *al,
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900252 int max_stack);
253int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
Namhyung Kimc7405d82013-10-31 13:58:30 +0900254int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
255 bool hide_unresolved);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900256
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300257extern const char record_callchain_help[];
Arnaldo Carvalho de Melo3938bad2016-03-23 15:06:35 -0300258int parse_callchain_record(const char *arg, struct callchain_param *param);
Kan Liangc3a6a8c2015-08-04 04:30:20 -0400259int parse_callchain_record_opt(const char *arg, struct callchain_param *param);
Don Zickuscff6bb42014-04-07 14:55:24 -0400260int parse_callchain_report_opt(const char *arg);
Namhyung Kima2c10d32015-10-22 15:28:49 +0900261int parse_callchain_top_opt(const char *arg);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900262int perf_callchain_config(const char *var, const char *value);
Namhyung Kimbe1f13e2012-09-10 13:38:00 +0900263
264static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
265 struct callchain_cursor *src)
266{
267 *dest = *src;
268
269 dest->first = src->curr;
270 dest->nr -= src->pos;
271}
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700272
273#ifdef HAVE_SKIP_CALLCHAIN_IDX
Arnaldo Carvalho de Melo3938bad2016-03-23 15:06:35 -0300274int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700275#else
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300276static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700277 struct ip_callchain *chain __maybe_unused)
278{
279 return -1;
280}
281#endif
282
Andi Kleen2989cca2014-11-12 18:05:23 -0800283char *callchain_list__sym_name(struct callchain_list *cl,
284 char *bf, size_t bfsize, bool show_dso);
Namhyung Kim5ab250c2015-11-09 14:45:39 +0900285char *callchain_node__scnprintf_value(struct callchain_node *node,
286 char *bf, size_t bfsize, u64 total);
287int callchain_node__fprintf_value(struct callchain_node *node,
288 FILE *fp, u64 total);
Andi Kleen2989cca2014-11-12 18:05:23 -0800289
Jin Yaoc4ee0622017-08-07 21:05:15 +0800290int callchain_list_counts__printf_value(struct callchain_list *clist,
Jin Yao3dd029e2016-10-31 09:19:51 +0800291 FILE *fp, char *bf, int bfsize);
292
Namhyung Kimd1149602014-12-30 14:38:13 +0900293void free_callchain(struct callchain_root *root);
Namhyung Kim42b276a2016-01-05 12:06:00 +0900294void decay_callchain(struct callchain_root *root);
Namhyung Kim4b3a3212015-11-09 14:45:43 +0900295int callchain_node__make_parent_list(struct callchain_node *node);
Namhyung Kimd1149602014-12-30 14:38:13 +0900296
Jin Yao3dd029e2016-10-31 09:19:51 +0800297int callchain_branch_counts(struct callchain_root *root,
298 u64 *branch_count, u64 *predicted_count,
299 u64 *abort_count, u64 *cycles_count);
300
Jiri Olsa0d71a2b2020-05-07 11:50:23 +0200301void callchain_param_setup(u64 sample_type);
Jin Yao47ef8392020-10-09 10:28:41 +0800302
303bool callchain_cnode_matched(struct callchain_node *base_cnode,
304 struct callchain_node *pair_cnode);
305
Jin Yao28904f42020-10-09 10:28:43 +0800306u64 callchain_total_hits(struct hists *hists);
307
Jin Yao5bbd6ba2020-10-09 10:28:44 +0800308s64 callchain_avg_cycles(struct callchain_node *cnode);
309
John Kacur8b40f522009-09-24 18:02:18 +0200310#endif /* __PERF_CALLCHAIN_H */