perf callchain: Use al.addr to set up call chain
[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
2c83bc08
JO
10enum perf_call_graph_mode {
11 CALLCHAIN_NONE,
12 CALLCHAIN_FP,
13 CALLCHAIN_DWARF,
14 CALLCHAIN_MAX
15};
16
4eb3e478 17enum 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
24enum chain_order {
25 ORDER_CALLER,
26 ORDER_CALLEE
27};
28
8cb76d99
FW
29struct 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
41struct callchain_root {
42 u64 max_depth;
43 struct callchain_node node;
44};
45
805d127d
FW
46struct callchain_param;
47
d2009c51 48typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
805d127d
FW
49 u64, struct callchain_param *);
50
99571ab3
AK
51enum chain_key {
52 CCKEY_FUNCTION,
53 CCKEY_ADDRESS
54};
55
805d127d 56struct 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;
805d127d
FW
66};
67
8f651eae
ACM
68extern struct callchain_param callchain_param;
69
8cb76d99 70struct callchain_list {
f37a291c 71 u64 ip;
b3c9ac08 72 struct map_symbol ms;
8cb76d99
FW
73 struct list_head list;
74};
75
1b3a0e95
FW
76/*
77 * A callchain cursor is a single linked list that
78 * let one feed a callchain progressively.
3fd44cd4 79 * It keeps persistent allocated entries to minimize
1b3a0e95
FW
80 * allocations.
81 */
82struct callchain_cursor_node {
83 u64 ip;
84 struct map *map;
85 struct symbol *sym;
86 struct callchain_cursor_node *next;
87};
88
89struct callchain_cursor {
90 u64 nr;
91 struct callchain_cursor_node *first;
92 struct callchain_cursor_node **last;
93 u64 pos;
94 struct callchain_cursor_node *curr;
95};
96
47260645
NK
97extern __thread struct callchain_cursor callchain_cursor;
98
d2009c51 99static inline void callchain_init(struct callchain_root *root)
8cb76d99 100{
d2009c51 101 INIT_LIST_HEAD(&root->node.val);
97aa1052 102
d2009c51
FW
103 root->node.parent = NULL;
104 root->node.hit = 0;
98ee74a7 105 root->node.children_hit = 0;
e369517c 106 root->node.rb_root_in = RB_ROOT;
d2009c51 107 root->max_depth = 0;
8cb76d99
FW
108}
109
f08c3154 110static inline u64 callchain_cumul_hits(struct callchain_node *node)
1953287b
FW
111{
112 return node->hit + node->children_hit;
113}
114
16537f13 115int callchain_register_param(struct callchain_param *param);
1b3a0e95
FW
116int callchain_append(struct callchain_root *root,
117 struct callchain_cursor *cursor,
118 u64 period);
119
120int callchain_merge(struct callchain_cursor *cursor,
121 struct callchain_root *dst, struct callchain_root *src);
139633c6 122
1b3a0e95
FW
123/*
124 * Initialize a cursor before adding entries inside, but keep
125 * the previously allocated entries as a cache.
126 */
127static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
128{
129 cursor->nr = 0;
130 cursor->last = &cursor->first;
131}
132
133int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
134 struct map *map, struct symbol *sym);
135
136/* Close a cursor writing session. Initialize for the reader */
137static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
138{
139 cursor->curr = cursor->first;
140 cursor->pos = 0;
141}
142
143/* Cursor reading iteration helpers */
144static inline struct callchain_cursor_node *
145callchain_cursor_current(struct callchain_cursor *cursor)
146{
147 if (cursor->pos == cursor->nr)
148 return NULL;
149
150 return cursor->curr;
151}
152
153static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
154{
155 cursor->curr = cursor->curr->next;
156 cursor->pos++;
157}
75d9a108
ACM
158
159struct option;
2dc9fb1a 160struct hist_entry;
75d9a108
ACM
161
162int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
09b0fd45
JO
163int record_callchain_opt(const struct option *opt, const char *arg, int unset);
164
2dc9fb1a
NK
165int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
166 struct perf_evsel *evsel, struct addr_location *al,
167 int max_stack);
168int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
c7405d85
NK
169int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
170 bool hide_unresolved);
2dc9fb1a 171
75d9a108 172extern const char record_callchain_help[];
f7f084f4 173int parse_callchain_record_opt(const char *arg);
cff6bb46 174int parse_callchain_report_opt(const char *arg);
2b9240ca 175int perf_callchain_config(const char *var, const char *value);
be1f13e3
NK
176
177static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
178 struct callchain_cursor *src)
179{
180 *dest = *src;
181
182 dest->first = src->curr;
183 dest->nr -= src->pos;
184}
a60335ba
SB
185
186#ifdef HAVE_SKIP_CALLCHAIN_IDX
bb871a9c 187extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
a60335ba 188#else
bb871a9c 189static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
a60335ba
SB
190 struct ip_callchain *chain __maybe_unused)
191{
192 return -1;
193}
194#endif
195
8b40f521 196#endif /* __PERF_CALLCHAIN_H */
This page took 0.261135 seconds and 5 git commands to generate.