blob: 3f158474c8927339ba66e653459637be3eccb971 [file] [log] [blame]
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02001#ifndef __PERF_CALLCHAIN_H
2#define __PERF_CALLCHAIN_H
3
4#include "../perf.h"
Arnaldo Carvalho de Melo5da50252009-07-01 14:46:08 -03005#include <linux/list.h>
Arnaldo Carvalho de Melo43cbcd82009-07-01 12:28:37 -03006#include <linux/rbtree.h>
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -03007#include "event.h"
Frederic Weisbecker44249612009-07-01 05:35:14 +02008#include "symbol.h"
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02009
Jiri Olsa2c83bc02014-05-05 12:46:17 +020010enum perf_call_graph_mode {
11 CALLCHAIN_NONE,
12 CALLCHAIN_FP,
13 CALLCHAIN_DWARF,
14 CALLCHAIN_MAX
15};
16
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020017enum chain_mode {
Frederic Weisbeckerb1a88342009-08-08 02:16:24 +020018 CHAIN_NONE,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020019 CHAIN_FLAT,
20 CHAIN_GRAPH_ABS,
21 CHAIN_GRAPH_REL
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020022};
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020023
Sam Liaod797fdc2011-06-07 23:49:46 +080024enum chain_order {
25 ORDER_CALLER,
26 ORDER_CALLEE
27};
28
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020029struct callchain_node {
30 struct callchain_node *parent;
Ingo Molnarf37a2912009-07-01 12:37:06 +020031 struct list_head val;
Namhyung Kime3695172013-10-11 14:15:36 +090032 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 */
Ingo Molnarf37a2912009-07-01 12:37:06 +020036 unsigned int val_nr;
37 u64 hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +020038 u64 children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020039};
40
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020041struct callchain_root {
42 u64 max_depth;
43 struct callchain_node node;
44};
45
Frederic Weisbecker805d1272009-07-05 07:39:21 +020046struct callchain_param;
47
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020048typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020049 u64, struct callchain_param *);
50
Andi Kleen99571ab2013-07-18 15:33:57 -070051enum chain_key {
52 CCKEY_FUNCTION,
53 CCKEY_ADDRESS
54};
55
Frederic Weisbecker805d1272009-07-05 07:39:21 +020056struct callchain_param {
Namhyung Kim72a128a2014-09-23 10:01:41 +090057 bool enabled;
58 enum perf_call_graph_mode record_mode;
59 u32 dump_size;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020060 enum chain_mode mode;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -030061 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020062 double min_percent;
63 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +080064 enum chain_order order;
Andi Kleen99571ab2013-07-18 15:33:57 -070065 enum chain_key key;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020066};
67
Arnaldo Carvalho de Melo8f651ea2014-10-09 16:12:24 -030068extern struct callchain_param callchain_param;
69
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020070struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +020071 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -030072 struct map_symbol ms;
Andi Kleen23f09812014-11-12 18:05:24 -080073 char *srcline;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020074 struct list_head list;
75};
76
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010077/*
78 * A callchain cursor is a single linked list that
79 * let one feed a callchain progressively.
Masanari Iida3fd44cd2012-07-18 01:20:59 +090080 * It keeps persistent allocated entries to minimize
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010081 * allocations.
82 */
83struct callchain_cursor_node {
84 u64 ip;
85 struct map *map;
86 struct symbol *sym;
87 struct callchain_cursor_node *next;
88};
89
90struct callchain_cursor {
91 u64 nr;
92 struct callchain_cursor_node *first;
93 struct callchain_cursor_node **last;
94 u64 pos;
95 struct callchain_cursor_node *curr;
96};
97
Namhyung Kim47260642012-05-31 14:43:26 +090098extern __thread struct callchain_cursor callchain_cursor;
99
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200100static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200101{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200102 INIT_LIST_HEAD(&root->node.val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +0200103
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200104 root->node.parent = NULL;
105 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +0200106 root->node.children_hit = 0;
Namhyung Kime3695172013-10-11 14:15:36 +0900107 root->node.rb_root_in = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200108 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200109}
110
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100111static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200112{
113 return node->hit + node->children_hit;
114}
115
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100116int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100117int callchain_append(struct callchain_root *root,
118 struct callchain_cursor *cursor,
119 u64 period);
120
121int callchain_merge(struct callchain_cursor *cursor,
122 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300123
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100124/*
125 * Initialize a cursor before adding entries inside, but keep
126 * the previously allocated entries as a cache.
127 */
128static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
129{
130 cursor->nr = 0;
131 cursor->last = &cursor->first;
132}
133
134int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
135 struct map *map, struct symbol *sym);
136
137/* Close a cursor writing session. Initialize for the reader */
138static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
139{
140 cursor->curr = cursor->first;
141 cursor->pos = 0;
142}
143
144/* Cursor reading iteration helpers */
145static inline struct callchain_cursor_node *
146callchain_cursor_current(struct callchain_cursor *cursor)
147{
148 if (cursor->pos == cursor->nr)
149 return NULL;
150
151 return cursor->curr;
152}
153
154static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
155{
156 cursor->curr = cursor->curr->next;
157 cursor->pos++;
158}
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300159
160struct option;
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900161struct hist_entry;
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300162
163int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
Jiri Olsa09b0fd42013-10-26 16:25:33 +0200164int record_callchain_opt(const struct option *opt, const char *arg, int unset);
165
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900166int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
167 struct perf_evsel *evsel, struct addr_location *al,
168 int max_stack);
169int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
Namhyung Kimc7405d82013-10-31 13:58:30 +0900170int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
171 bool hide_unresolved);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900172
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300173extern const char record_callchain_help[];
Namhyung Kimf7f084f2014-09-23 10:01:42 +0900174int parse_callchain_record_opt(const char *arg);
Don Zickuscff6bb42014-04-07 14:55:24 -0400175int parse_callchain_report_opt(const char *arg);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900176int perf_callchain_config(const char *var, const char *value);
Namhyung Kimbe1f13e2012-09-10 13:38:00 +0900177
178static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
179 struct callchain_cursor *src)
180{
181 *dest = *src;
182
183 dest->first = src->curr;
184 dest->nr -= src->pos;
185}
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700186
187#ifdef HAVE_SKIP_CALLCHAIN_IDX
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300188extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain);
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700189#else
Arnaldo Carvalho de Melobb871a92014-10-23 12:50:25 -0300190static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused,
Sukadev Bhattiprolua60335b2014-06-25 08:49:03 -0700191 struct ip_callchain *chain __maybe_unused)
192{
193 return -1;
194}
195#endif
196
Andi Kleen2989cca2014-11-12 18:05:23 -0800197char *callchain_list__sym_name(struct callchain_list *cl,
198 char *bf, size_t bfsize, bool show_dso);
199
John Kacur8b40f522009-09-24 18:02:18 +0200200#endif /* __PERF_CALLCHAIN_H */