1 #ifndef __PERF_CALLCHAIN_H
2 #define __PERF_CALLCHAIN_H
5 #include <linux/list.h>
6 #include <linux/rbtree.h>
10 enum perf_call_graph_mode {
29 struct callchain_node {
30 struct callchain_node *parent;
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 */
41 struct callchain_root {
43 struct callchain_node node;
46 struct callchain_param;
48 typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
49 u64, struct callchain_param *);
56 struct callchain_param {
58 enum perf_call_graph_mode record_mode;
63 sort_chain_func_t sort;
64 enum chain_order order;
68 struct callchain_list {
71 struct list_head list;
75 * A callchain cursor is a single linked list that
76 * let one feed a callchain progressively.
77 * It keeps persistent allocated entries to minimize
80 struct callchain_cursor_node {
84 struct callchain_cursor_node *next;
87 struct callchain_cursor {
89 struct callchain_cursor_node *first;
90 struct callchain_cursor_node **last;
92 struct callchain_cursor_node *curr;
95 extern __thread struct callchain_cursor callchain_cursor;
97 static inline void callchain_init(struct callchain_root *root)
99 INIT_LIST_HEAD(&root->node.val);
101 root->node.parent = NULL;
103 root->node.children_hit = 0;
104 root->node.rb_root_in = RB_ROOT;
108 static inline u64 callchain_cumul_hits(struct callchain_node *node)
110 return node->hit + node->children_hit;
113 int callchain_register_param(struct callchain_param *param);
114 int callchain_append(struct callchain_root *root,
115 struct callchain_cursor *cursor,
118 int callchain_merge(struct callchain_cursor *cursor,
119 struct callchain_root *dst, struct callchain_root *src);
122 * Initialize a cursor before adding entries inside, but keep
123 * the previously allocated entries as a cache.
125 static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
128 cursor->last = &cursor->first;
131 int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
132 struct map *map, struct symbol *sym);
134 /* Close a cursor writing session. Initialize for the reader */
135 static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
137 cursor->curr = cursor->first;
141 /* Cursor reading iteration helpers */
142 static inline struct callchain_cursor_node *
143 callchain_cursor_current(struct callchain_cursor *cursor)
145 if (cursor->pos == cursor->nr)
151 static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
153 cursor->curr = cursor->curr->next;
160 int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
161 int record_callchain_opt(const struct option *opt, const char *arg, int unset);
163 int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
164 struct perf_evsel *evsel, struct addr_location *al,
166 int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
167 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
168 bool hide_unresolved);
170 extern const char record_callchain_help[];
171 int parse_callchain_record_opt(const char *arg);
172 int parse_callchain_report_opt(const char *arg);
173 int perf_callchain_config(const char *var, const char *value);
175 static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
176 struct callchain_cursor *src)
180 dest->first = src->curr;
181 dest->nr -= src->pos;
184 #ifdef HAVE_SKIP_CALLCHAIN_IDX
185 extern int arch_skip_callchain_idx(struct machine *machine,
186 struct thread *thread, struct ip_callchain *chain);
188 static inline int arch_skip_callchain_idx(struct machine *machine __maybe_unused,
189 struct thread *thread __maybe_unused,
190 struct ip_callchain *chain __maybe_unused)
196 #endif /* __PERF_CALLCHAIN_H */