Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 1 | #ifndef __PERF_CALLCHAIN_H |
| 2 | #define __PERF_CALLCHAIN_H |
| 3 | |
| 4 | #include "../perf.h" |
Arnaldo Carvalho de Melo | 5da5025 | 2009-07-01 14:46:08 -0300 | [diff] [blame] | 5 | #include <linux/list.h> |
Arnaldo Carvalho de Melo | 43cbcd8 | 2009-07-01 12:28:37 -0300 | [diff] [blame] | 6 | #include <linux/rbtree.h> |
Arnaldo Carvalho de Melo | 139633c | 2010-05-09 11:47:13 -0300 | [diff] [blame] | 7 | #include "event.h" |
Frederic Weisbecker | 4424961 | 2009-07-01 05:35:14 +0200 | [diff] [blame] | 8 | #include "symbol.h" |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 9 | |
Jiri Olsa | 2c83bc0 | 2014-05-05 12:46:17 +0200 | [diff] [blame] | 10 | enum perf_call_graph_mode { |
| 11 | CALLCHAIN_NONE, |
| 12 | CALLCHAIN_FP, |
| 13 | CALLCHAIN_DWARF, |
| 14 | CALLCHAIN_MAX |
| 15 | }; |
| 16 | |
Frederic Weisbecker | 4eb3e47 | 2009-07-02 17:58:21 +0200 | [diff] [blame] | 17 | enum chain_mode { |
Frederic Weisbecker | b1a8834 | 2009-08-08 02:16:24 +0200 | [diff] [blame] | 18 | CHAIN_NONE, |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 19 | CHAIN_FLAT, |
| 20 | CHAIN_GRAPH_ABS, |
| 21 | CHAIN_GRAPH_REL |
Frederic Weisbecker | 4eb3e47 | 2009-07-02 17:58:21 +0200 | [diff] [blame] | 22 | }; |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 23 | |
Sam Liao | d797fdc | 2011-06-07 23:49:46 +0800 | [diff] [blame] | 24 | enum chain_order { |
| 25 | ORDER_CALLER, |
| 26 | ORDER_CALLEE |
| 27 | }; |
| 28 | |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 29 | struct callchain_node { |
| 30 | struct callchain_node *parent; |
Ingo Molnar | f37a291 | 2009-07-01 12:37:06 +0200 | [diff] [blame] | 31 | struct list_head val; |
Namhyung Kim | e369517 | 2013-10-11 14:15:36 +0900 | [diff] [blame] | 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 */ |
Ingo Molnar | f37a291 | 2009-07-01 12:37:06 +0200 | [diff] [blame] | 36 | unsigned int val_nr; |
| 37 | u64 hit; |
Frederic Weisbecker | 1953287 | 2009-08-07 07:11:05 +0200 | [diff] [blame] | 38 | u64 children_hit; |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 39 | }; |
| 40 | |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 41 | struct callchain_root { |
| 42 | u64 max_depth; |
| 43 | struct callchain_node node; |
| 44 | }; |
| 45 | |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 46 | struct callchain_param; |
| 47 | |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 48 | typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *, |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 49 | u64, struct callchain_param *); |
| 50 | |
Andi Kleen | 99571ab | 2013-07-18 15:33:57 -0700 | [diff] [blame] | 51 | enum chain_key { |
| 52 | CCKEY_FUNCTION, |
| 53 | CCKEY_ADDRESS |
| 54 | }; |
| 55 | |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 56 | struct callchain_param { |
Namhyung Kim | 72a128a | 2014-09-23 10:01:41 +0900 | [diff] [blame] | 57 | bool enabled; |
| 58 | enum perf_call_graph_mode record_mode; |
| 59 | u32 dump_size; |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 60 | enum chain_mode mode; |
Arnaldo Carvalho de Melo | 232a5c9 | 2010-05-09 20:28:10 -0300 | [diff] [blame] | 61 | u32 print_limit; |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 62 | double min_percent; |
| 63 | sort_chain_func_t sort; |
Sam Liao | d797fdc | 2011-06-07 23:49:46 +0800 | [diff] [blame] | 64 | enum chain_order order; |
Andi Kleen | 99571ab | 2013-07-18 15:33:57 -0700 | [diff] [blame] | 65 | enum chain_key key; |
Andi Kleen | 8b7bad5 | 2014-11-12 18:05:20 -0800 | [diff] [blame^] | 66 | bool branch_callstack; |
Frederic Weisbecker | 805d127 | 2009-07-05 07:39:21 +0200 | [diff] [blame] | 67 | }; |
| 68 | |
Arnaldo Carvalho de Melo | 8f651ea | 2014-10-09 16:12:24 -0300 | [diff] [blame] | 69 | extern struct callchain_param callchain_param; |
| 70 | |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 71 | struct callchain_list { |
Ingo Molnar | f37a291 | 2009-07-01 12:37:06 +0200 | [diff] [blame] | 72 | u64 ip; |
Arnaldo Carvalho de Melo | b3c9ac0 | 2010-03-24 16:40:18 -0300 | [diff] [blame] | 73 | struct map_symbol ms; |
Andi Kleen | 23f0981 | 2014-11-12 18:05:24 -0800 | [diff] [blame] | 74 | char *srcline; |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 75 | struct list_head list; |
| 76 | }; |
| 77 | |
Frederic Weisbecker | 1b3a0e9 | 2011-01-14 04:51:58 +0100 | [diff] [blame] | 78 | /* |
| 79 | * A callchain cursor is a single linked list that |
| 80 | * let one feed a callchain progressively. |
Masanari Iida | 3fd44cd | 2012-07-18 01:20:59 +0900 | [diff] [blame] | 81 | * It keeps persistent allocated entries to minimize |
Frederic Weisbecker | 1b3a0e9 | 2011-01-14 04:51:58 +0100 | [diff] [blame] | 82 | * allocations. |
| 83 | */ |
| 84 | struct callchain_cursor_node { |
| 85 | u64 ip; |
| 86 | struct map *map; |
| 87 | struct symbol *sym; |
| 88 | struct callchain_cursor_node *next; |
| 89 | }; |
| 90 | |
| 91 | struct callchain_cursor { |
| 92 | u64 nr; |
| 93 | struct callchain_cursor_node *first; |
| 94 | struct callchain_cursor_node **last; |
| 95 | u64 pos; |
| 96 | struct callchain_cursor_node *curr; |
| 97 | }; |
| 98 | |
Namhyung Kim | 4726064 | 2012-05-31 14:43:26 +0900 | [diff] [blame] | 99 | extern __thread struct callchain_cursor callchain_cursor; |
| 100 | |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 101 | static inline void callchain_init(struct callchain_root *root) |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 102 | { |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 103 | INIT_LIST_HEAD(&root->node.val); |
Frederic Weisbecker | 97aa105 | 2010-07-08 06:06:17 +0200 | [diff] [blame] | 104 | |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 105 | root->node.parent = NULL; |
| 106 | root->node.hit = 0; |
Frederic Weisbecker | 98ee74a | 2010-08-27 02:28:40 +0200 | [diff] [blame] | 107 | root->node.children_hit = 0; |
Namhyung Kim | e369517 | 2013-10-11 14:15:36 +0900 | [diff] [blame] | 108 | root->node.rb_root_in = RB_ROOT; |
Frederic Weisbecker | d2009c5 | 2010-08-22 20:05:22 +0200 | [diff] [blame] | 109 | root->max_depth = 0; |
Frederic Weisbecker | 8cb76d9 | 2009-06-26 16:28:00 +0200 | [diff] [blame] | 110 | } |
| 111 | |
Frederic Weisbecker | f08c315 | 2011-01-14 04:51:59 +0100 | [diff] [blame] | 112 | static inline u64 callchain_cumul_hits(struct callchain_node *node) |
Frederic Weisbecker | 1953287 | 2009-08-07 07:11:05 +0200 | [diff] [blame] | 113 | { |
| 114 | return node->hit + node->children_hit; |
| 115 | } |
| 116 | |
Frederic Weisbecker | 16537f1 | 2011-01-14 04:52:00 +0100 | [diff] [blame] | 117 | int callchain_register_param(struct callchain_param *param); |
Frederic Weisbecker | 1b3a0e9 | 2011-01-14 04:51:58 +0100 | [diff] [blame] | 118 | int callchain_append(struct callchain_root *root, |
| 119 | struct callchain_cursor *cursor, |
| 120 | u64 period); |
| 121 | |
| 122 | int callchain_merge(struct callchain_cursor *cursor, |
| 123 | struct callchain_root *dst, struct callchain_root *src); |
Arnaldo Carvalho de Melo | 139633c | 2010-05-09 11:47:13 -0300 | [diff] [blame] | 124 | |
Frederic Weisbecker | 1b3a0e9 | 2011-01-14 04:51:58 +0100 | [diff] [blame] | 125 | /* |
| 126 | * Initialize a cursor before adding entries inside, but keep |
| 127 | * the previously allocated entries as a cache. |
| 128 | */ |
| 129 | static inline void callchain_cursor_reset(struct callchain_cursor *cursor) |
| 130 | { |
| 131 | cursor->nr = 0; |
| 132 | cursor->last = &cursor->first; |
| 133 | } |
| 134 | |
| 135 | int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip, |
| 136 | struct map *map, struct symbol *sym); |
| 137 | |
| 138 | /* Close a cursor writing session. Initialize for the reader */ |
| 139 | static inline void callchain_cursor_commit(struct callchain_cursor *cursor) |
| 140 | { |
| 141 | cursor->curr = cursor->first; |
| 142 | cursor->pos = 0; |
| 143 | } |
| 144 | |
| 145 | /* Cursor reading iteration helpers */ |
| 146 | static inline struct callchain_cursor_node * |
| 147 | callchain_cursor_current(struct callchain_cursor *cursor) |
| 148 | { |
| 149 | if (cursor->pos == cursor->nr) |
| 150 | return NULL; |
| 151 | |
| 152 | return cursor->curr; |
| 153 | } |
| 154 | |
| 155 | static inline void callchain_cursor_advance(struct callchain_cursor *cursor) |
| 156 | { |
| 157 | cursor->curr = cursor->curr->next; |
| 158 | cursor->pos++; |
| 159 | } |
Arnaldo Carvalho de Melo | 75d9a108 | 2012-12-11 16:46:05 -0300 | [diff] [blame] | 160 | |
| 161 | struct option; |
Namhyung Kim | 2dc9fb1 | 2014-01-14 14:25:35 +0900 | [diff] [blame] | 162 | struct hist_entry; |
Arnaldo Carvalho de Melo | 75d9a108 | 2012-12-11 16:46:05 -0300 | [diff] [blame] | 163 | |
| 164 | int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset); |
Jiri Olsa | 09b0fd4 | 2013-10-26 16:25:33 +0200 | [diff] [blame] | 165 | int record_callchain_opt(const struct option *opt, const char *arg, int unset); |
| 166 | |
Namhyung Kim | 2dc9fb1 | 2014-01-14 14:25:35 +0900 | [diff] [blame] | 167 | int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent, |
| 168 | struct perf_evsel *evsel, struct addr_location *al, |
| 169 | int max_stack); |
| 170 | int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample); |
Namhyung Kim | c7405d8 | 2013-10-31 13:58:30 +0900 | [diff] [blame] | 171 | int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, |
| 172 | bool hide_unresolved); |
Namhyung Kim | 2dc9fb1 | 2014-01-14 14:25:35 +0900 | [diff] [blame] | 173 | |
Arnaldo Carvalho de Melo | 75d9a108 | 2012-12-11 16:46:05 -0300 | [diff] [blame] | 174 | extern const char record_callchain_help[]; |
Namhyung Kim | f7f084f | 2014-09-23 10:01:42 +0900 | [diff] [blame] | 175 | int parse_callchain_record_opt(const char *arg); |
Don Zickus | cff6bb4 | 2014-04-07 14:55:24 -0400 | [diff] [blame] | 176 | int parse_callchain_report_opt(const char *arg); |
Namhyung Kim | 2b9240c | 2014-09-23 10:01:43 +0900 | [diff] [blame] | 177 | int perf_callchain_config(const char *var, const char *value); |
Namhyung Kim | be1f13e | 2012-09-10 13:38:00 +0900 | [diff] [blame] | 178 | |
| 179 | static inline void callchain_cursor_snapshot(struct callchain_cursor *dest, |
| 180 | struct callchain_cursor *src) |
| 181 | { |
| 182 | *dest = *src; |
| 183 | |
| 184 | dest->first = src->curr; |
| 185 | dest->nr -= src->pos; |
| 186 | } |
Sukadev Bhattiprolu | a60335b | 2014-06-25 08:49:03 -0700 | [diff] [blame] | 187 | |
| 188 | #ifdef HAVE_SKIP_CALLCHAIN_IDX |
Arnaldo Carvalho de Melo | bb871a9 | 2014-10-23 12:50:25 -0300 | [diff] [blame] | 189 | extern int arch_skip_callchain_idx(struct thread *thread, struct ip_callchain *chain); |
Sukadev Bhattiprolu | a60335b | 2014-06-25 08:49:03 -0700 | [diff] [blame] | 190 | #else |
Arnaldo Carvalho de Melo | bb871a9 | 2014-10-23 12:50:25 -0300 | [diff] [blame] | 191 | static inline int arch_skip_callchain_idx(struct thread *thread __maybe_unused, |
Sukadev Bhattiprolu | a60335b | 2014-06-25 08:49:03 -0700 | [diff] [blame] | 192 | struct ip_callchain *chain __maybe_unused) |
| 193 | { |
| 194 | return -1; |
| 195 | } |
| 196 | #endif |
| 197 | |
Andi Kleen | 2989cca | 2014-11-12 18:05:23 -0800 | [diff] [blame] | 198 | char *callchain_list__sym_name(struct callchain_list *cl, |
| 199 | char *bf, size_t bfsize, bool show_dso); |
| 200 | |
John Kacur | 8b40f52 | 2009-09-24 18:02:18 +0200 | [diff] [blame] | 201 | #endif /* __PERF_CALLCHAIN_H */ |