blob: b3b71258272a902f2e349bd74b3c610260d31c96 [file] [log] [blame]
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02001/*
2 * Copyright (C) 2009, Frederic Weisbecker <fweisbec@gmail.com>
3 *
4 * Handle the callchains from the stream in an ad-hoc radix tree and then
5 * sort them in an rbtree.
6 *
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +02007 * Using a radix for code path provides a fast retrieval and factorizes
8 * memory use. Also that lets us use the paths in a hierarchical graph view.
9 *
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020010 */
11
12#include <stdlib.h>
13#include <stdio.h>
14#include <stdbool.h>
15#include <errno.h>
Frederic Weisbeckerc0a88652009-08-09 04:19:15 +020016#include <math.h>
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020017
18#include "callchain.h"
19
Frederic Weisbecker14f46542009-07-02 17:58:19 +020020#define chain_for_each_child(child, parent) \
21 list_for_each_entry(child, &parent->children, brothers)
22
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +020023static void
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020024rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
25 enum chain_mode mode)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020026{
27 struct rb_node **p = &root->rb_node;
28 struct rb_node *parent = NULL;
29 struct callchain_node *rnode;
Frederic Weisbecker19532872009-08-07 07:11:05 +020030 u64 chain_cumul = cumul_hits(chain);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020031
32 while (*p) {
Frederic Weisbecker19532872009-08-07 07:11:05 +020033 u64 rnode_cumul;
34
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020035 parent = *p;
36 rnode = rb_entry(parent, struct callchain_node, rb_node);
Frederic Weisbecker19532872009-08-07 07:11:05 +020037 rnode_cumul = cumul_hits(rnode);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020038
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020039 switch (mode) {
Frederic Weisbecker805d1272009-07-05 07:39:21 +020040 case CHAIN_FLAT:
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020041 if (rnode->hit < chain->hit)
42 p = &(*p)->rb_left;
43 else
44 p = &(*p)->rb_right;
45 break;
Frederic Weisbecker805d1272009-07-05 07:39:21 +020046 case CHAIN_GRAPH_ABS: /* Falldown */
47 case CHAIN_GRAPH_REL:
Frederic Weisbecker19532872009-08-07 07:11:05 +020048 if (rnode_cumul < chain_cumul)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020049 p = &(*p)->rb_left;
50 else
51 p = &(*p)->rb_right;
52 break;
Ingo Molnar83a09442009-08-15 12:26:57 +020053 case CHAIN_NONE:
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020054 default:
55 break;
56 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020057 }
58
59 rb_link_node(&chain->rb_node, parent, p);
60 rb_insert_color(&chain->rb_node, root);
61}
62
Frederic Weisbecker805d1272009-07-05 07:39:21 +020063static void
64__sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
65 u64 min_hit)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020066{
67 struct callchain_node *child;
68
Frederic Weisbecker14f46542009-07-02 17:58:19 +020069 chain_for_each_child(child, node)
Frederic Weisbecker805d1272009-07-05 07:39:21 +020070 __sort_chain_flat(rb_root, child, min_hit);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020071
Frederic Weisbeckerc20ab372009-07-02 20:14:33 +020072 if (node->hit && node->hit >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +020073 rb_insert_callchain(rb_root, node, CHAIN_FLAT);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020074}
75
Frederic Weisbecker805d1272009-07-05 07:39:21 +020076/*
77 * Once we get every callchains from the stream, we can now
78 * sort them by hit
79 */
80static void
81sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
82 u64 min_hit, struct callchain_param *param __used)
83{
84 __sort_chain_flat(rb_root, node, min_hit);
85}
86
87static void __sort_chain_graph_abs(struct callchain_node *node,
88 u64 min_hit)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020089{
90 struct callchain_node *child;
91
92 node->rb_root = RB_ROOT;
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020093
94 chain_for_each_child(child, node) {
Frederic Weisbecker805d1272009-07-05 07:39:21 +020095 __sort_chain_graph_abs(child, min_hit);
Frederic Weisbecker19532872009-08-07 07:11:05 +020096 if (cumul_hits(child) >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +020097 rb_insert_callchain(&node->rb_root, child,
98 CHAIN_GRAPH_ABS);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +020099 }
100}
101
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200102static void
103sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_node *chain_root,
104 u64 min_hit, struct callchain_param *param __used)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200105{
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200106 __sort_chain_graph_abs(chain_root, min_hit);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200107 rb_root->rb_node = chain_root->rb_root.rb_node;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200108}
109
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200110static void __sort_chain_graph_rel(struct callchain_node *node,
111 double min_percent)
112{
113 struct callchain_node *child;
114 u64 min_hit;
115
116 node->rb_root = RB_ROOT;
Frederic Weisbeckerc0a88652009-08-09 04:19:15 +0200117 min_hit = ceil(node->children_hit * min_percent);
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200118
119 chain_for_each_child(child, node) {
120 __sort_chain_graph_rel(child, min_percent);
Frederic Weisbecker19532872009-08-07 07:11:05 +0200121 if (cumul_hits(child) >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200122 rb_insert_callchain(&node->rb_root, child,
123 CHAIN_GRAPH_REL);
124 }
125}
126
127static void
128sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_node *chain_root,
129 u64 min_hit __used, struct callchain_param *param)
130{
Frederic Weisbeckerc0a88652009-08-09 04:19:15 +0200131 __sort_chain_graph_rel(chain_root, param->min_percent / 100.0);
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200132 rb_root->rb_node = chain_root->rb_root.rb_node;
133}
134
135int register_callchain_param(struct callchain_param *param)
136{
137 switch (param->mode) {
138 case CHAIN_GRAPH_ABS:
139 param->sort = sort_chain_graph_abs;
140 break;
141 case CHAIN_GRAPH_REL:
142 param->sort = sort_chain_graph_rel;
143 break;
144 case CHAIN_FLAT:
145 param->sort = sort_chain_flat;
146 break;
Ingo Molnar83a09442009-08-15 12:26:57 +0200147 case CHAIN_NONE:
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200148 default:
149 return -1;
150 }
151 return 0;
152}
153
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200154/*
155 * Create a child for a parent. If inherit_children, then the new child
156 * will become the new parent of it's parent children
157 */
158static struct callchain_node *
159create_child(struct callchain_node *parent, bool inherit_children)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200160{
161 struct callchain_node *new;
162
163 new = malloc(sizeof(*new));
164 if (!new) {
165 perror("not enough memory to create child for code path tree");
166 return NULL;
167 }
168 new->parent = parent;
169 INIT_LIST_HEAD(&new->children);
170 INIT_LIST_HEAD(&new->val);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200171
172 if (inherit_children) {
173 struct callchain_node *next;
174
175 list_splice(&parent->children, &new->children);
176 INIT_LIST_HEAD(&parent->children);
177
Frederic Weisbecker14f46542009-07-02 17:58:19 +0200178 chain_for_each_child(next, new)
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200179 next->parent = new;
180 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200181 list_add_tail(&new->brothers, &parent->children);
182
183 return new;
184}
185
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200186/*
187 * Fill the node with callchain values
188 */
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200189static void
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200190fill_node(struct callchain_node *node, struct ip_callchain *chain,
191 int start, struct symbol **syms)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200192{
Ingo Molnarf37a2912009-07-01 12:37:06 +0200193 unsigned int i;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200194
195 for (i = start; i < chain->nr; i++) {
196 struct callchain_list *call;
197
Frederic Weisbecker9198aa72009-07-01 05:35:13 +0200198 call = malloc(sizeof(*call));
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200199 if (!call) {
200 perror("not enough memory for the code path tree");
201 return;
202 }
203 call->ip = chain->ips[i];
Frederic Weisbecker44249612009-07-01 05:35:14 +0200204 call->sym = syms[i];
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200205 list_add_tail(&call->list, &node->val);
206 }
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200207 node->val_nr = chain->nr - start;
208 if (!node->val_nr)
Arnaldo Carvalho de Melo6beba7a2009-10-21 17:34:06 -0200209 pr_warning("Warning: empty node in callchain tree\n");
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200210}
211
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200212static void
213add_child(struct callchain_node *parent, struct ip_callchain *chain,
214 int start, struct symbol **syms)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200215{
216 struct callchain_node *new;
217
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200218 new = create_child(parent, false);
219 fill_node(new, chain, start, syms);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200220
Frederic Weisbecker19532872009-08-07 07:11:05 +0200221 new->children_hit = 0;
222 new->hit = 1;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200223}
224
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200225/*
226 * Split the parent in two parts (a new child is created) and
227 * give a part of its callchain to the created child.
228 * Then create another child to host the given callchain of new branch
229 */
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200230static void
231split_add_child(struct callchain_node *parent, struct ip_callchain *chain,
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200232 struct callchain_list *to_split, int idx_parents, int idx_local,
233 struct symbol **syms)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200234{
235 struct callchain_node *new;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200236 struct list_head *old_tail;
Ingo Molnarf37a2912009-07-01 12:37:06 +0200237 unsigned int idx_total = idx_parents + idx_local;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200238
239 /* split */
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200240 new = create_child(parent, true);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200241
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200242 /* split the callchain and move a part to the new child */
243 old_tail = parent->val.prev;
244 list_del_range(&to_split->list, old_tail);
245 new->val.next = &to_split->list;
246 new->val.prev = old_tail;
247 to_split->list.prev = &new->val;
248 old_tail->next = &new->val;
249
250 /* split the hits */
251 new->hit = parent->hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +0200252 new->children_hit = parent->children_hit;
253 parent->children_hit = cumul_hits(new);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200254 new->val_nr = parent->val_nr - idx_local;
255 parent->val_nr = idx_local;
256
257 /* create a new child for the new branch if any */
258 if (idx_total < chain->nr) {
259 parent->hit = 0;
260 add_child(parent, chain, idx_total, syms);
Frederic Weisbecker19532872009-08-07 07:11:05 +0200261 parent->children_hit++;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200262 } else {
263 parent->hit = 1;
264 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200265}
266
267static int
268__append_chain(struct callchain_node *root, struct ip_callchain *chain,
Ingo Molnarf37a2912009-07-01 12:37:06 +0200269 unsigned int start, struct symbol **syms);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200270
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200271static void
Frederic Weisbecker44249612009-07-01 05:35:14 +0200272__append_chain_children(struct callchain_node *root, struct ip_callchain *chain,
Ingo Molnarf37a2912009-07-01 12:37:06 +0200273 struct symbol **syms, unsigned int start)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200274{
275 struct callchain_node *rnode;
276
277 /* lookup in childrens */
Frederic Weisbecker14f46542009-07-02 17:58:19 +0200278 chain_for_each_child(rnode, root) {
Ingo Molnarf37a2912009-07-01 12:37:06 +0200279 unsigned int ret = __append_chain(rnode, chain, start, syms);
280
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200281 if (!ret)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200282 goto inc_children_hit;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200283 }
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200284 /* nothing in children, add to the current node */
285 add_child(root, chain, start, syms);
Frederic Weisbeckere05b8762009-07-05 07:39:20 +0200286
Frederic Weisbecker19532872009-08-07 07:11:05 +0200287inc_children_hit:
288 root->children_hit++;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200289}
290
291static int
292__append_chain(struct callchain_node *root, struct ip_callchain *chain,
Ingo Molnarf37a2912009-07-01 12:37:06 +0200293 unsigned int start, struct symbol **syms)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200294{
295 struct callchain_list *cnode;
Ingo Molnarf37a2912009-07-01 12:37:06 +0200296 unsigned int i = start;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200297 bool found = false;
298
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200299 /*
300 * Lookup in the current node
301 * If we have a symbol, then compare the start to match
302 * anywhere inside a function.
303 */
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200304 list_for_each_entry(cnode, &root->val, list) {
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200305 if (i == chain->nr)
306 break;
307 if (cnode->sym && syms[i]) {
308 if (cnode->sym->start != syms[i]->start)
309 break;
310 } else if (cnode->ip != chain->ips[i])
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200311 break;
312 if (!found)
313 found = true;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200314 i++;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200315 }
316
317 /* matches not, relay on the parent */
318 if (!found)
319 return -1;
320
321 /* we match only a part of the node. Split it and add the new chain */
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200322 if (i - start < root->val_nr) {
323 split_add_child(root, chain, cnode, start, i - start, syms);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200324 return 0;
325 }
326
327 /* we match 100% of the path, increment the hit */
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200328 if (i - start == root->val_nr && i == chain->nr) {
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200329 root->hit++;
330 return 0;
331 }
332
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200333 /* We match the node and still have a part remaining */
334 __append_chain_children(root, chain, syms, i);
335
336 return 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200337}
338
Frederic Weisbecker44249612009-07-01 05:35:14 +0200339void append_chain(struct callchain_node *root, struct ip_callchain *chain,
340 struct symbol **syms)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200341{
Frederic Weisbeckerb0efe212009-08-08 02:16:23 +0200342 if (!chain->nr)
343 return;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200344 __append_chain_children(root, chain, syms, 0);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200345}