Commit | Line | Data |
---|---|---|
8cb76d99 | 1 | /* |
1b3a0e95 | 2 | * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com> |
8cb76d99 FW |
3 | * |
4 | * Handle the callchains from the stream in an ad-hoc radix tree and then | |
5 | * sort them in an rbtree. | |
6 | * | |
deac911c FW |
7 | * 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 | * | |
8cb76d99 FW |
10 | */ |
11 | ||
12 | #include <stdlib.h> | |
13 | #include <stdio.h> | |
14 | #include <stdbool.h> | |
15 | #include <errno.h> | |
c0a8865e | 16 | #include <math.h> |
8cb76d99 | 17 | |
b965bb41 FW |
18 | #include "asm/bug.h" |
19 | ||
99571ab3 | 20 | #include "hist.h" |
b36f19d5 | 21 | #include "util.h" |
2dc9fb1a NK |
22 | #include "sort.h" |
23 | #include "machine.h" | |
8cb76d99 FW |
24 | #include "callchain.h" |
25 | ||
47260645 NK |
26 | __thread struct callchain_cursor callchain_cursor; |
27 | ||
c3a6a8c4 | 28 | int parse_callchain_record_opt(const char *arg, struct callchain_param *param) |
f7f084f4 | 29 | { |
076a30c4 | 30 | return parse_callchain_record(arg, param); |
f7f084f4 NK |
31 | } |
32 | ||
2b9240ca NK |
33 | static int parse_callchain_mode(const char *value) |
34 | { | |
35 | if (!strncmp(value, "graph", strlen(value))) { | |
36 | callchain_param.mode = CHAIN_GRAPH_ABS; | |
37 | return 0; | |
38 | } | |
39 | if (!strncmp(value, "flat", strlen(value))) { | |
40 | callchain_param.mode = CHAIN_FLAT; | |
41 | return 0; | |
42 | } | |
43 | if (!strncmp(value, "fractal", strlen(value))) { | |
44 | callchain_param.mode = CHAIN_GRAPH_REL; | |
45 | return 0; | |
46 | } | |
26e77924 NK |
47 | if (!strncmp(value, "folded", strlen(value))) { |
48 | callchain_param.mode = CHAIN_FOLDED; | |
49 | return 0; | |
50 | } | |
2b9240ca NK |
51 | return -1; |
52 | } | |
53 | ||
54 | static int parse_callchain_order(const char *value) | |
55 | { | |
56 | if (!strncmp(value, "caller", strlen(value))) { | |
57 | callchain_param.order = ORDER_CALLER; | |
792aeafa | 58 | callchain_param.order_set = true; |
2b9240ca NK |
59 | return 0; |
60 | } | |
61 | if (!strncmp(value, "callee", strlen(value))) { | |
62 | callchain_param.order = ORDER_CALLEE; | |
792aeafa | 63 | callchain_param.order_set = true; |
2b9240ca NK |
64 | return 0; |
65 | } | |
66 | return -1; | |
67 | } | |
68 | ||
69 | static int parse_callchain_sort_key(const char *value) | |
70 | { | |
71 | if (!strncmp(value, "function", strlen(value))) { | |
72 | callchain_param.key = CCKEY_FUNCTION; | |
73 | return 0; | |
74 | } | |
75 | if (!strncmp(value, "address", strlen(value))) { | |
76 | callchain_param.key = CCKEY_ADDRESS; | |
77 | return 0; | |
78 | } | |
8b7bad58 AK |
79 | if (!strncmp(value, "branch", strlen(value))) { |
80 | callchain_param.branch_callstack = 1; | |
81 | return 0; | |
82 | } | |
2b9240ca NK |
83 | return -1; |
84 | } | |
85 | ||
f2af0086 NK |
86 | static int parse_callchain_value(const char *value) |
87 | { | |
88 | if (!strncmp(value, "percent", strlen(value))) { | |
89 | callchain_param.value = CCVAL_PERCENT; | |
90 | return 0; | |
91 | } | |
92 | if (!strncmp(value, "period", strlen(value))) { | |
93 | callchain_param.value = CCVAL_PERIOD; | |
94 | return 0; | |
95 | } | |
96 | if (!strncmp(value, "count", strlen(value))) { | |
97 | callchain_param.value = CCVAL_COUNT; | |
98 | return 0; | |
99 | } | |
100 | return -1; | |
101 | } | |
102 | ||
a2c10d39 NK |
103 | static int |
104 | __parse_callchain_report_opt(const char *arg, bool allow_record_opt) | |
cff6bb46 | 105 | { |
e8232f1a | 106 | char *tok; |
cff6bb46 | 107 | char *endptr; |
e8232f1a | 108 | bool minpcnt_set = false; |
a2c10d39 NK |
109 | bool record_opt_set = false; |
110 | bool try_stack_size = false; | |
cff6bb46 DZ |
111 | |
112 | symbol_conf.use_callchain = true; | |
113 | ||
114 | if (!arg) | |
115 | return 0; | |
116 | ||
e8232f1a NK |
117 | while ((tok = strtok((char *)arg, ",")) != NULL) { |
118 | if (!strncmp(tok, "none", strlen(tok))) { | |
119 | callchain_param.mode = CHAIN_NONE; | |
120 | symbol_conf.use_callchain = false; | |
121 | return 0; | |
122 | } | |
123 | ||
2b9240ca NK |
124 | if (!parse_callchain_mode(tok) || |
125 | !parse_callchain_order(tok) || | |
f2af0086 NK |
126 | !parse_callchain_sort_key(tok) || |
127 | !parse_callchain_value(tok)) { | |
2b9240ca | 128 | /* parsing ok - move on to the next */ |
a2c10d39 NK |
129 | try_stack_size = false; |
130 | goto next; | |
131 | } else if (allow_record_opt && !record_opt_set) { | |
132 | if (parse_callchain_record(tok, &callchain_param)) | |
133 | goto try_numbers; | |
134 | ||
135 | /* assume that number followed by 'dwarf' is stack size */ | |
136 | if (callchain_param.record_mode == CALLCHAIN_DWARF) | |
137 | try_stack_size = true; | |
138 | ||
139 | record_opt_set = true; | |
140 | goto next; | |
141 | } | |
142 | ||
143 | try_numbers: | |
144 | if (try_stack_size) { | |
145 | unsigned long size = 0; | |
146 | ||
147 | if (get_stack_size(tok, &size) < 0) | |
148 | return -1; | |
149 | callchain_param.dump_size = size; | |
150 | try_stack_size = false; | |
2b9240ca NK |
151 | } else if (!minpcnt_set) { |
152 | /* try to get the min percent */ | |
e8232f1a NK |
153 | callchain_param.min_percent = strtod(tok, &endptr); |
154 | if (tok == endptr) | |
155 | return -1; | |
156 | minpcnt_set = true; | |
157 | } else { | |
158 | /* try print limit at last */ | |
159 | callchain_param.print_limit = strtoul(tok, &endptr, 0); | |
160 | if (tok == endptr) | |
161 | return -1; | |
162 | } | |
a2c10d39 | 163 | next: |
e8232f1a | 164 | arg = NULL; |
cff6bb46 DZ |
165 | } |
166 | ||
cff6bb46 DZ |
167 | if (callchain_register_param(&callchain_param) < 0) { |
168 | pr_err("Can't register callchain params\n"); | |
169 | return -1; | |
170 | } | |
171 | return 0; | |
172 | } | |
173 | ||
a2c10d39 NK |
174 | int parse_callchain_report_opt(const char *arg) |
175 | { | |
176 | return __parse_callchain_report_opt(arg, false); | |
177 | } | |
178 | ||
179 | int parse_callchain_top_opt(const char *arg) | |
180 | { | |
181 | return __parse_callchain_report_opt(arg, true); | |
182 | } | |
183 | ||
2b9240ca NK |
184 | int perf_callchain_config(const char *var, const char *value) |
185 | { | |
186 | char *endptr; | |
187 | ||
188 | if (prefixcmp(var, "call-graph.")) | |
189 | return 0; | |
190 | var += sizeof("call-graph.") - 1; | |
191 | ||
192 | if (!strcmp(var, "record-mode")) | |
c3a6a8c4 | 193 | return parse_callchain_record_opt(value, &callchain_param); |
2b9240ca NK |
194 | #ifdef HAVE_DWARF_UNWIND_SUPPORT |
195 | if (!strcmp(var, "dump-size")) { | |
196 | unsigned long size = 0; | |
197 | int ret; | |
198 | ||
199 | ret = get_stack_size(value, &size); | |
200 | callchain_param.dump_size = size; | |
201 | ||
202 | return ret; | |
203 | } | |
204 | #endif | |
205 | if (!strcmp(var, "print-type")) | |
206 | return parse_callchain_mode(value); | |
207 | if (!strcmp(var, "order")) | |
208 | return parse_callchain_order(value); | |
209 | if (!strcmp(var, "sort-key")) | |
210 | return parse_callchain_sort_key(value); | |
211 | if (!strcmp(var, "threshold")) { | |
212 | callchain_param.min_percent = strtod(value, &endptr); | |
213 | if (value == endptr) | |
214 | return -1; | |
215 | } | |
216 | if (!strcmp(var, "print-limit")) { | |
217 | callchain_param.print_limit = strtod(value, &endptr); | |
218 | if (value == endptr) | |
219 | return -1; | |
220 | } | |
221 | ||
222 | return 0; | |
223 | } | |
224 | ||
deac911c | 225 | static void |
4eb3e478 FW |
226 | rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, |
227 | enum chain_mode mode) | |
8cb76d99 FW |
228 | { |
229 | struct rb_node **p = &root->rb_node; | |
230 | struct rb_node *parent = NULL; | |
231 | struct callchain_node *rnode; | |
f08c3154 | 232 | u64 chain_cumul = callchain_cumul_hits(chain); |
8cb76d99 FW |
233 | |
234 | while (*p) { | |
1953287b FW |
235 | u64 rnode_cumul; |
236 | ||
8cb76d99 FW |
237 | parent = *p; |
238 | rnode = rb_entry(parent, struct callchain_node, rb_node); | |
f08c3154 | 239 | rnode_cumul = callchain_cumul_hits(rnode); |
8cb76d99 | 240 | |
4eb3e478 | 241 | switch (mode) { |
805d127d | 242 | case CHAIN_FLAT: |
26e77924 | 243 | case CHAIN_FOLDED: |
4eb3e478 FW |
244 | if (rnode->hit < chain->hit) |
245 | p = &(*p)->rb_left; | |
246 | else | |
247 | p = &(*p)->rb_right; | |
248 | break; | |
805d127d FW |
249 | case CHAIN_GRAPH_ABS: /* Falldown */ |
250 | case CHAIN_GRAPH_REL: | |
1953287b | 251 | if (rnode_cumul < chain_cumul) |
4eb3e478 FW |
252 | p = &(*p)->rb_left; |
253 | else | |
254 | p = &(*p)->rb_right; | |
255 | break; | |
83a0944f | 256 | case CHAIN_NONE: |
4eb3e478 FW |
257 | default: |
258 | break; | |
259 | } | |
8cb76d99 FW |
260 | } |
261 | ||
262 | rb_link_node(&chain->rb_node, parent, p); | |
263 | rb_insert_color(&chain->rb_node, root); | |
264 | } | |
265 | ||
805d127d FW |
266 | static void |
267 | __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, | |
268 | u64 min_hit) | |
269 | { | |
e369517c | 270 | struct rb_node *n; |
805d127d FW |
271 | struct callchain_node *child; |
272 | ||
e369517c NK |
273 | n = rb_first(&node->rb_root_in); |
274 | while (n) { | |
275 | child = rb_entry(n, struct callchain_node, rb_node_in); | |
276 | n = rb_next(n); | |
277 | ||
805d127d | 278 | __sort_chain_flat(rb_root, child, min_hit); |
e369517c | 279 | } |
805d127d FW |
280 | |
281 | if (node->hit && node->hit >= min_hit) | |
282 | rb_insert_callchain(rb_root, node, CHAIN_FLAT); | |
283 | } | |
284 | ||
8cb76d99 FW |
285 | /* |
286 | * Once we get every callchains from the stream, we can now | |
287 | * sort them by hit | |
288 | */ | |
805d127d | 289 | static void |
d2009c51 | 290 | sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, |
1d037ca1 | 291 | u64 min_hit, struct callchain_param *param __maybe_unused) |
805d127d | 292 | { |
0356218a | 293 | *rb_root = RB_ROOT; |
d2009c51 | 294 | __sort_chain_flat(rb_root, &root->node, min_hit); |
805d127d FW |
295 | } |
296 | ||
297 | static void __sort_chain_graph_abs(struct callchain_node *node, | |
298 | u64 min_hit) | |
8cb76d99 | 299 | { |
e369517c | 300 | struct rb_node *n; |
8cb76d99 FW |
301 | struct callchain_node *child; |
302 | ||
805d127d | 303 | node->rb_root = RB_ROOT; |
e369517c NK |
304 | n = rb_first(&node->rb_root_in); |
305 | ||
306 | while (n) { | |
307 | child = rb_entry(n, struct callchain_node, rb_node_in); | |
308 | n = rb_next(n); | |
8cb76d99 | 309 | |
805d127d | 310 | __sort_chain_graph_abs(child, min_hit); |
f08c3154 | 311 | if (callchain_cumul_hits(child) >= min_hit) |
805d127d FW |
312 | rb_insert_callchain(&node->rb_root, child, |
313 | CHAIN_GRAPH_ABS); | |
314 | } | |
315 | } | |
316 | ||
317 | static void | |
d2009c51 | 318 | sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, |
1d037ca1 | 319 | u64 min_hit, struct callchain_param *param __maybe_unused) |
805d127d | 320 | { |
d2009c51 FW |
321 | __sort_chain_graph_abs(&chain_root->node, min_hit); |
322 | rb_root->rb_node = chain_root->node.rb_root.rb_node; | |
4eb3e478 FW |
323 | } |
324 | ||
805d127d FW |
325 | static void __sort_chain_graph_rel(struct callchain_node *node, |
326 | double min_percent) | |
4eb3e478 | 327 | { |
e369517c | 328 | struct rb_node *n; |
4eb3e478 | 329 | struct callchain_node *child; |
805d127d | 330 | u64 min_hit; |
4eb3e478 FW |
331 | |
332 | node->rb_root = RB_ROOT; | |
c0a8865e | 333 | min_hit = ceil(node->children_hit * min_percent); |
4eb3e478 | 334 | |
e369517c NK |
335 | n = rb_first(&node->rb_root_in); |
336 | while (n) { | |
337 | child = rb_entry(n, struct callchain_node, rb_node_in); | |
338 | n = rb_next(n); | |
339 | ||
805d127d | 340 | __sort_chain_graph_rel(child, min_percent); |
f08c3154 | 341 | if (callchain_cumul_hits(child) >= min_hit) |
805d127d FW |
342 | rb_insert_callchain(&node->rb_root, child, |
343 | CHAIN_GRAPH_REL); | |
4eb3e478 FW |
344 | } |
345 | } | |
346 | ||
805d127d | 347 | static void |
d2009c51 | 348 | sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root, |
1d037ca1 | 349 | u64 min_hit __maybe_unused, struct callchain_param *param) |
4eb3e478 | 350 | { |
d2009c51 FW |
351 | __sort_chain_graph_rel(&chain_root->node, param->min_percent / 100.0); |
352 | rb_root->rb_node = chain_root->node.rb_root.rb_node; | |
8cb76d99 FW |
353 | } |
354 | ||
16537f13 | 355 | int callchain_register_param(struct callchain_param *param) |
805d127d FW |
356 | { |
357 | switch (param->mode) { | |
358 | case CHAIN_GRAPH_ABS: | |
359 | param->sort = sort_chain_graph_abs; | |
360 | break; | |
361 | case CHAIN_GRAPH_REL: | |
362 | param->sort = sort_chain_graph_rel; | |
363 | break; | |
364 | case CHAIN_FLAT: | |
26e77924 | 365 | case CHAIN_FOLDED: |
805d127d FW |
366 | param->sort = sort_chain_flat; |
367 | break; | |
83a0944f | 368 | case CHAIN_NONE: |
805d127d FW |
369 | default: |
370 | return -1; | |
371 | } | |
372 | return 0; | |
373 | } | |
374 | ||
deac911c FW |
375 | /* |
376 | * Create a child for a parent. If inherit_children, then the new child | |
377 | * will become the new parent of it's parent children | |
378 | */ | |
379 | static struct callchain_node * | |
380 | create_child(struct callchain_node *parent, bool inherit_children) | |
8cb76d99 FW |
381 | { |
382 | struct callchain_node *new; | |
383 | ||
cdd5b75b | 384 | new = zalloc(sizeof(*new)); |
8cb76d99 FW |
385 | if (!new) { |
386 | perror("not enough memory to create child for code path tree"); | |
387 | return NULL; | |
388 | } | |
389 | new->parent = parent; | |
8cb76d99 | 390 | INIT_LIST_HEAD(&new->val); |
4b3a3212 | 391 | INIT_LIST_HEAD(&new->parent_val); |
deac911c FW |
392 | |
393 | if (inherit_children) { | |
e369517c NK |
394 | struct rb_node *n; |
395 | struct callchain_node *child; | |
396 | ||
397 | new->rb_root_in = parent->rb_root_in; | |
398 | parent->rb_root_in = RB_ROOT; | |
deac911c | 399 | |
e369517c NK |
400 | n = rb_first(&new->rb_root_in); |
401 | while (n) { | |
402 | child = rb_entry(n, struct callchain_node, rb_node_in); | |
403 | child->parent = new; | |
404 | n = rb_next(n); | |
405 | } | |
deac911c | 406 | |
e369517c NK |
407 | /* make it the first child */ |
408 | rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); | |
409 | rb_insert_color(&new->rb_node_in, &parent->rb_root_in); | |
deac911c | 410 | } |
8cb76d99 FW |
411 | |
412 | return new; | |
413 | } | |
414 | ||
301fde27 | 415 | |
deac911c FW |
416 | /* |
417 | * Fill the node with callchain values | |
418 | */ | |
8451cbb9 | 419 | static int |
1b3a0e95 | 420 | fill_node(struct callchain_node *node, struct callchain_cursor *cursor) |
8cb76d99 | 421 | { |
1b3a0e95 FW |
422 | struct callchain_cursor_node *cursor_node; |
423 | ||
424 | node->val_nr = cursor->nr - cursor->pos; | |
425 | if (!node->val_nr) | |
426 | pr_warning("Warning: empty node in callchain tree\n"); | |
8cb76d99 | 427 | |
1b3a0e95 FW |
428 | cursor_node = callchain_cursor_current(cursor); |
429 | ||
430 | while (cursor_node) { | |
8cb76d99 FW |
431 | struct callchain_list *call; |
432 | ||
cdd5b75b | 433 | call = zalloc(sizeof(*call)); |
8cb76d99 FW |
434 | if (!call) { |
435 | perror("not enough memory for the code path tree"); | |
8451cbb9 | 436 | return -1; |
8cb76d99 | 437 | } |
1b3a0e95 FW |
438 | call->ip = cursor_node->ip; |
439 | call->ms.sym = cursor_node->sym; | |
440 | call->ms.map = cursor_node->map; | |
8cb76d99 | 441 | list_add_tail(&call->list, &node->val); |
1b3a0e95 FW |
442 | |
443 | callchain_cursor_advance(cursor); | |
444 | cursor_node = callchain_cursor_current(cursor); | |
8cb76d99 | 445 | } |
8451cbb9 | 446 | return 0; |
8cb76d99 FW |
447 | } |
448 | ||
e369517c | 449 | static struct callchain_node * |
1b3a0e95 FW |
450 | add_child(struct callchain_node *parent, |
451 | struct callchain_cursor *cursor, | |
452 | u64 period) | |
8cb76d99 FW |
453 | { |
454 | struct callchain_node *new; | |
455 | ||
deac911c | 456 | new = create_child(parent, false); |
7565bd39 NK |
457 | if (new == NULL) |
458 | return NULL; | |
459 | ||
8451cbb9 NK |
460 | if (fill_node(new, cursor) < 0) { |
461 | struct callchain_list *call, *tmp; | |
462 | ||
463 | list_for_each_entry_safe(call, tmp, &new->val, list) { | |
464 | list_del(&call->list); | |
465 | free(call); | |
466 | } | |
467 | free(new); | |
468 | return NULL; | |
469 | } | |
8cb76d99 | 470 | |
1953287b | 471 | new->children_hit = 0; |
108553e1 | 472 | new->hit = period; |
5e47f8ff NK |
473 | new->children_count = 0; |
474 | new->count = 1; | |
e369517c NK |
475 | return new; |
476 | } | |
477 | ||
2d713b80 NK |
478 | enum match_result { |
479 | MATCH_ERROR = -1, | |
480 | MATCH_EQ, | |
481 | MATCH_LT, | |
482 | MATCH_GT, | |
483 | }; | |
484 | ||
485 | static enum match_result match_chain(struct callchain_cursor_node *node, | |
486 | struct callchain_list *cnode) | |
e369517c NK |
487 | { |
488 | struct symbol *sym = node->sym; | |
2d713b80 | 489 | u64 left, right; |
e369517c NK |
490 | |
491 | if (cnode->ms.sym && sym && | |
2d713b80 NK |
492 | callchain_param.key == CCKEY_FUNCTION) { |
493 | left = cnode->ms.sym->start; | |
494 | right = sym->start; | |
495 | } else { | |
496 | left = cnode->ip; | |
497 | right = node->ip; | |
498 | } | |
499 | ||
500 | if (left == right) | |
501 | return MATCH_EQ; | |
502 | ||
503 | return left > right ? MATCH_GT : MATCH_LT; | |
8cb76d99 FW |
504 | } |
505 | ||
deac911c FW |
506 | /* |
507 | * Split the parent in two parts (a new child is created) and | |
508 | * give a part of its callchain to the created child. | |
509 | * Then create another child to host the given callchain of new branch | |
510 | */ | |
8cb76d99 | 511 | static void |
1b3a0e95 FW |
512 | split_add_child(struct callchain_node *parent, |
513 | struct callchain_cursor *cursor, | |
514 | struct callchain_list *to_split, | |
515 | u64 idx_parents, u64 idx_local, u64 period) | |
8cb76d99 FW |
516 | { |
517 | struct callchain_node *new; | |
deac911c | 518 | struct list_head *old_tail; |
f37a291c | 519 | unsigned int idx_total = idx_parents + idx_local; |
8cb76d99 FW |
520 | |
521 | /* split */ | |
deac911c FW |
522 | new = create_child(parent, true); |
523 | ||
524 | /* split the callchain and move a part to the new child */ | |
525 | old_tail = parent->val.prev; | |
526 | list_del_range(&to_split->list, old_tail); | |
527 | new->val.next = &to_split->list; | |
528 | new->val.prev = old_tail; | |
529 | to_split->list.prev = &new->val; | |
530 | old_tail->next = &new->val; | |
8cb76d99 | 531 | |
deac911c FW |
532 | /* split the hits */ |
533 | new->hit = parent->hit; | |
1953287b | 534 | new->children_hit = parent->children_hit; |
f08c3154 | 535 | parent->children_hit = callchain_cumul_hits(new); |
deac911c FW |
536 | new->val_nr = parent->val_nr - idx_local; |
537 | parent->val_nr = idx_local; | |
5e47f8ff NK |
538 | new->count = parent->count; |
539 | new->children_count = parent->children_count; | |
540 | parent->children_count = callchain_cumul_counts(new); | |
deac911c FW |
541 | |
542 | /* create a new child for the new branch if any */ | |
1b3a0e95 | 543 | if (idx_total < cursor->nr) { |
e369517c NK |
544 | struct callchain_node *first; |
545 | struct callchain_list *cnode; | |
546 | struct callchain_cursor_node *node; | |
547 | struct rb_node *p, **pp; | |
548 | ||
deac911c | 549 | parent->hit = 0; |
108553e1 | 550 | parent->children_hit += period; |
5e47f8ff NK |
551 | parent->count = 0; |
552 | parent->children_count += 1; | |
e369517c NK |
553 | |
554 | node = callchain_cursor_current(cursor); | |
555 | new = add_child(parent, cursor, period); | |
7565bd39 NK |
556 | if (new == NULL) |
557 | return; | |
e369517c NK |
558 | |
559 | /* | |
560 | * This is second child since we moved parent's children | |
561 | * to new (first) child above. | |
562 | */ | |
563 | p = parent->rb_root_in.rb_node; | |
564 | first = rb_entry(p, struct callchain_node, rb_node_in); | |
565 | cnode = list_first_entry(&first->val, struct callchain_list, | |
566 | list); | |
567 | ||
2d713b80 | 568 | if (match_chain(node, cnode) == MATCH_LT) |
e369517c NK |
569 | pp = &p->rb_left; |
570 | else | |
571 | pp = &p->rb_right; | |
572 | ||
573 | rb_link_node(&new->rb_node_in, p, pp); | |
574 | rb_insert_color(&new->rb_node_in, &parent->rb_root_in); | |
deac911c | 575 | } else { |
108553e1 | 576 | parent->hit = period; |
5e47f8ff | 577 | parent->count = 1; |
deac911c | 578 | } |
8cb76d99 FW |
579 | } |
580 | ||
2d713b80 | 581 | static enum match_result |
1b3a0e95 FW |
582 | append_chain(struct callchain_node *root, |
583 | struct callchain_cursor *cursor, | |
584 | u64 period); | |
8cb76d99 | 585 | |
deac911c | 586 | static void |
1b3a0e95 FW |
587 | append_chain_children(struct callchain_node *root, |
588 | struct callchain_cursor *cursor, | |
589 | u64 period) | |
8cb76d99 FW |
590 | { |
591 | struct callchain_node *rnode; | |
e369517c NK |
592 | struct callchain_cursor_node *node; |
593 | struct rb_node **p = &root->rb_root_in.rb_node; | |
594 | struct rb_node *parent = NULL; | |
595 | ||
596 | node = callchain_cursor_current(cursor); | |
597 | if (!node) | |
598 | return; | |
8cb76d99 FW |
599 | |
600 | /* lookup in childrens */ | |
e369517c | 601 | while (*p) { |
2d713b80 | 602 | enum match_result ret; |
f37a291c | 603 | |
e369517c NK |
604 | parent = *p; |
605 | rnode = rb_entry(parent, struct callchain_node, rb_node_in); | |
e369517c | 606 | |
b965bb41 FW |
607 | /* If at least first entry matches, rely to children */ |
608 | ret = append_chain(rnode, cursor, period); | |
2d713b80 | 609 | if (ret == MATCH_EQ) |
1953287b | 610 | goto inc_children_hit; |
e369517c | 611 | |
2d713b80 | 612 | if (ret == MATCH_LT) |
e369517c NK |
613 | p = &parent->rb_left; |
614 | else | |
615 | p = &parent->rb_right; | |
8cb76d99 | 616 | } |
deac911c | 617 | /* nothing in children, add to the current node */ |
e369517c | 618 | rnode = add_child(root, cursor, period); |
7565bd39 NK |
619 | if (rnode == NULL) |
620 | return; | |
621 | ||
e369517c NK |
622 | rb_link_node(&rnode->rb_node_in, parent, p); |
623 | rb_insert_color(&rnode->rb_node_in, &root->rb_root_in); | |
e05b876c | 624 | |
1953287b | 625 | inc_children_hit: |
108553e1 | 626 | root->children_hit += period; |
5e47f8ff | 627 | root->children_count++; |
8cb76d99 FW |
628 | } |
629 | ||
2d713b80 | 630 | static enum match_result |
1b3a0e95 FW |
631 | append_chain(struct callchain_node *root, |
632 | struct callchain_cursor *cursor, | |
633 | u64 period) | |
8cb76d99 FW |
634 | { |
635 | struct callchain_list *cnode; | |
1b3a0e95 | 636 | u64 start = cursor->pos; |
8cb76d99 | 637 | bool found = false; |
1b3a0e95 | 638 | u64 matches; |
2d713b80 | 639 | enum match_result cmp = MATCH_ERROR; |
8cb76d99 | 640 | |
deac911c FW |
641 | /* |
642 | * Lookup in the current node | |
643 | * If we have a symbol, then compare the start to match | |
99571ab3 AK |
644 | * anywhere inside a function, unless function |
645 | * mode is disabled. | |
deac911c | 646 | */ |
8cb76d99 | 647 | list_for_each_entry(cnode, &root->val, list) { |
1b3a0e95 | 648 | struct callchain_cursor_node *node; |
301fde27 | 649 | |
1b3a0e95 FW |
650 | node = callchain_cursor_current(cursor); |
651 | if (!node) | |
deac911c | 652 | break; |
301fde27 | 653 | |
b965bb41 | 654 | cmp = match_chain(node, cnode); |
2d713b80 | 655 | if (cmp != MATCH_EQ) |
8cb76d99 | 656 | break; |
301fde27 | 657 | |
e369517c | 658 | found = true; |
1b3a0e95 FW |
659 | |
660 | callchain_cursor_advance(cursor); | |
8cb76d99 FW |
661 | } |
662 | ||
e369517c | 663 | /* matches not, relay no the parent */ |
1b3a0e95 | 664 | if (!found) { |
2d713b80 | 665 | WARN_ONCE(cmp == MATCH_ERROR, "Chain comparison error\n"); |
b965bb41 | 666 | return cmp; |
1b3a0e95 FW |
667 | } |
668 | ||
669 | matches = cursor->pos - start; | |
8cb76d99 FW |
670 | |
671 | /* we match only a part of the node. Split it and add the new chain */ | |
1b3a0e95 FW |
672 | if (matches < root->val_nr) { |
673 | split_add_child(root, cursor, cnode, start, matches, period); | |
2d713b80 | 674 | return MATCH_EQ; |
8cb76d99 FW |
675 | } |
676 | ||
677 | /* we match 100% of the path, increment the hit */ | |
1b3a0e95 | 678 | if (matches == root->val_nr && cursor->pos == cursor->nr) { |
108553e1 | 679 | root->hit += period; |
5e47f8ff | 680 | root->count++; |
2d713b80 | 681 | return MATCH_EQ; |
8cb76d99 FW |
682 | } |
683 | ||
deac911c | 684 | /* We match the node and still have a part remaining */ |
1b3a0e95 | 685 | append_chain_children(root, cursor, period); |
deac911c | 686 | |
2d713b80 | 687 | return MATCH_EQ; |
8cb76d99 FW |
688 | } |
689 | ||
1b3a0e95 FW |
690 | int callchain_append(struct callchain_root *root, |
691 | struct callchain_cursor *cursor, | |
692 | u64 period) | |
8cb76d99 | 693 | { |
1b3a0e95 | 694 | if (!cursor->nr) |
301fde27 FW |
695 | return 0; |
696 | ||
1b3a0e95 | 697 | callchain_cursor_commit(cursor); |
301fde27 | 698 | |
1b3a0e95 | 699 | append_chain_children(&root->node, cursor, period); |
d2009c51 | 700 | |
1b3a0e95 FW |
701 | if (cursor->nr > root->max_depth) |
702 | root->max_depth = cursor->nr; | |
301fde27 FW |
703 | |
704 | return 0; | |
8cb76d99 | 705 | } |
612d4fd7 FW |
706 | |
707 | static int | |
1b3a0e95 FW |
708 | merge_chain_branch(struct callchain_cursor *cursor, |
709 | struct callchain_node *dst, struct callchain_node *src) | |
612d4fd7 | 710 | { |
1b3a0e95 | 711 | struct callchain_cursor_node **old_last = cursor->last; |
e369517c | 712 | struct callchain_node *child; |
612d4fd7 | 713 | struct callchain_list *list, *next_list; |
e369517c | 714 | struct rb_node *n; |
1b3a0e95 | 715 | int old_pos = cursor->nr; |
612d4fd7 FW |
716 | int err = 0; |
717 | ||
718 | list_for_each_entry_safe(list, next_list, &src->val, list) { | |
1b3a0e95 FW |
719 | callchain_cursor_append(cursor, list->ip, |
720 | list->ms.map, list->ms.sym); | |
612d4fd7 FW |
721 | list_del(&list->list); |
722 | free(list); | |
723 | } | |
724 | ||
1b3a0e95 FW |
725 | if (src->hit) { |
726 | callchain_cursor_commit(cursor); | |
727 | append_chain_children(dst, cursor, src->hit); | |
728 | } | |
612d4fd7 | 729 | |
e369517c NK |
730 | n = rb_first(&src->rb_root_in); |
731 | while (n) { | |
732 | child = container_of(n, struct callchain_node, rb_node_in); | |
733 | n = rb_next(n); | |
734 | rb_erase(&child->rb_node_in, &src->rb_root_in); | |
735 | ||
1b3a0e95 | 736 | err = merge_chain_branch(cursor, dst, child); |
612d4fd7 FW |
737 | if (err) |
738 | break; | |
739 | ||
612d4fd7 FW |
740 | free(child); |
741 | } | |
742 | ||
1b3a0e95 FW |
743 | cursor->nr = old_pos; |
744 | cursor->last = old_last; | |
612d4fd7 FW |
745 | |
746 | return err; | |
747 | } | |
748 | ||
1b3a0e95 FW |
749 | int callchain_merge(struct callchain_cursor *cursor, |
750 | struct callchain_root *dst, struct callchain_root *src) | |
751 | { | |
752 | return merge_chain_branch(cursor, &dst->node, &src->node); | |
753 | } | |
754 | ||
755 | int callchain_cursor_append(struct callchain_cursor *cursor, | |
756 | u64 ip, struct map *map, struct symbol *sym) | |
612d4fd7 | 757 | { |
1b3a0e95 | 758 | struct callchain_cursor_node *node = *cursor->last; |
612d4fd7 | 759 | |
1b3a0e95 | 760 | if (!node) { |
91b98804 | 761 | node = calloc(1, sizeof(*node)); |
1b3a0e95 FW |
762 | if (!node) |
763 | return -ENOMEM; | |
612d4fd7 | 764 | |
1b3a0e95 FW |
765 | *cursor->last = node; |
766 | } | |
612d4fd7 | 767 | |
1b3a0e95 FW |
768 | node->ip = ip; |
769 | node->map = map; | |
770 | node->sym = sym; | |
612d4fd7 | 771 | |
1b3a0e95 | 772 | cursor->nr++; |
612d4fd7 | 773 | |
1b3a0e95 FW |
774 | cursor->last = &node->next; |
775 | ||
776 | return 0; | |
612d4fd7 | 777 | } |
2dc9fb1a NK |
778 | |
779 | int sample__resolve_callchain(struct perf_sample *sample, struct symbol **parent, | |
780 | struct perf_evsel *evsel, struct addr_location *al, | |
781 | int max_stack) | |
782 | { | |
783 | if (sample->callchain == NULL) | |
784 | return 0; | |
785 | ||
7a13aa28 NK |
786 | if (symbol_conf.use_callchain || symbol_conf.cumulate_callchain || |
787 | sort__has_parent) { | |
cc8b7c2b ACM |
788 | return thread__resolve_callchain(al->thread, evsel, sample, |
789 | parent, al, max_stack); | |
2dc9fb1a NK |
790 | } |
791 | return 0; | |
792 | } | |
793 | ||
794 | int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample) | |
795 | { | |
4d40b051 | 796 | if (!symbol_conf.use_callchain || sample->callchain == NULL) |
2dc9fb1a NK |
797 | return 0; |
798 | return callchain_append(he->callchain, &callchain_cursor, sample->period); | |
799 | } | |
c7405d85 NK |
800 | |
801 | int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node, | |
802 | bool hide_unresolved) | |
803 | { | |
804 | al->map = node->map; | |
805 | al->sym = node->sym; | |
806 | if (node->map) | |
807 | al->addr = node->map->map_ip(node->map, node->ip); | |
808 | else | |
809 | al->addr = node->ip; | |
810 | ||
811 | if (al->sym == NULL) { | |
812 | if (hide_unresolved) | |
813 | return 0; | |
814 | if (al->map == NULL) | |
815 | goto out; | |
816 | } | |
817 | ||
818 | if (al->map->groups == &al->machine->kmaps) { | |
819 | if (machine__is_host(al->machine)) { | |
820 | al->cpumode = PERF_RECORD_MISC_KERNEL; | |
821 | al->level = 'k'; | |
822 | } else { | |
823 | al->cpumode = PERF_RECORD_MISC_GUEST_KERNEL; | |
824 | al->level = 'g'; | |
825 | } | |
826 | } else { | |
827 | if (machine__is_host(al->machine)) { | |
828 | al->cpumode = PERF_RECORD_MISC_USER; | |
829 | al->level = '.'; | |
830 | } else if (perf_guest) { | |
831 | al->cpumode = PERF_RECORD_MISC_GUEST_USER; | |
832 | al->level = 'u'; | |
833 | } else { | |
834 | al->cpumode = PERF_RECORD_MISC_HYPERVISOR; | |
835 | al->level = 'H'; | |
836 | } | |
837 | } | |
838 | ||
839 | out: | |
840 | return 1; | |
841 | } | |
2989ccaa AK |
842 | |
843 | char *callchain_list__sym_name(struct callchain_list *cl, | |
844 | char *bf, size_t bfsize, bool show_dso) | |
845 | { | |
846 | int printed; | |
847 | ||
848 | if (cl->ms.sym) { | |
23f0981b AK |
849 | if (callchain_param.key == CCKEY_ADDRESS && |
850 | cl->ms.map && !cl->srcline) | |
851 | cl->srcline = get_srcline(cl->ms.map->dso, | |
852 | map__rip_2objdump(cl->ms.map, | |
85c116a6 AK |
853 | cl->ip), |
854 | cl->ms.sym, false); | |
23f0981b AK |
855 | if (cl->srcline) |
856 | printed = scnprintf(bf, bfsize, "%s %s", | |
857 | cl->ms.sym->name, cl->srcline); | |
858 | else | |
859 | printed = scnprintf(bf, bfsize, "%s", cl->ms.sym->name); | |
2989ccaa AK |
860 | } else |
861 | printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip); | |
862 | ||
863 | if (show_dso) | |
864 | scnprintf(bf + printed, bfsize - printed, " %s", | |
865 | cl->ms.map ? | |
866 | cl->ms.map->dso->short_name : | |
867 | "unknown"); | |
868 | ||
869 | return bf; | |
870 | } | |
d114960c | 871 | |
5ab250ca NK |
872 | char *callchain_node__scnprintf_value(struct callchain_node *node, |
873 | char *bf, size_t bfsize, u64 total) | |
874 | { | |
875 | double percent = 0.0; | |
876 | u64 period = callchain_cumul_hits(node); | |
f2af0086 | 877 | unsigned count = callchain_cumul_counts(node); |
5ab250ca | 878 | |
f2af0086 | 879 | if (callchain_param.mode == CHAIN_FOLDED) { |
5ab250ca | 880 | period = node->hit; |
f2af0086 NK |
881 | count = node->count; |
882 | } | |
5ab250ca | 883 | |
f2af0086 NK |
884 | switch (callchain_param.value) { |
885 | case CCVAL_PERIOD: | |
886 | scnprintf(bf, bfsize, "%"PRIu64, period); | |
887 | break; | |
888 | case CCVAL_COUNT: | |
889 | scnprintf(bf, bfsize, "%u", count); | |
890 | break; | |
891 | case CCVAL_PERCENT: | |
892 | default: | |
893 | if (total) | |
894 | percent = period * 100.0 / total; | |
895 | scnprintf(bf, bfsize, "%.2f%%", percent); | |
896 | break; | |
897 | } | |
5ab250ca NK |
898 | return bf; |
899 | } | |
900 | ||
901 | int callchain_node__fprintf_value(struct callchain_node *node, | |
902 | FILE *fp, u64 total) | |
903 | { | |
904 | double percent = 0.0; | |
905 | u64 period = callchain_cumul_hits(node); | |
f2af0086 | 906 | unsigned count = callchain_cumul_counts(node); |
5ab250ca | 907 | |
f2af0086 | 908 | if (callchain_param.mode == CHAIN_FOLDED) { |
5ab250ca | 909 | period = node->hit; |
f2af0086 NK |
910 | count = node->count; |
911 | } | |
5ab250ca | 912 | |
f2af0086 NK |
913 | switch (callchain_param.value) { |
914 | case CCVAL_PERIOD: | |
915 | return fprintf(fp, "%"PRIu64, period); | |
916 | case CCVAL_COUNT: | |
917 | return fprintf(fp, "%u", count); | |
918 | case CCVAL_PERCENT: | |
919 | default: | |
920 | if (total) | |
921 | percent = period * 100.0 / total; | |
922 | return percent_color_fprintf(fp, "%.2f%%", percent); | |
923 | } | |
924 | return 0; | |
5ab250ca NK |
925 | } |
926 | ||
d114960c NK |
927 | static void free_callchain_node(struct callchain_node *node) |
928 | { | |
929 | struct callchain_list *list, *tmp; | |
930 | struct callchain_node *child; | |
931 | struct rb_node *n; | |
932 | ||
4b3a3212 NK |
933 | list_for_each_entry_safe(list, tmp, &node->parent_val, list) { |
934 | list_del(&list->list); | |
935 | free(list); | |
936 | } | |
937 | ||
d114960c NK |
938 | list_for_each_entry_safe(list, tmp, &node->val, list) { |
939 | list_del(&list->list); | |
940 | free(list); | |
941 | } | |
942 | ||
943 | n = rb_first(&node->rb_root_in); | |
944 | while (n) { | |
945 | child = container_of(n, struct callchain_node, rb_node_in); | |
946 | n = rb_next(n); | |
947 | rb_erase(&child->rb_node_in, &node->rb_root_in); | |
948 | ||
949 | free_callchain_node(child); | |
950 | free(child); | |
951 | } | |
952 | } | |
953 | ||
954 | void free_callchain(struct callchain_root *root) | |
955 | { | |
956 | if (!symbol_conf.use_callchain) | |
957 | return; | |
958 | ||
959 | free_callchain_node(&root->node); | |
960 | } | |
4b3a3212 | 961 | |
42b276a2 NK |
962 | static u64 decay_callchain_node(struct callchain_node *node) |
963 | { | |
964 | struct callchain_node *child; | |
965 | struct rb_node *n; | |
966 | u64 child_hits = 0; | |
967 | ||
968 | n = rb_first(&node->rb_root_in); | |
969 | while (n) { | |
970 | child = container_of(n, struct callchain_node, rb_node_in); | |
971 | ||
972 | child_hits += decay_callchain_node(child); | |
973 | n = rb_next(n); | |
974 | } | |
975 | ||
976 | node->hit = (node->hit * 7) / 8; | |
977 | node->children_hit = child_hits; | |
978 | ||
979 | return node->hit; | |
980 | } | |
981 | ||
982 | void decay_callchain(struct callchain_root *root) | |
983 | { | |
984 | if (!symbol_conf.use_callchain) | |
985 | return; | |
986 | ||
987 | decay_callchain_node(&root->node); | |
988 | } | |
989 | ||
4b3a3212 NK |
990 | int callchain_node__make_parent_list(struct callchain_node *node) |
991 | { | |
992 | struct callchain_node *parent = node->parent; | |
993 | struct callchain_list *chain, *new; | |
994 | LIST_HEAD(head); | |
995 | ||
996 | while (parent) { | |
997 | list_for_each_entry_reverse(chain, &parent->val, list) { | |
998 | new = malloc(sizeof(*new)); | |
999 | if (new == NULL) | |
1000 | goto out; | |
1001 | *new = *chain; | |
1002 | new->has_children = false; | |
1003 | list_add_tail(&new->list, &head); | |
1004 | } | |
1005 | parent = parent->parent; | |
1006 | } | |
1007 | ||
1008 | list_for_each_entry_safe_reverse(chain, new, &head, list) | |
1009 | list_move_tail(&chain->list, &node->parent_val); | |
1010 | ||
1011 | if (!list_empty(&node->parent_val)) { | |
1012 | chain = list_first_entry(&node->parent_val, struct callchain_list, list); | |
1013 | chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); | |
1014 | ||
1015 | chain = list_first_entry(&node->val, struct callchain_list, list); | |
1016 | chain->has_children = false; | |
1017 | } | |
1018 | return 0; | |
1019 | ||
1020 | out: | |
1021 | list_for_each_entry_safe(chain, new, &head, list) { | |
1022 | list_del(&chain->list); | |
1023 | free(chain); | |
1024 | } | |
1025 | return -ENOMEM; | |
1026 | } |