perf machine: Fix to destroy kernel maps when machine exits
[deliverable/linux.git] / tools / perf / util / callchain.h
CommitLineData
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
76a26549
NK
10#define HELP_PAD "\t\t\t\t"
11
12#define CALLCHAIN_HELP "setup and enables call-graph (stack chain/backtrace):\n\n"
21cf6284
NK
13
14#ifdef HAVE_DWARF_UNWIND_SUPPORT
76a26549 15# define RECORD_MODE_HELP HELP_PAD "record_mode:\tcall graph recording mode (fp|dwarf|lbr)\n"
21cf6284 16#else
76a26549 17# define RECORD_MODE_HELP HELP_PAD "record_mode:\tcall graph recording mode (fp|lbr)\n"
21cf6284
NK
18#endif
19
76a26549
NK
20#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 \
27 HELP_PAD "print_type:\tcall graph printing style (graph|flat|fractal|none)\n" \
28 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"
21cf6284 33
2c83bc08
JO
34enum perf_call_graph_mode {
35 CALLCHAIN_NONE,
36 CALLCHAIN_FP,
37 CALLCHAIN_DWARF,
aad2b21c 38 CALLCHAIN_LBR,
2c83bc08
JO
39 CALLCHAIN_MAX
40};
41
4eb3e478 42enum chain_mode {
b1a88349 43 CHAIN_NONE,
805d127d
FW
44 CHAIN_FLAT,
45 CHAIN_GRAPH_ABS,
46 CHAIN_GRAPH_REL
4eb3e478 47};
8cb76d99 48
d797fdc5
SL
49enum chain_order {
50 ORDER_CALLER,
51 ORDER_CALLEE
52};
53
8cb76d99
FW
54struct callchain_node {
55 struct callchain_node *parent;
f37a291c 56 struct list_head val;
e369517c
NK
57 struct rb_node rb_node_in; /* to insert nodes in an rbtree */
58 struct rb_node rb_node; /* to sort nodes in an output tree */
59 struct rb_root rb_root_in; /* input tree of children */
60 struct rb_root rb_root; /* sorted output tree of children */
f37a291c
IM
61 unsigned int val_nr;
62 u64 hit;
1953287b 63 u64 children_hit;
8cb76d99
FW
64};
65
d2009c51
FW
66struct callchain_root {
67 u64 max_depth;
68 struct callchain_node node;
69};
70
805d127d
FW
71struct callchain_param;
72
d2009c51 73typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
805d127d
FW
74 u64, struct callchain_param *);
75
99571ab3
AK
76enum chain_key {
77 CCKEY_FUNCTION,
78 CCKEY_ADDRESS
79};
80
805d127d 81struct callchain_param {
72a128aa
NK
82 bool enabled;
83 enum perf_call_graph_mode record_mode;
84 u32 dump_size;
805d127d 85 enum chain_mode mode;
232a5c94 86 u32 print_limit;
805d127d
FW
87 double min_percent;
88 sort_chain_func_t sort;
d797fdc5 89 enum chain_order order;
792aeafa 90 bool order_set;
99571ab3 91 enum chain_key key;
8b7bad58 92 bool branch_callstack;
805d127d
FW
93};
94
8f651eae
ACM
95extern struct callchain_param callchain_param;
96
8cb76d99 97struct callchain_list {
f37a291c 98 u64 ip;
b3c9ac08 99 struct map_symbol ms;
3698dab1
NK
100 struct /* for TUI */ {
101 bool unfolded;
102 bool has_children;
103 };
23f0981b 104 char *srcline;
8cb76d99
FW
105 struct list_head list;
106};
107
1b3a0e95
FW
108/*
109 * A callchain cursor is a single linked list that
110 * let one feed a callchain progressively.
3fd44cd4 111 * It keeps persistent allocated entries to minimize
1b3a0e95
FW
112 * allocations.
113 */
114struct callchain_cursor_node {
115 u64 ip;
116 struct map *map;
117 struct symbol *sym;
118 struct callchain_cursor_node *next;
119};
120
121struct callchain_cursor {
122 u64 nr;
123 struct callchain_cursor_node *first;
124 struct callchain_cursor_node **last;
125 u64 pos;
126 struct callchain_cursor_node *curr;
127};
128
47260645
NK
129extern __thread struct callchain_cursor callchain_cursor;
130
d2009c51 131static inline void callchain_init(struct callchain_root *root)
8cb76d99 132{
d2009c51 133 INIT_LIST_HEAD(&root->node.val);
97aa1052 134
d2009c51
FW
135 root->node.parent = NULL;
136 root->node.hit = 0;
98ee74a7 137 root->node.children_hit = 0;
e369517c 138 root->node.rb_root_in = RB_ROOT;
d2009c51 139 root->max_depth = 0;
8cb76d99
FW
140}
141
f08c3154 142static inline u64 callchain_cumul_hits(struct callchain_node *node)
1953287b
FW
143{
144 return node->hit + node->children_hit;
145}
146
16537f13 147int callchain_register_param(struct callchain_param *param);
1b3a0e95
FW
148int callchain_append(struct callchain_root *root,
149 struct callchain_cursor *cursor,
150 u64 period);
151
152int callchain_merge(struct callchain_cursor *cursor,
153 struct callchain_root *dst, struct callchain_root *src);
139633c6 154
1b3a0e95
FW
155/*
156 * Initialize a cursor before adding entries inside, but keep
157 * the previously allocated entries as a cache.
158 */
159static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
160{
161 cursor->nr = 0;
162 cursor->last = &cursor->first;
163}
164
165int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
166 struct map *map, struct symbol *sym);
167
168/* Close a cursor writing session. Initialize for the reader */
169static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
170{
171 cursor->curr = cursor->first;
172 cursor->pos = 0;
173}
174
175/* Cursor reading iteration helpers */
176static inline struct callchain_cursor_node *
177callchain_cursor_current(struct callchain_cursor *cursor)
178{
179 if (cursor->pos == cursor->nr)
180 return NULL;
181
182 return cursor->curr;
183}
184
185static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
186{
187 cursor->curr = cursor->curr->next;
188 cursor->pos++;
189}
75d9a108
ACM
190
191struct option;
2dc9fb1a 192struct hist_entry;
75d9a108
ACM
193
194int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
09b0fd45
JO
195int record_callchain_opt(const struct option *opt, const char *arg, int unset);
196
2dc9fb1a
NK
197int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
198 struct perf_evsel *evsel, struct addr_location *al,
199 int max_stack);
200int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
c7405d85
NK
201int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
202 bool hide_unresolved);
2dc9fb1a 203
75d9a108 204extern const char record_callchain_help[];
076a30c4 205extern int parse_callchain_record(const char *arg, struct callchain_param *param);
c3a6a8c4 206int parse_callchain_record_opt(const char *arg, struct callchain_param *param);
cff6bb46 207int parse_callchain_report_opt(const char *arg);
a2c10d39 208int parse_callchain_top_opt(const char *arg);
2b9240ca 209int perf_callchain_config(const char *var, const char *value);
be1f13e3
NK
210
211static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
212 struct callchain_cursor *src)
213{
214 *dest = *src;
215
216 dest->first = src->curr;
217 dest->nr -= src->pos;
218}
a60335ba
SB
219
220#ifdef HAVE_SKIP_CALLCHAIN_IDX
bb871a9c 221extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
a60335ba 222#else
bb871a9c 223static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
a60335ba
SB
224 struct ip_callchain *chain __maybe_unused)
225{
226 return -1;
227}
228#endif
229
2989ccaa
AK
230char *callchain_list__sym_name(struct callchain_list *cl,
231 char *bf, size_t bfsize, bool show_dso);
232
d114960c
NK
233void free_callchain(struct callchain_root *root);
234
8b40f521 235#endif /* __PERF_CALLCHAIN_H */
This page took 0.220055 seconds and 5 git commands to generate.