blob: 8f84423a75da74db5695c060cb13d15a8b503203 [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 {
57 enum chain_mode mode;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -030058 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020059 double min_percent;
60 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +080061 enum chain_order order;
Andi Kleen99571ab2013-07-18 15:33:57 -070062 enum chain_key key;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020063};
64
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020065struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +020066 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -030067 struct map_symbol ms;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020068 struct list_head list;
69};
70
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010071/*
72 * A callchain cursor is a single linked list that
73 * let one feed a callchain progressively.
Masanari Iida3fd44cd2012-07-18 01:20:59 +090074 * It keeps persistent allocated entries to minimize
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010075 * allocations.
76 */
77struct callchain_cursor_node {
78 u64 ip;
79 struct map *map;
80 struct symbol *sym;
81 struct callchain_cursor_node *next;
82};
83
84struct callchain_cursor {
85 u64 nr;
86 struct callchain_cursor_node *first;
87 struct callchain_cursor_node **last;
88 u64 pos;
89 struct callchain_cursor_node *curr;
90};
91
Namhyung Kim47260642012-05-31 14:43:26 +090092extern __thread struct callchain_cursor callchain_cursor;
93
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020094static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020095{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020096 INIT_LIST_HEAD(&root->node.val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +020097
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020098 root->node.parent = NULL;
99 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +0200100 root->node.children_hit = 0;
Namhyung Kime3695172013-10-11 14:15:36 +0900101 root->node.rb_root_in = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200102 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200103}
104
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100105static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200106{
107 return node->hit + node->children_hit;
108}
109
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100110int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100111int callchain_append(struct callchain_root *root,
112 struct callchain_cursor *cursor,
113 u64 period);
114
115int callchain_merge(struct callchain_cursor *cursor,
116 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300117
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100118/*
119 * Initialize a cursor before adding entries inside, but keep
120 * the previously allocated entries as a cache.
121 */
122static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
123{
124 cursor->nr = 0;
125 cursor->last = &cursor->first;
126}
127
128int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
129 struct map *map, struct symbol *sym);
130
131/* Close a cursor writing session. Initialize for the reader */
132static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
133{
134 cursor->curr = cursor->first;
135 cursor->pos = 0;
136}
137
138/* Cursor reading iteration helpers */
139static inline struct callchain_cursor_node *
140callchain_cursor_current(struct callchain_cursor *cursor)
141{
142 if (cursor->pos == cursor->nr)
143 return NULL;
144
145 return cursor->curr;
146}
147
148static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
149{
150 cursor->curr = cursor->curr->next;
151 cursor->pos++;
152}
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300153
154struct option;
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900155struct hist_entry;
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300156
Arnaldo Carvalho de Melob4006792013-12-19 14:43:45 -0300157int record_parse_callchain(const char *arg, struct record_opts *opts);
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300158int record_parse_callchain_opt(const struct option *opt, const char *arg, int unset);
Jiri Olsa09b0fd42013-10-26 16:25:33 +0200159int record_callchain_opt(const struct option *opt, const char *arg, int unset);
160
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900161int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent,
162 struct perf_evsel *evsel, struct addr_location *al,
163 int max_stack);
164int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample);
Namhyung Kimc7405d82013-10-31 13:58:30 +0900165int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
166 bool hide_unresolved);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +0900167
Arnaldo Carvalho de Melo75d9a1082012-12-11 16:46:05 -0300168extern const char record_callchain_help[];
Don Zickuscff6bb42014-04-07 14:55:24 -0400169int parse_callchain_report_opt(const char *arg);
Namhyung Kimbe1f13e2012-09-10 13:38:00 +0900170
171static inline void callchain_cursor_snapshot(struct callchain_cursor *dest,
172 struct callchain_cursor *src)
173{
174 *dest = *src;
175
176 dest->first = src->curr;
177 dest->nr -= src->pos;
178}
John Kacur8b40f522009-09-24 18:02:18 +0200179#endif /* __PERF_CALLCHAIN_H */