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;
66 bool branch_callstack;
69 extern struct callchain_param callchain_param;
71 struct callchain_list {
75 struct list_head list;
79 * A callchain cursor is a single linked list that
80 * let one feed a callchain progressively.
81 * It keeps persistent allocated entries to minimize
84 struct callchain_cursor_node {
88 struct callchain_cursor_node *next;
91 struct callchain_cursor {
93 struct callchain_cursor_node *first;
94 struct callchain_cursor_node **last;
96 struct callchain_cursor_node *curr;
99 extern __thread struct callchain_cursor callchain_cursor;
101 static inline void callchain_init(struct callchain_root *root)
103 INIT_LIST_HEAD(&root->node.val);
105 root->node.parent = NULL;
107 root->node.children_hit = 0;
108 root->node.rb_root_in = RB_ROOT;
112 static inline u64 callchain_cumul_hits(struct callchain_node *node)
114 return node->hit + node->children_hit;
117 int callchain_register_param(struct callchain_param *param);
118 int callchain_append(struct callchain_root *root,
119 struct callchain_cursor *cursor,
122 int callchain_merge(struct callchain_cursor *cursor,
123 struct callchain_root *dst, struct callchain_root *src);
126 * Initialize a cursor before adding entries inside, but keep
127 * the previously allocated entries as a cache.
129 static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
132 cursor->last = &cursor->first;
135 int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
136 struct map *map, struct symbol *sym);
138 /* Close a cursor writing session. Initialize for the reader */
139 static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
141 cursor->curr = cursor->first;
145 /* Cursor reading iteration helpers */
146 static inline struct callchain_cursor_node *
147 callchain_cursor_current(struct callchain_cursor *cursor)
149 if (cursor->pos == cursor->nr)
155 static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
157 cursor->curr = cursor->curr->next;
164 int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
165 int record_callchain_opt(const struct option *opt, const char *arg, int unset);
167 int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
168 struct perf_evsel *evsel, struct addr_location *al,
170 int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
171 int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
172 bool hide_unresolved);
174 extern const char record_callchain_help[];
175 int parse_callchain_record_opt(const char *arg);
176 int parse_callchain_report_opt(const char *arg);
177 int perf_callchain_config(const char *var, const char *value);
179 static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
180 struct callchain_cursor *src)
184 dest->first = src->curr;
185 dest->nr -= src->pos;
188 #ifdef HAVE_SKIP_CALLCHAIN_IDX
189 extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
191 static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
192 struct ip_callchain *chain __maybe_unused)
198 char *callchain_list__sym_name(struct callchain_list *cl,
199 char *bf, size_t bfsize, bool show_dso);
201 #endif /* __PERF_CALLCHAIN_H */