Commit | Line | Data |
---|---|---|
8cb76d99 FW |
1 | #ifndef __PERF_CALLCHAIN_H |
2 | #define __PERF_CALLCHAIN_H | |
3 | ||
4 | #include "../perf.h" | |
5da50258 | 5 | #include <linux/list.h> |
43cbcd8a | 6 | #include <linux/rbtree.h> |
139633c6 | 7 | #include "event.h" |
4424961a | 8 | #include "symbol.h" |
8cb76d99 | 9 | |
2c83bc08 JO |
10 | enum perf_call_graph_mode { |
11 | CALLCHAIN_NONE, | |
12 | CALLCHAIN_FP, | |
13 | CALLCHAIN_DWARF, | |
aad2b21c | 14 | CALLCHAIN_LBR, |
2c83bc08 JO |
15 | CALLCHAIN_MAX |
16 | }; | |
17 | ||
4eb3e478 | 18 | enum chain_mode { |
b1a88349 | 19 | CHAIN_NONE, |
805d127d FW |
20 | CHAIN_FLAT, |
21 | CHAIN_GRAPH_ABS, | |
22 | CHAIN_GRAPH_REL | |
4eb3e478 | 23 | }; |
8cb76d99 | 24 | |
d797fdc5 SL |
25 | enum chain_order { |
26 | ORDER_CALLER, | |
27 | ORDER_CALLEE | |
28 | }; | |
29 | ||
8cb76d99 FW |
30 | struct callchain_node { |
31 | struct callchain_node *parent; | |
f37a291c | 32 | struct list_head val; |
e369517c NK |
33 | 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 */ | |
f37a291c IM |
37 | unsigned int val_nr; |
38 | u64 hit; | |
1953287b | 39 | u64 children_hit; |
8cb76d99 FW |
40 | }; |
41 | ||
d2009c51 FW |
42 | struct callchain_root { |
43 | u64 max_depth; | |
44 | struct callchain_node node; | |
45 | }; | |
46 | ||
805d127d FW |
47 | struct callchain_param; |
48 | ||
d2009c51 | 49 | typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *, |
805d127d FW |
50 | u64, struct callchain_param *); |
51 | ||
99571ab3 AK |
52 | enum chain_key { |
53 | CCKEY_FUNCTION, | |
54 | CCKEY_ADDRESS | |
55 | }; | |
56 | ||
805d127d | 57 | struct callchain_param { |
72a128aa NK |
58 | bool enabled; |
59 | enum perf_call_graph_mode record_mode; | |
60 | u32 dump_size; | |
805d127d | 61 | enum chain_mode mode; |
232a5c94 | 62 | u32 print_limit; |
805d127d FW |
63 | double min_percent; |
64 | sort_chain_func_t sort; | |
d797fdc5 | 65 | enum chain_order order; |
99571ab3 | 66 | enum chain_key key; |
8b7bad58 | 67 | bool branch_callstack; |
805d127d FW |
68 | }; |
69 | ||
8f651eae ACM |
70 | extern struct callchain_param callchain_param; |
71 | ||
8cb76d99 | 72 | struct callchain_list { |
f37a291c | 73 | u64 ip; |
b3c9ac08 | 74 | struct map_symbol ms; |
3698dab1 NK |
75 | struct /* for TUI */ { |
76 | bool unfolded; | |
77 | bool has_children; | |
78 | }; | |
23f0981b | 79 | char *srcline; |
8cb76d99 FW |
80 | struct list_head list; |
81 | }; | |
82 | ||
1b3a0e95 FW |
83 | /* |
84 | * A callchain cursor is a single linked list that | |
85 | * let one feed a callchain progressively. | |
3fd44cd4 | 86 | * It keeps persistent allocated entries to minimize |
1b3a0e95 FW |
87 | * allocations. |
88 | */ | |
89 | struct callchain_cursor_node { | |
90 | u64 ip; | |
91 | struct map *map; | |
92 | struct symbol *sym; | |
93 | struct callchain_cursor_node *next; | |
94 | }; | |
95 | ||
96 | struct 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 | ||
47260645 NK |
104 | extern __thread struct callchain_cursor callchain_cursor; |
105 | ||
d2009c51 | 106 | static inline void callchain_init(struct callchain_root *root) |
8cb76d99 | 107 | { |
d2009c51 | 108 | INIT_LIST_HEAD(&root->node.val); |
97aa1052 | 109 | |
d2009c51 FW |
110 | root->node.parent = NULL; |
111 | root->node.hit = 0; | |
98ee74a7 | 112 | root->node.children_hit = 0; |
e369517c | 113 | root->node.rb_root_in = RB_ROOT; |
d2009c51 | 114 | root->max_depth = 0; |
8cb76d99 FW |
115 | } |
116 | ||
f08c3154 | 117 | static inline u64 callchain_cumul_hits(struct callchain_node *node) |
1953287b FW |
118 | { |
119 | return node->hit + node->children_hit; | |
120 | } | |
121 | ||
16537f13 | 122 | int callchain_register_param(struct callchain_param *param); |
1b3a0e95 FW |
123 | int callchain_append(struct callchain_root *root, |
124 | struct callchain_cursor *cursor, | |
125 | u64 period); | |
126 | ||
127 | int callchain_merge(struct callchain_cursor *cursor, | |
128 | struct callchain_root *dst, struct callchain_root *src); | |
139633c6 | 129 | |
1b3a0e95 FW |
130 | /* |
131 | * Initialize a cursor before adding entries inside, but keep | |
132 | * the previously allocated entries as a cache. | |
133 | */ | |
134 | static inline void callchain_cursor_reset(struct callchain_cursor *cursor) | |
135 | { | |
136 | cursor->nr = 0; | |
137 | cursor->last = &cursor->first; | |
138 | } | |
139 | ||
140 | int 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 */ | |
144 | static 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 */ | |
151 | static inline struct callchain_cursor_node * | |
152 | callchain_cursor_current(struct callchain_cursor *cursor) | |
153 | { | |
154 | if (cursor->pos == cursor->nr) | |
155 | return NULL; | |
156 | ||
157 | return cursor->curr; | |
158 | } | |
159 | ||
160 | static inline void callchain_cursor_advance(struct callchain_cursor *cursor) | |
161 | { | |
162 | cursor->curr = cursor->curr->next; | |
163 | cursor->pos++; | |
164 | } | |
75d9a108 ACM |
165 | |
166 | struct option; | |
2dc9fb1a | 167 | struct hist_entry; |
75d9a108 ACM |
168 | |
169 | int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset); | |
09b0fd45 JO |
170 | int record_callchain_opt(const struct option *opt, const char *arg, int unset); |
171 | ||
2dc9fb1a NK |
172 | int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent, |
173 | struct perf_evsel *evsel, struct addr_location *al, | |
174 | int max_stack); | |
175 | int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample); | |
c7405d85 NK |
176 | int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, |
177 | bool hide_unresolved); | |
2dc9fb1a | 178 | |
75d9a108 | 179 | extern const char record_callchain_help[]; |
f7f084f4 | 180 | int parse_callchain_record_opt(const char *arg); |
cff6bb46 | 181 | int parse_callchain_report_opt(const char *arg); |
2b9240ca | 182 | int perf_callchain_config(const char *var, const char *value); |
be1f13e3 NK |
183 | |
184 | static 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 | } | |
a60335ba SB |
192 | |
193 | #ifdef HAVE_SKIP_CALLCHAIN_IDX | |
bb871a9c | 194 | extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain); |
a60335ba | 195 | #else |
bb871a9c | 196 | static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused, |
a60335ba SB |
197 | struct ip_callchain *chain __maybe_unused) |
198 | { | |
199 | return -1; | |
200 | } | |
201 | #endif | |
202 | ||
2989ccaa AK |
203 | char *callchain_list__sym_name(struct callchain_list *cl, |
204 | char *bf, size_t bfsize, bool show_dso); | |
205 | ||
d114960c NK |
206 | void free_callchain(struct callchain_root *root); |
207 | ||
8b40f521 | 208 | #endif /* __PERF_CALLCHAIN_H */ |