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