blob: 7f9c0f1ae3a9aad6f6a845299f74d1340ece754f [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
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020010enum chain_mode {
Frederic Weisbeckerb1a88342009-08-08 02:16:24 +020011 CHAIN_NONE,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020012 CHAIN_FLAT,
13 CHAIN_GRAPH_ABS,
14 CHAIN_GRAPH_REL
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020015};
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020016
Sam Liaod797fdc2011-06-07 23:49:46 +080017enum chain_order {
18 ORDER_CALLER,
19 ORDER_CALLEE
20};
21
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020022struct callchain_node {
23 struct callchain_node *parent;
Frederic Weisbecker529363b2011-01-14 04:52:01 +010024 struct list_head siblings;
Ingo Molnarf37a2912009-07-01 12:37:06 +020025 struct list_head children;
26 struct list_head val;
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020027 struct rb_node rb_node; /* to sort nodes in an rbtree */
28 struct rb_root rb_root; /* sorted tree of children */
Ingo Molnarf37a2912009-07-01 12:37:06 +020029 unsigned int val_nr;
30 u64 hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +020031 u64 children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020032};
33
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020034struct callchain_root {
35 u64 max_depth;
36 struct callchain_node node;
37};
38
Frederic Weisbecker805d1272009-07-05 07:39:21 +020039struct callchain_param;
40
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020041typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
Frederic Weisbecker805d1272009-07-05 07:39:21 +020042 u64, struct callchain_param *);
43
44struct callchain_param {
45 enum chain_mode mode;
Arnaldo Carvalho de Melo232a5c92010-05-09 20:28:10 -030046 u32 print_limit;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020047 double min_percent;
48 sort_chain_func_t sort;
Sam Liaod797fdc2011-06-07 23:49:46 +080049 enum chain_order order;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020050};
51
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020052struct callchain_list {
Ingo Molnarf37a2912009-07-01 12:37:06 +020053 u64 ip;
Arnaldo Carvalho de Melob3c9ac02010-03-24 16:40:18 -030054 struct map_symbol ms;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020055 struct list_head list;
56};
57
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010058/*
59 * A callchain cursor is a single linked list that
60 * let one feed a callchain progressively.
61 * It keeps persitent allocated entries to minimize
62 * allocations.
63 */
64struct callchain_cursor_node {
65 u64 ip;
66 struct map *map;
67 struct symbol *sym;
68 struct callchain_cursor_node *next;
69};
70
71struct callchain_cursor {
72 u64 nr;
73 struct callchain_cursor_node *first;
74 struct callchain_cursor_node **last;
75 u64 pos;
76 struct callchain_cursor_node *curr;
77};
78
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020079static inline void callchain_init(struct callchain_root *root)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020080{
Frederic Weisbecker529363b2011-01-14 04:52:01 +010081 INIT_LIST_HEAD(&root->node.siblings);
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020082 INIT_LIST_HEAD(&root->node.children);
83 INIT_LIST_HEAD(&root->node.val);
Frederic Weisbecker97aa1052010-07-08 06:06:17 +020084
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020085 root->node.parent = NULL;
86 root->node.hit = 0;
Frederic Weisbecker98ee74a2010-08-27 02:28:40 +020087 root->node.children_hit = 0;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +020088 root->max_depth = 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020089}
90
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +010091static inline u64 callchain_cumul_hits(struct callchain_node *node)
Frederic Weisbecker19532872009-08-07 07:11:05 +020092{
93 return node->hit + node->children_hit;
94}
95
Frederic Weisbecker16537f12011-01-14 04:52:00 +010096int callchain_register_param(struct callchain_param *param);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +010097int callchain_append(struct callchain_root *root,
98 struct callchain_cursor *cursor,
99 u64 period);
100
101int callchain_merge(struct callchain_cursor *cursor,
102 struct callchain_root *dst, struct callchain_root *src);
Arnaldo Carvalho de Melo139633c2010-05-09 11:47:13 -0300103
Arnaldo Carvalho de Melod20deb62011-11-25 08:19:45 -0200104struct ip_callchain;
105union perf_event;
106
Arnaldo Carvalho de Melo8115d602011-01-29 14:01:45 -0200107bool ip_callchain__valid(struct ip_callchain *chain,
108 const union perf_event *event);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100109/*
110 * Initialize a cursor before adding entries inside, but keep
111 * the previously allocated entries as a cache.
112 */
113static inline void callchain_cursor_reset(struct callchain_cursor *cursor)
114{
115 cursor->nr = 0;
116 cursor->last = &cursor->first;
117}
118
119int callchain_cursor_append(struct callchain_cursor *cursor, u64 ip,
120 struct map *map, struct symbol *sym);
121
122/* Close a cursor writing session. Initialize for the reader */
123static inline void callchain_cursor_commit(struct callchain_cursor *cursor)
124{
125 cursor->curr = cursor->first;
126 cursor->pos = 0;
127}
128
129/* Cursor reading iteration helpers */
130static inline struct callchain_cursor_node *
131callchain_cursor_current(struct callchain_cursor *cursor)
132{
133 if (cursor->pos == cursor->nr)
134 return NULL;
135
136 return cursor->curr;
137}
138
139static inline void callchain_cursor_advance(struct callchain_cursor *cursor)
140{
141 cursor->curr = cursor->curr->next;
142 cursor->pos++;
143}
John Kacur8b40f522009-09-24 18:02:18 +0200144#endif /* __PERF_CALLCHAIN_H */