blob: 679c2c6d8ade7daeace3d55300049aca7fe68a0b [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
Jiri Olsa2c83bc02014-05-05 12:46:17 +020010enum perf_call_graph_mode {
11 CALLCHAIN_NONE,
12 CALLCHAIN_FP,
13 CALLCHAIN_DWARF,
Kan Liangaad2b212015-01-05 13:23:04 -050014 CALLCHAIN_LBR,
Jiri Olsa2c83bc02014-05-05 12:46:17 +020015 CALLCHAIN_MAX
16};
17
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020018enum chain_mode {
Frederic Weisbeckerb1a88342009-08-08 02:16:24 +020019 CHAIN_NONE,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020020 CHAIN_FLAT,
21 CHAIN_GRAPH_ABS,
22 CHAIN_GRAPH_REL
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020023};
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020024
Sam Liaod797fdc2011-06-07 23:49:46 +080025enum chain_order {
26 ORDER_CALLER,
27 ORDER_CALLEE
28};
29
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020030struct callchain_node {
31 struct callchain_node *parent;
Ingo Molnarf37a2912009-07-01 12:37:06 +020032 struct list_head val;
Namhyung Kime3695172013-10-11 14:15:36 +090033 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
34 struct rb_node rb_node; /* to sort nodes in an output tree */
35 struct rb_root rb_root_in; /* input tree of children */
36 struct rb_root rb_root; /* sorted output tree of children */
Ingo Molnarf37a2912009-07-01 12:37:06 +020037 unsigned int val_nr;
38 u64 hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +020039 u64 children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020040};
41
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020042struct callchain_root {
43 u64 max_depth;
44 struct callchain_node node;
45};
46
Frederic Weisbecker805d1272009-07-05 07:39:21 +020047struct callchain_param;
48
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020049typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020050 u64, struct callchain_param *);
51
Andi Kleen99571ab2013-07-18 15:33:57 -070052enum chain_key {
53 CCKEY_FUNCTION,
54 CCKEY_ADDRESS
55};
56
Frederic Weisbecker805d1272009-07-05 07:39:21 +020057struct callchain_param {
Namhyung Kim72a128a2014-09-23 10:01:41 +090058 bool enabled;
59 enum perf_call_graph_mode record_mode;
60 u32 dump_size;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020061 enum chain_mode mode;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -030062 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020063 double min_percent;
64 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +080065 enum chain_order order;
Andi Kleen99571ab2013-07-18 15:33:57 -070066 enum chain_key key;
Andi Kleen8b7bad52014-11-12 18:05:20 -080067 bool branch_callstack;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020068};
69
Arnaldo Carvalho de Melo8f651ea2014-10-09 16:12:24 -030070extern struct callchain_param callchain_param;
71
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020072struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +020073 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -030074 struct map_symbol ms;
Namhyung Kim3698dab2015-05-05 23:55:46 +090075 struct /* for TUI */ {
76 bool unfolded;
77 bool has_children;
78 };
Andi Kleen23f09812014-11-12 18:05:24 -080079 char *srcline;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020080 struct list_head list;
81};
82
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010083/*
84 * A callchain cursor is a single linked list that
85 * let one feed a callchain progressively.
Masanari Iida3fd44cd2012-07-18 01:20:59 +090086 * It keeps persistent allocated entries to minimize
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010087 * allocations.
88 */
89struct callchain_cursor_node {
90 u64 ip;
91 struct map *map;
92 struct symbol *sym;
93 struct callchain_cursor_node *next;
94};
95
96struct callchain_cursor {
97 u64 nr;
98 struct callchain_cursor_node *first;
99 struct callchain_cursor_node **last;
100 u64 pos;
101 struct callchain_cursor_node *curr;
102};
103
Namhyung Kim47260642012-05-31 14:43:26 +0900104extern __thread struct callchain_cursor callchain_cursor;
105
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200106static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200107{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200108 INIT_LIST_HEAD(&root->node.val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +0200109
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200110 root->node.parent = NULL;
111 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +0200112 root->node.children_hit = 0;
Namhyung Kime3695172013-10-11 14:15:36 +0900113 root->node.rb_root_in = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200114 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200115}
116
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100117static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200118{
119 return node->hit + node->children_hit;
120}
121
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100122int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100123int callchain_append(struct callchain_root *root,
124 struct callchain_cursor *cursor,
125 u64 period);
126
127int callchain_merge(struct callchain_cursor *cursor,
128 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300129
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100130/*
131 * Initialize a cursor before adding entries inside, but keep
132 * the previously allocated entries as a cache.
133 */
134static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
135{
136 cursor->nr = 0;
137 cursor->last = &cursor->first;
138}
139
140int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
141 struct map *map, struct symbol *sym);
142
143/* Close a cursor writing session. Initialize for the reader */
144static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
145{
146 cursor->curr = cursor->first;
147 cursor->pos = 0;
148}
149
150/* Cursor reading iteration helpers */
151static inline struct callchain_cursor_node *
152callchain_cursor_current(struct callchain_cursor *cursor)
153{
154 if (cursor->pos == cursor->nr)
155 return NULL;
156
157 return cursor->curr;
158}
159
160static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
161{
162 cursor->curr = cursor->curr->next;
163 cursor->pos++;
164}
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300165
166struct option;
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900167struct hist_entry;
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300168
169int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
Jiri Olsa09b0fd42013-10-26 16:25:33 +0200170int record_callchain_opt(const struct option *opt, const char *arg, int unset);
171
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900172int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
173 struct perf_evsel *evsel, struct addr_location *al,
174 int max_stack);
175int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
Namhyung Kimc7405d82013-10-31 13:58:30 +0900176int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
177 bool hide_unresolved);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900178
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300179extern const char record_callchain_help[];
Namhyung Kimf7f084f2014-09-23 10:01:42 +0900180int parse_callchain_record_opt(const char *arg);
Don Zickuscff6bb42014-04-07 14:55:24 -0400181int parse_callchain_report_opt(const char *arg);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900182int perf_callchain_config(const char *var, const char *value);
Namhyung Kimbe1f13e2012-09-10 13:38:00 +0900183
184static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
185 struct callchain_cursor *src)
186{
187 *dest = *src;
188
189 dest->first = src->curr;
190 dest->nr -= src->pos;
191}
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700192
193#ifdef HAVE_SKIP_CALLCHAIN_IDX
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300194extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700195#else
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300196static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700197 struct ip_callchain *chain __maybe_unused)
198{
199 return -1;
200}
201#endif
202
Andi Kleen2989cca2014-11-12 18:05:23 -0800203char *callchain_list__sym_name(struct callchain_list *cl,
204 char *bf, size_t bfsize, bool show_dso);
205
Namhyung Kimd1149602014-12-30 14:38:13 +0900206void free_callchain(struct callchain_root *root);
207
John Kacur8b40f522009-09-24 18:02:18 +0200208#endif /* __PERF_CALLCHAIN_H */