blob: 8e2777133bd907e1903e8d0afab583f5f88fc74d [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02002/*
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01003 * Copyright (C) 2009-2011, Frederic Weisbecker <fweisbec@gmail.com>
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +02004 *
5 * Handle the callchains from the stream in an ad-hoc radix tree and then
6 * sort them in an rbtree.
7 *
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +02008 * Using a radix for code path provides a fast retrieval and factorizes
9 * memory use. Also that lets us use the paths in a hierarchical graph view.
10 *
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020011 */
12
Arnaldo Carvalho de Melofd20e812017-04-17 15:23:08 -030013#include <inttypes.h>
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020014#include <stdlib.h>
15#include <stdio.h>
16#include <stdbool.h>
17#include <errno.h>
Frederic Weisbeckerc0a88652009-08-09 04:19:15 +020018#include <math.h>
Arnaldo Carvalho de Melo8520a982019-08-29 16:18:59 -030019#include <linux/string.h>
Arnaldo Carvalho de Melo7f7c5362019-07-04 11:32:27 -030020#include <linux/zalloc.h>
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020021
Frederic Weisbeckerb965bb42014-01-14 16:37:15 +010022#include "asm/bug.h"
23
Arnaldo Carvalho de Melo185bcb92019-08-22 17:11:39 -030024#include "debug.h"
Arnaldo Carvalho de Melo4a3cec82019-08-30 11:11:01 -030025#include "dso.h"
Arnaldo Carvalho de Meloea49e012019-09-18 11:36:13 -030026#include "event.h"
Andi Kleen99571ab2013-07-18 15:33:57 -070027#include "hist.h"
Namhyung Kim2dc9fb12014-01-14 14:25:35 +090028#include "sort.h"
29#include "machine.h"
Arnaldo Carvalho de Melo1101f692019-01-27 13:42:37 +010030#include "map.h"
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020031#include "callchain.h"
Jin Yaob851dd42017-07-18 20:13:15 +080032#include "branch.h"
Arnaldo Carvalho de Melo7cadca82019-01-27 14:10:31 +010033#include "symbol.h"
Arnaldo Carvalho de Meloc1a604d2019-08-29 15:20:59 -030034#include "../perf.h"
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +020035
Arnaldo Carvalho de Melo56e2e052017-04-19 18:38:33 -030036#define CALLCHAIN_PARAM_DEFAULT \
37 .mode = CHAIN_GRAPH_ABS, \
38 .min_percent = 0.5, \
39 .order = ORDER_CALLEE, \
40 .key = CCKEY_FUNCTION, \
41 .value = CCVAL_PERCENT, \
42
43struct callchain_param callchain_param = {
44 CALLCHAIN_PARAM_DEFAULT
45};
46
Arnaldo Carvalho de Meloeabad8c2018-01-15 16:48:46 -030047/*
48 * Are there any events usind DWARF callchains?
49 *
50 * I.e.
51 *
52 * -e cycles/call-graph=dwarf/
53 */
54bool dwarf_callchain_users;
55
Arnaldo Carvalho de Melo56e2e052017-04-19 18:38:33 -030056struct callchain_param callchain_param_default = {
57 CALLCHAIN_PARAM_DEFAULT
58};
59
Namhyung Kim47260642012-05-31 14:43:26 +090060__thread struct callchain_cursor callchain_cursor;
61
Kan Liangc3a6a8c2015-08-04 04:30:20 -040062int parse_callchain_record_opt(const char *arg, struct callchain_param *param)
Namhyung Kimf7f084f2014-09-23 10:01:42 +090063{
Kan Liang076a30c2015-08-06 15:44:52 -040064 return parse_callchain_record(arg, param);
Namhyung Kimf7f084f2014-09-23 10:01:42 +090065}
66
Namhyung Kim2b9240c2014-09-23 10:01:43 +090067static int parse_callchain_mode(const char *value)
68{
69 if (!strncmp(value, "graph", strlen(value))) {
70 callchain_param.mode = CHAIN_GRAPH_ABS;
71 return 0;
72 }
73 if (!strncmp(value, "flat", strlen(value))) {
74 callchain_param.mode = CHAIN_FLAT;
75 return 0;
76 }
77 if (!strncmp(value, "fractal", strlen(value))) {
78 callchain_param.mode = CHAIN_GRAPH_REL;
79 return 0;
80 }
Namhyung Kim26e77922015-11-09 14:45:37 +090081 if (!strncmp(value, "folded", strlen(value))) {
82 callchain_param.mode = CHAIN_FOLDED;
83 return 0;
84 }
Namhyung Kim2b9240c2014-09-23 10:01:43 +090085 return -1;
86}
87
88static int parse_callchain_order(const char *value)
89{
90 if (!strncmp(value, "caller", strlen(value))) {
91 callchain_param.order = ORDER_CALLER;
Namhyung Kim792aeaf2015-10-22 16:45:46 +090092 callchain_param.order_set = true;
Namhyung Kim2b9240c2014-09-23 10:01:43 +090093 return 0;
94 }
95 if (!strncmp(value, "callee", strlen(value))) {
96 callchain_param.order = ORDER_CALLEE;
Namhyung Kim792aeaf2015-10-22 16:45:46 +090097 callchain_param.order_set = true;
Namhyung Kim2b9240c2014-09-23 10:01:43 +090098 return 0;
99 }
100 return -1;
101}
102
103static int parse_callchain_sort_key(const char *value)
104{
105 if (!strncmp(value, "function", strlen(value))) {
106 callchain_param.key = CCKEY_FUNCTION;
107 return 0;
108 }
109 if (!strncmp(value, "address", strlen(value))) {
110 callchain_param.key = CCKEY_ADDRESS;
111 return 0;
112 }
Milian Wolff5dfa2102017-03-18 22:49:28 +0100113 if (!strncmp(value, "srcline", strlen(value))) {
114 callchain_param.key = CCKEY_SRCLINE;
115 return 0;
116 }
Andi Kleen8b7bad52014-11-12 18:05:20 -0800117 if (!strncmp(value, "branch", strlen(value))) {
118 callchain_param.branch_callstack = 1;
119 return 0;
120 }
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900121 return -1;
122}
123
Namhyung Kimf2af0082015-11-09 14:45:41 +0900124static int parse_callchain_value(const char *value)
125{
126 if (!strncmp(value, "percent", strlen(value))) {
127 callchain_param.value = CCVAL_PERCENT;
128 return 0;
129 }
130 if (!strncmp(value, "period", strlen(value))) {
131 callchain_param.value = CCVAL_PERIOD;
132 return 0;
133 }
134 if (!strncmp(value, "count", strlen(value))) {
135 callchain_param.value = CCVAL_COUNT;
136 return 0;
137 }
138 return -1;
139}
140
Arnaldo Carvalho de Melo56e2e052017-04-19 18:38:33 -0300141static int get_stack_size(const char *str, unsigned long *_size)
142{
143 char *endptr;
144 unsigned long size;
145 unsigned long max_size = round_down(USHRT_MAX, sizeof(u64));
146
147 size = strtoul(str, &endptr, 0);
148
149 do {
150 if (*endptr)
151 break;
152
153 size = round_up(size, sizeof(u64));
154 if (!size || size > max_size)
155 break;
156
157 *_size = size;
158 return 0;
159
160 } while (0);
161
162 pr_err("callchain: Incorrect stack dump size (max %ld): %s\n",
163 max_size, str);
164 return -1;
165}
166
Namhyung Kima2c10d32015-10-22 15:28:49 +0900167static int
168__parse_callchain_report_opt(const char *arg, bool allow_record_opt)
Don Zickuscff6bb42014-04-07 14:55:24 -0400169{
Namhyung Kime8232f12014-08-14 15:01:38 +0900170 char *tok;
Arnaldo Carvalho de Melodadafc32017-04-05 11:38:10 -0300171 char *endptr, *saveptr = NULL;
Namhyung Kime8232f12014-08-14 15:01:38 +0900172 bool minpcnt_set = false;
Namhyung Kima2c10d32015-10-22 15:28:49 +0900173 bool record_opt_set = false;
174 bool try_stack_size = false;
Don Zickuscff6bb42014-04-07 14:55:24 -0400175
Arnaldo Carvalho de Melo30234f02016-04-18 11:53:07 -0300176 callchain_param.enabled = true;
Don Zickuscff6bb42014-04-07 14:55:24 -0400177 symbol_conf.use_callchain = true;
178
179 if (!arg)
180 return 0;
181
Arnaldo Carvalho de Melodadafc32017-04-05 11:38:10 -0300182 while ((tok = strtok_r((char *)arg, ",", &saveptr)) != NULL) {
Namhyung Kime8232f12014-08-14 15:01:38 +0900183 if (!strncmp(tok, "none", strlen(tok))) {
184 callchain_param.mode = CHAIN_NONE;
Arnaldo Carvalho de Melo30234f02016-04-18 11:53:07 -0300185 callchain_param.enabled = false;
Namhyung Kime8232f12014-08-14 15:01:38 +0900186 symbol_conf.use_callchain = false;
187 return 0;
188 }
Don Zickuscff6bb42014-04-07 14:55:24 -0400189
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900190 if (!parse_callchain_mode(tok) ||
191 !parse_callchain_order(tok) ||
Namhyung Kimf2af0082015-11-09 14:45:41 +0900192 !parse_callchain_sort_key(tok) ||
193 !parse_callchain_value(tok)) {
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900194 /* parsing ok - move on to the next */
Namhyung Kima2c10d32015-10-22 15:28:49 +0900195 try_stack_size = false;
196 goto next;
197 } else if (allow_record_opt && !record_opt_set) {
198 if (parse_callchain_record(tok, &callchain_param))
199 goto try_numbers;
200
201 /* assume that number followed by 'dwarf' is stack size */
202 if (callchain_param.record_mode == CALLCHAIN_DWARF)
203 try_stack_size = true;
204
205 record_opt_set = true;
206 goto next;
207 }
208
209try_numbers:
210 if (try_stack_size) {
211 unsigned long size = 0;
212
213 if (get_stack_size(tok, &size) < 0)
214 return -1;
215 callchain_param.dump_size = size;
216 try_stack_size = false;
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900217 } else if (!minpcnt_set) {
218 /* try to get the min percent */
Namhyung Kime8232f12014-08-14 15:01:38 +0900219 callchain_param.min_percent = strtod(tok, &endptr);
220 if (tok == endptr)
221 return -1;
222 minpcnt_set = true;
223 } else {
224 /* try print limit at last */
225 callchain_param.print_limit = strtoul(tok, &endptr, 0);
226 if (tok == endptr)
227 return -1;
228 }
Namhyung Kima2c10d32015-10-22 15:28:49 +0900229next:
Namhyung Kime8232f12014-08-14 15:01:38 +0900230 arg = NULL;
Don Zickuscff6bb42014-04-07 14:55:24 -0400231 }
232
Don Zickuscff6bb42014-04-07 14:55:24 -0400233 if (callchain_register_param(&callchain_param) < 0) {
234 pr_err("Can't register callchain params\n");
235 return -1;
236 }
237 return 0;
238}
239
Namhyung Kima2c10d32015-10-22 15:28:49 +0900240int parse_callchain_report_opt(const char *arg)
241{
242 return __parse_callchain_report_opt(arg, false);
243}
244
245int parse_callchain_top_opt(const char *arg)
246{
247 return __parse_callchain_report_opt(arg, true);
248}
249
Arnaldo Carvalho de Melo56e2e052017-04-19 18:38:33 -0300250int parse_callchain_record(const char *arg, struct callchain_param *param)
251{
252 char *tok, *name, *saveptr = NULL;
253 char *buf;
254 int ret = -1;
255
256 /* We need buffer that we know we can write to. */
257 buf = malloc(strlen(arg) + 1);
258 if (!buf)
259 return -ENOMEM;
260
261 strcpy(buf, arg);
262
263 tok = strtok_r((char *)buf, ",", &saveptr);
264 name = tok ? : (char *)buf;
265
266 do {
267 /* Framepointer style */
268 if (!strncmp(name, "fp", sizeof("fp"))) {
269 if (!strtok_r(NULL, ",", &saveptr)) {
270 param->record_mode = CALLCHAIN_FP;
271 ret = 0;
272 } else
273 pr_err("callchain: No more arguments "
274 "needed for --call-graph fp\n");
275 break;
276
277 /* Dwarf style */
278 } else if (!strncmp(name, "dwarf", sizeof("dwarf"))) {
279 const unsigned long default_stack_dump_size = 8192;
280
281 ret = 0;
282 param->record_mode = CALLCHAIN_DWARF;
283 param->dump_size = default_stack_dump_size;
Arnaldo Carvalho de Meloeabad8c2018-01-15 16:48:46 -0300284 dwarf_callchain_users = true;
Arnaldo Carvalho de Melo56e2e052017-04-19 18:38:33 -0300285
286 tok = strtok_r(NULL, ",", &saveptr);
287 if (tok) {
288 unsigned long size = 0;
289
290 ret = get_stack_size(tok, &size);
291 param->dump_size = size;
292 }
293 } else if (!strncmp(name, "lbr", sizeof("lbr"))) {
294 if (!strtok_r(NULL, ",", &saveptr)) {
295 param->record_mode = CALLCHAIN_LBR;
296 ret = 0;
297 } else
298 pr_err("callchain: No more arguments "
299 "needed for --call-graph lbr\n");
300 break;
301 } else {
302 pr_err("callchain: Unknown --call-graph option "
303 "value: %s\n", arg);
304 break;
305 }
306
307 } while (0);
308
309 free(buf);
310 return ret;
311}
312
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900313int perf_callchain_config(const char *var, const char *value)
314{
315 char *endptr;
316
Arnaldo Carvalho de Melo8e99b6d2017-07-20 15:27:39 -0300317 if (!strstarts(var, "call-graph."))
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900318 return 0;
319 var += sizeof("call-graph.") - 1;
320
321 if (!strcmp(var, "record-mode"))
Kan Liangc3a6a8c2015-08-04 04:30:20 -0400322 return parse_callchain_record_opt(value, &callchain_param);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900323 if (!strcmp(var, "dump-size")) {
324 unsigned long size = 0;
325 int ret;
326
327 ret = get_stack_size(value, &size);
328 callchain_param.dump_size = size;
329
330 return ret;
331 }
Mengting Zhang9789e7e2017-09-23 16:18:14 +0800332 if (!strcmp(var, "print-type")){
333 int ret;
334 ret = parse_callchain_mode(value);
335 if (ret == -1)
336 pr_err("Invalid callchain mode: %s\n", value);
337 return ret;
338 }
339 if (!strcmp(var, "order")){
340 int ret;
341 ret = parse_callchain_order(value);
342 if (ret == -1)
343 pr_err("Invalid callchain order: %s\n", value);
344 return ret;
345 }
346 if (!strcmp(var, "sort-key")){
347 int ret;
348 ret = parse_callchain_sort_key(value);
349 if (ret == -1)
350 pr_err("Invalid callchain sort key: %s\n", value);
351 return ret;
352 }
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900353 if (!strcmp(var, "threshold")) {
354 callchain_param.min_percent = strtod(value, &endptr);
Arnaldo Carvalho de Meloecc4c562017-01-24 13:44:10 -0300355 if (value == endptr) {
356 pr_err("Invalid callchain threshold: %s\n", value);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900357 return -1;
Arnaldo Carvalho de Meloecc4c562017-01-24 13:44:10 -0300358 }
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900359 }
360 if (!strcmp(var, "print-limit")) {
361 callchain_param.print_limit = strtod(value, &endptr);
Arnaldo Carvalho de Meloecc4c562017-01-24 13:44:10 -0300362 if (value == endptr) {
363 pr_err("Invalid callchain print limit: %s\n", value);
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900364 return -1;
Arnaldo Carvalho de Meloecc4c562017-01-24 13:44:10 -0300365 }
Namhyung Kim2b9240c2014-09-23 10:01:43 +0900366 }
367
368 return 0;
369}
370
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200371static void
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200372rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
373 enum chain_mode mode)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200374{
375 struct rb_node **p = &root->rb_node;
376 struct rb_node *parent = NULL;
377 struct callchain_node *rnode;
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100378 u64 chain_cumul = callchain_cumul_hits(chain);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200379
380 while (*p) {
Frederic Weisbecker19532872009-08-07 07:11:05 +0200381 u64 rnode_cumul;
382
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200383 parent = *p;
384 rnode = rb_entry(parent, struct callchain_node, rb_node);
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100385 rnode_cumul = callchain_cumul_hits(rnode);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200386
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200387 switch (mode) {
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200388 case CHAIN_FLAT:
Namhyung Kim26e77922015-11-09 14:45:37 +0900389 case CHAIN_FOLDED:
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200390 if (rnode->hit < chain->hit)
391 p = &(*p)->rb_left;
392 else
393 p = &(*p)->rb_right;
394 break;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200395 case CHAIN_GRAPH_ABS: /* Falldown */
396 case CHAIN_GRAPH_REL:
Frederic Weisbecker19532872009-08-07 07:11:05 +0200397 if (rnode_cumul < chain_cumul)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200398 p = &(*p)->rb_left;
399 else
400 p = &(*p)->rb_right;
401 break;
Ingo Molnar83a09442009-08-15 12:26:57 +0200402 case CHAIN_NONE:
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200403 default:
404 break;
405 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200406 }
407
408 rb_link_node(&chain->rb_node, parent, p);
409 rb_insert_color(&chain->rb_node, root);
410}
411
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200412static void
413__sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
414 u64 min_hit)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200415{
Namhyung Kime3695172013-10-11 14:15:36 +0900416 struct rb_node *n;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200417 struct callchain_node *child;
418
Namhyung Kime3695172013-10-11 14:15:36 +0900419 n = rb_first(&node->rb_root_in);
420 while (n) {
421 child = rb_entry(n, struct callchain_node, rb_node_in);
422 n = rb_next(n);
423
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200424 __sort_chain_flat(rb_root, child, min_hit);
Namhyung Kime3695172013-10-11 14:15:36 +0900425 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200426
Frederic Weisbeckerc20ab372009-07-02 20:14:33 +0200427 if (node->hit && node->hit >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200428 rb_insert_callchain(rb_root, node, CHAIN_FLAT);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200429}
430
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200431/*
432 * Once we get every callchains from the stream, we can now
433 * sort them by hit
434 */
435static void
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200436sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root,
Irina Tirdea1d037ca2012-09-11 01:15:03 +0300437 u64 min_hit, struct callchain_param *param __maybe_unused)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200438{
Namhyung Kim03562182015-11-26 16:08:18 +0900439 *rb_root = RB_ROOT;
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200440 __sort_chain_flat(rb_root, &root->node, min_hit);
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200441}
442
443static void __sort_chain_graph_abs(struct callchain_node *node,
444 u64 min_hit)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200445{
Namhyung Kime3695172013-10-11 14:15:36 +0900446 struct rb_node *n;
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200447 struct callchain_node *child;
448
449 node->rb_root = RB_ROOT;
Namhyung Kime3695172013-10-11 14:15:36 +0900450 n = rb_first(&node->rb_root_in);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200451
Namhyung Kime3695172013-10-11 14:15:36 +0900452 while (n) {
453 child = rb_entry(n, struct callchain_node, rb_node_in);
454 n = rb_next(n);
455
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200456 __sort_chain_graph_abs(child, min_hit);
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100457 if (callchain_cumul_hits(child) >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200458 rb_insert_callchain(&node->rb_root, child,
459 CHAIN_GRAPH_ABS);
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200460 }
461}
462
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200463static void
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200464sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root,
Irina Tirdea1d037ca2012-09-11 01:15:03 +0300465 u64 min_hit, struct callchain_param *param __maybe_unused)
Frederic Weisbecker4eb3e472009-07-02 17:58:21 +0200466{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200467 __sort_chain_graph_abs(&chain_root->node, min_hit);
468 rb_root->rb_node = chain_root->node.rb_root.rb_node;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200469}
470
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200471static void __sort_chain_graph_rel(struct callchain_node *node,
472 double min_percent)
473{
Namhyung Kime3695172013-10-11 14:15:36 +0900474 struct rb_node *n;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200475 struct callchain_node *child;
476 u64 min_hit;
477
478 node->rb_root = RB_ROOT;
Frederic Weisbeckerc0a88652009-08-09 04:19:15 +0200479 min_hit = ceil(node->children_hit * min_percent);
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200480
Namhyung Kime3695172013-10-11 14:15:36 +0900481 n = rb_first(&node->rb_root_in);
482 while (n) {
483 child = rb_entry(n, struct callchain_node, rb_node_in);
484 n = rb_next(n);
485
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200486 __sort_chain_graph_rel(child, min_percent);
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100487 if (callchain_cumul_hits(child) >= min_hit)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200488 rb_insert_callchain(&node->rb_root, child,
489 CHAIN_GRAPH_REL);
490 }
491}
492
493static void
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200494sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root,
Irina Tirdea1d037ca2012-09-11 01:15:03 +0300495 u64 min_hit __maybe_unused, struct callchain_param *param)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200496{
Frederic Weisbeckerd2009c52010-08-22 20:05:22 +0200497 __sort_chain_graph_rel(&chain_root->node, param->min_percent / 100.0);
498 rb_root->rb_node = chain_root->node.rb_root.rb_node;
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200499}
500
Frederic Weisbecker16537f12011-01-14 04:52:00 +0100501int callchain_register_param(struct callchain_param *param)
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200502{
503 switch (param->mode) {
504 case CHAIN_GRAPH_ABS:
505 param->sort = sort_chain_graph_abs;
506 break;
507 case CHAIN_GRAPH_REL:
508 param->sort = sort_chain_graph_rel;
509 break;
510 case CHAIN_FLAT:
Namhyung Kim26e77922015-11-09 14:45:37 +0900511 case CHAIN_FOLDED:
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200512 param->sort = sort_chain_flat;
513 break;
Ingo Molnar83a09442009-08-15 12:26:57 +0200514 case CHAIN_NONE:
Frederic Weisbecker805d1272009-07-05 07:39:21 +0200515 default:
516 return -1;
517 }
518 return 0;
519}
520
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200521/*
522 * Create a child for a parent. If inherit_children, then the new child
523 * will become the new parent of it's parent children
524 */
525static struct callchain_node *
526create_child(struct callchain_node *parent, bool inherit_children)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200527{
528 struct callchain_node *new;
529
Arnaldo Carvalho de Melocdd5b75b2010-05-10 10:56:50 -0300530 new = zalloc(sizeof(*new));
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200531 if (!new) {
532 perror("not enough memory to create child for code path tree");
533 return NULL;
534 }
535 new->parent = parent;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200536 INIT_LIST_HEAD(&new->val);
Namhyung Kim4b3a3212015-11-09 14:45:43 +0900537 INIT_LIST_HEAD(&new->parent_val);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200538
539 if (inherit_children) {
Namhyung Kime3695172013-10-11 14:15:36 +0900540 struct rb_node *n;
541 struct callchain_node *child;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200542
Namhyung Kime3695172013-10-11 14:15:36 +0900543 new->rb_root_in = parent->rb_root_in;
544 parent->rb_root_in = RB_ROOT;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200545
Namhyung Kime3695172013-10-11 14:15:36 +0900546 n = rb_first(&new->rb_root_in);
547 while (n) {
548 child = rb_entry(n, struct callchain_node, rb_node_in);
549 child->parent = new;
550 n = rb_next(n);
551 }
552
553 /* make it the first child */
554 rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node);
555 rb_insert_color(&new->rb_node_in, &parent->rb_root_in);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200556 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200557
558 return new;
559}
560
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300561
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200562/*
563 * Fill the node with callchain values
564 */
Namhyung Kim8451cbb2016-02-16 23:08:21 +0900565static int
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100566fill_node(struct callchain_node *node, struct callchain_cursor *cursor)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200567{
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100568 struct callchain_cursor_node *cursor_node;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200569
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100570 node->val_nr = cursor->nr - cursor->pos;
571 if (!node->val_nr)
572 pr_warning("Warning: empty node in callchain tree\n");
573
574 cursor_node = callchain_cursor_current(cursor);
575
576 while (cursor_node) {
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200577 struct callchain_list *call;
578
Arnaldo Carvalho de Melocdd5b75b2010-05-10 10:56:50 -0300579 call = zalloc(sizeof(*call));
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200580 if (!call) {
581 perror("not enough memory for the code path tree");
Namhyung Kim8451cbb2016-02-16 23:08:21 +0900582 return -1;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200583 }
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100584 call->ip = cursor_node->ip;
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300585 call->ms = cursor_node->ms;
586 map__get(call->ms.map);
Milian Wolff40a342c2017-10-09 22:32:56 +0200587 call->srcline = cursor_node->srcline;
Jin Yao3dd029e2016-10-31 09:19:51 +0800588
589 if (cursor_node->branch) {
590 call->branch_count = 1;
591
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800592 if (cursor_node->branch_from) {
593 /*
594 * branch_from is set with value somewhere else
595 * to imply it's "to" of a branch.
596 */
597 call->brtype_stat.branch_to = true;
Jin Yao3dd029e2016-10-31 09:19:51 +0800598
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800599 if (cursor_node->branch_flags.predicted)
600 call->predicted_count = 1;
Jin Yao3dd029e2016-10-31 09:19:51 +0800601
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800602 if (cursor_node->branch_flags.abort)
603 call->abort_count = 1;
Jin Yaob851dd42017-07-18 20:13:15 +0800604
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800605 branch_type_count(&call->brtype_stat,
606 &cursor_node->branch_flags,
607 cursor_node->branch_from,
608 cursor_node->ip);
609 } else {
610 /*
611 * It's "from" of a branch
612 */
613 call->brtype_stat.branch_to = false;
614 call->cycles_count =
615 cursor_node->branch_flags.cycles;
616 call->iter_count = cursor_node->nr_loop_iter;
Jin Yaoc4ee0622017-08-07 21:05:15 +0800617 call->iter_cycles = cursor_node->iter_cycles;
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800618 }
Jin Yao3dd029e2016-10-31 09:19:51 +0800619 }
620
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200621 list_add_tail(&call->list, &node->val);
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100622
623 callchain_cursor_advance(cursor);
624 cursor_node = callchain_cursor_current(cursor);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200625 }
Namhyung Kim8451cbb2016-02-16 23:08:21 +0900626 return 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200627}
628
Namhyung Kime3695172013-10-11 14:15:36 +0900629static struct callchain_node *
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100630add_child(struct callchain_node *parent,
631 struct callchain_cursor *cursor,
632 u64 period)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200633{
634 struct callchain_node *new;
635
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200636 new = create_child(parent, false);
Namhyung Kim7565bd392016-02-16 23:08:20 +0900637 if (new == NULL)
638 return NULL;
639
Namhyung Kim8451cbb2016-02-16 23:08:21 +0900640 if (fill_node(new, cursor) < 0) {
641 struct callchain_list *call, *tmp;
642
643 list_for_each_entry_safe(call, tmp, &new->val, list) {
Arnaldo Carvalho de Meloe56fbc92019-07-04 12:13:46 -0300644 list_del_init(&call->list);
Krister Johansen9c68ae92017-01-05 22:23:31 -0800645 map__zput(call->ms.map);
Namhyung Kim8451cbb2016-02-16 23:08:21 +0900646 free(call);
647 }
648 free(new);
649 return NULL;
650 }
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200651
Frederic Weisbecker19532872009-08-07 07:11:05 +0200652 new->children_hit = 0;
Frederic Weisbecker108553e2010-07-08 03:41:46 +0200653 new->hit = period;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900654 new->children_count = 0;
655 new->count = 1;
Namhyung Kime3695172013-10-11 14:15:36 +0900656 return new;
657}
658
Namhyung Kim2d713b82016-02-16 23:08:22 +0900659enum match_result {
660 MATCH_ERROR = -1,
661 MATCH_EQ,
662 MATCH_LT,
663 MATCH_GT,
664};
665
Milian Wolffcbe50f62017-10-09 22:33:00 +0200666static enum match_result match_chain_strings(const char *left,
667 const char *right)
Milian Wolff5dfa2102017-03-18 22:49:28 +0100668{
Milian Wolff5dfa2102017-03-18 22:49:28 +0100669 enum match_result ret = MATCH_EQ;
670 int cmp;
671
672 if (left && right)
673 cmp = strcmp(left, right);
674 else if (!left && right)
675 cmp = 1;
676 else if (left && !right)
677 cmp = -1;
Milian Wolff5dfa2102017-03-18 22:49:28 +0100678 else
Milian Wolffcbe50f62017-10-09 22:33:00 +0200679 return MATCH_ERROR;
Milian Wolff5dfa2102017-03-18 22:49:28 +0100680
681 if (cmp != 0)
682 ret = cmp < 0 ? MATCH_LT : MATCH_GT;
683
Milian Wolff5dfa2102017-03-18 22:49:28 +0100684 return ret;
685}
686
Milian Wolffbf36eb52017-10-20 12:14:47 -0300687/*
688 * We need to always use relative addresses because we're aggregating
689 * callchains from multiple threads, i.e. different address spaces, so
690 * comparing absolute addresses make no sense as a symbol in a DSO may end up
691 * in a different address when used in a different binary or even the same
692 * binary but with some sort of address randomization technique, thus we need
693 * to compare just relative addresses. -acme
694 */
695static enum match_result match_chain_dso_addresses(struct map *left_map, u64 left_ip,
696 struct map *right_map, u64 right_ip)
697{
698 struct dso *left_dso = left_map ? left_map->dso : NULL;
699 struct dso *right_dso = right_map ? right_map->dso : NULL;
700
701 if (left_dso != right_dso)
702 return left_dso < right_dso ? MATCH_LT : MATCH_GT;
703
704 if (left_ip != right_ip)
705 return left_ip < right_ip ? MATCH_LT : MATCH_GT;
706
707 return MATCH_EQ;
708}
709
Namhyung Kim2d713b82016-02-16 23:08:22 +0900710static enum match_result match_chain(struct callchain_cursor_node *node,
711 struct callchain_list *cnode)
Namhyung Kime3695172013-10-11 14:15:36 +0900712{
Milian Wolffbf36eb52017-10-20 12:14:47 -0300713 enum match_result match = MATCH_ERROR;
Namhyung Kime3695172013-10-11 14:15:36 +0900714
Milian Wolffbf36eb52017-10-20 12:14:47 -0300715 switch (callchain_param.key) {
716 case CCKEY_SRCLINE:
717 match = match_chain_strings(cnode->srcline, node->srcline);
Milian Wolff5dfa2102017-03-18 22:49:28 +0100718 if (match != MATCH_ERROR)
Milian Wolffbf36eb52017-10-20 12:14:47 -0300719 break;
720 /* otherwise fall-back to symbol-based comparison below */
721 __fallthrough;
722 case CCKEY_FUNCTION:
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300723 if (node->ms.sym && cnode->ms.sym) {
Milian Wolffbf36eb52017-10-20 12:14:47 -0300724 /*
725 * Compare inlined frames based on their symbol name
726 * because different inlined frames will have the same
727 * symbol start. Otherwise do a faster comparison based
728 * on the symbol start address.
729 */
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300730 if (cnode->ms.sym->inlined || node->ms.sym->inlined) {
Milian Wolffbf36eb52017-10-20 12:14:47 -0300731 match = match_chain_strings(cnode->ms.sym->name,
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300732 node->ms.sym->name);
Milian Wolffbf36eb52017-10-20 12:14:47 -0300733 if (match != MATCH_ERROR)
734 break;
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800735 } else {
Milian Wolffbf36eb52017-10-20 12:14:47 -0300736 match = match_chain_dso_addresses(cnode->ms.map, cnode->ms.sym->start,
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300737 node->ms.map, node->ms.sym->start);
Milian Wolffbf36eb52017-10-20 12:14:47 -0300738 break;
Jin Yaoa1a8bed2017-07-24 19:09:07 +0800739 }
Jin Yao3dd029e2016-10-31 09:19:51 +0800740 }
Milian Wolffbf36eb52017-10-20 12:14:47 -0300741 /* otherwise fall-back to IP-based comparison below */
742 __fallthrough;
743 case CCKEY_ADDRESS:
744 default:
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -0300745 match = match_chain_dso_addresses(cnode->ms.map, cnode->ip, node->ms.map, node->ip);
Milian Wolffbf36eb52017-10-20 12:14:47 -0300746 break;
Jin Yao3dd029e2016-10-31 09:19:51 +0800747 }
Namhyung Kim2d713b82016-02-16 23:08:22 +0900748
Milian Wolffbf36eb52017-10-20 12:14:47 -0300749 if (match == MATCH_EQ && node->branch) {
750 cnode->branch_count++;
751
752 if (node->branch_from) {
753 /*
754 * It's "to" of a branch
755 */
756 cnode->brtype_stat.branch_to = true;
757
758 if (node->branch_flags.predicted)
759 cnode->predicted_count++;
760
761 if (node->branch_flags.abort)
762 cnode->abort_count++;
763
764 branch_type_count(&cnode->brtype_stat,
765 &node->branch_flags,
766 node->branch_from,
767 node->ip);
768 } else {
769 /*
770 * It's "from" of a branch
771 */
772 cnode->brtype_stat.branch_to = false;
773 cnode->cycles_count += node->branch_flags.cycles;
774 cnode->iter_count += node->nr_loop_iter;
775 cnode->iter_cycles += node->iter_cycles;
Jin Yaoa3366db02019-01-04 14:10:30 +0800776 cnode->from_count++;
Milian Wolffbf36eb52017-10-20 12:14:47 -0300777 }
778 }
779
780 return match;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200781}
782
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200783/*
784 * Split the parent in two parts (a new child is created) and
785 * give a part of its callchain to the created child.
786 * Then create another child to host the given callchain of new branch
787 */
Namhyung Kimf2bb4c52016-02-16 23:08:23 +0900788static int
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100789split_add_child(struct callchain_node *parent,
790 struct callchain_cursor *cursor,
791 struct callchain_list *to_split,
792 u64 idx_parents, u64 idx_local, u64 period)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200793{
794 struct callchain_node *new;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200795 struct list_head *old_tail;
Ingo Molnarf37a2912009-07-01 12:37:06 +0200796 unsigned int idx_total = idx_parents + idx_local;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200797
798 /* split */
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200799 new = create_child(parent, true);
Namhyung Kimf2bb4c52016-02-16 23:08:23 +0900800 if (new == NULL)
801 return -1;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200802
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200803 /* split the callchain and move a part to the new child */
804 old_tail = parent->val.prev;
805 list_del_range(&to_split->list, old_tail);
806 new->val.next = &to_split->list;
807 new->val.prev = old_tail;
808 to_split->list.prev = &new->val;
809 old_tail->next = &new->val;
810
811 /* split the hits */
812 new->hit = parent->hit;
Frederic Weisbecker19532872009-08-07 07:11:05 +0200813 new->children_hit = parent->children_hit;
Frederic Weisbeckerf08c3152011-01-14 04:51:59 +0100814 parent->children_hit = callchain_cumul_hits(new);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200815 new->val_nr = parent->val_nr - idx_local;
816 parent->val_nr = idx_local;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900817 new->count = parent->count;
818 new->children_count = parent->children_count;
819 parent->children_count = callchain_cumul_counts(new);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200820
821 /* create a new child for the new branch if any */
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100822 if (idx_total < cursor->nr) {
Namhyung Kime3695172013-10-11 14:15:36 +0900823 struct callchain_node *first;
824 struct callchain_list *cnode;
825 struct callchain_cursor_node *node;
826 struct rb_node *p, **pp;
827
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200828 parent->hit = 0;
Frederic Weisbecker108553e2010-07-08 03:41:46 +0200829 parent->children_hit += period;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900830 parent->count = 0;
831 parent->children_count += 1;
Namhyung Kime3695172013-10-11 14:15:36 +0900832
833 node = callchain_cursor_current(cursor);
834 new = add_child(parent, cursor, period);
Namhyung Kim7565bd392016-02-16 23:08:20 +0900835 if (new == NULL)
Namhyung Kimf2bb4c52016-02-16 23:08:23 +0900836 return -1;
Namhyung Kime3695172013-10-11 14:15:36 +0900837
838 /*
839 * This is second child since we moved parent's children
840 * to new (first) child above.
841 */
842 p = parent->rb_root_in.rb_node;
843 first = rb_entry(p, struct callchain_node, rb_node_in);
844 cnode = list_first_entry(&first->val, struct callchain_list,
845 list);
846
Namhyung Kim2d713b82016-02-16 23:08:22 +0900847 if (match_chain(node, cnode) == MATCH_LT)
Namhyung Kime3695172013-10-11 14:15:36 +0900848 pp = &p->rb_left;
849 else
850 pp = &p->rb_right;
851
852 rb_link_node(&new->rb_node_in, p, pp);
853 rb_insert_color(&new->rb_node_in, &parent->rb_root_in);
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200854 } else {
Frederic Weisbecker108553e2010-07-08 03:41:46 +0200855 parent->hit = period;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900856 parent->count = 1;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200857 }
Namhyung Kimf2bb4c52016-02-16 23:08:23 +0900858 return 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200859}
860
Namhyung Kim2d713b82016-02-16 23:08:22 +0900861static enum match_result
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100862append_chain(struct callchain_node *root,
863 struct callchain_cursor *cursor,
864 u64 period);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200865
Namhyung Kimdca0d122016-02-16 23:08:24 +0900866static int
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100867append_chain_children(struct callchain_node *root,
868 struct callchain_cursor *cursor,
869 u64 period)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200870{
871 struct callchain_node *rnode;
Namhyung Kime3695172013-10-11 14:15:36 +0900872 struct callchain_cursor_node *node;
873 struct rb_node **p = &root->rb_root_in.rb_node;
874 struct rb_node *parent = NULL;
875
876 node = callchain_cursor_current(cursor);
877 if (!node)
Namhyung Kimdca0d122016-02-16 23:08:24 +0900878 return -1;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200879
Ingo Molnar4d39c892021-03-23 17:09:15 +0100880 /* lookup in children */
Namhyung Kime3695172013-10-11 14:15:36 +0900881 while (*p) {
Namhyung Kim2d713b82016-02-16 23:08:22 +0900882 enum match_result ret;
Ingo Molnarf37a2912009-07-01 12:37:06 +0200883
Namhyung Kime3695172013-10-11 14:15:36 +0900884 parent = *p;
885 rnode = rb_entry(parent, struct callchain_node, rb_node_in);
Namhyung Kime3695172013-10-11 14:15:36 +0900886
Frederic Weisbeckerb965bb42014-01-14 16:37:15 +0100887 /* If at least first entry matches, rely to children */
888 ret = append_chain(rnode, cursor, period);
Namhyung Kim2d713b82016-02-16 23:08:22 +0900889 if (ret == MATCH_EQ)
Frederic Weisbecker19532872009-08-07 07:11:05 +0200890 goto inc_children_hit;
Namhyung Kimdca0d122016-02-16 23:08:24 +0900891 if (ret == MATCH_ERROR)
892 return -1;
Namhyung Kime3695172013-10-11 14:15:36 +0900893
Namhyung Kim2d713b82016-02-16 23:08:22 +0900894 if (ret == MATCH_LT)
Namhyung Kime3695172013-10-11 14:15:36 +0900895 p = &parent->rb_left;
896 else
897 p = &parent->rb_right;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200898 }
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200899 /* nothing in children, add to the current node */
Namhyung Kime3695172013-10-11 14:15:36 +0900900 rnode = add_child(root, cursor, period);
Namhyung Kim7565bd392016-02-16 23:08:20 +0900901 if (rnode == NULL)
Namhyung Kimdca0d122016-02-16 23:08:24 +0900902 return -1;
Namhyung Kim7565bd392016-02-16 23:08:20 +0900903
Namhyung Kime3695172013-10-11 14:15:36 +0900904 rb_link_node(&rnode->rb_node_in, parent, p);
905 rb_insert_color(&rnode->rb_node_in, &root->rb_root_in);
Frederic Weisbeckere05b8762009-07-05 07:39:20 +0200906
Frederic Weisbecker19532872009-08-07 07:11:05 +0200907inc_children_hit:
Frederic Weisbecker108553e2010-07-08 03:41:46 +0200908 root->children_hit += period;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900909 root->children_count++;
Namhyung Kimdca0d122016-02-16 23:08:24 +0900910 return 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200911}
912
Namhyung Kim2d713b82016-02-16 23:08:22 +0900913static enum match_result
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100914append_chain(struct callchain_node *root,
915 struct callchain_cursor *cursor,
916 u64 period)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200917{
918 struct callchain_list *cnode;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100919 u64 start = cursor->pos;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200920 bool found = false;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100921 u64 matches;
Namhyung Kim2d713b82016-02-16 23:08:22 +0900922 enum match_result cmp = MATCH_ERROR;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200923
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200924 /*
925 * Lookup in the current node
926 * If we have a symbol, then compare the start to match
Andi Kleen99571ab2013-07-18 15:33:57 -0700927 * anywhere inside a function, unless function
928 * mode is disabled.
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200929 */
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200930 list_for_each_entry(cnode, &root->val, list) {
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100931 struct callchain_cursor_node *node;
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300932
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100933 node = callchain_cursor_current(cursor);
934 if (!node)
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200935 break;
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300936
Frederic Weisbeckerb965bb42014-01-14 16:37:15 +0100937 cmp = match_chain(node, cnode);
Namhyung Kim2d713b82016-02-16 23:08:22 +0900938 if (cmp != MATCH_EQ)
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200939 break;
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300940
Namhyung Kime3695172013-10-11 14:15:36 +0900941 found = true;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100942
943 callchain_cursor_advance(cursor);
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200944 }
945
Namhyung Kime3695172013-10-11 14:15:36 +0900946 /* matches not, relay no the parent */
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100947 if (!found) {
Namhyung Kim2d713b82016-02-16 23:08:22 +0900948 WARN_ONCE(cmp == MATCH_ERROR, "Chain comparison error\n");
Frederic Weisbeckerb965bb42014-01-14 16:37:15 +0100949 return cmp;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100950 }
951
952 matches = cursor->pos - start;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200953
954 /* we match only a part of the node. Split it and add the new chain */
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100955 if (matches < root->val_nr) {
Namhyung Kimf2bb4c52016-02-16 23:08:23 +0900956 if (split_add_child(root, cursor, cnode, start, matches,
957 period) < 0)
958 return MATCH_ERROR;
959
Namhyung Kim2d713b82016-02-16 23:08:22 +0900960 return MATCH_EQ;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200961 }
962
963 /* we match 100% of the path, increment the hit */
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100964 if (matches == root->val_nr && cursor->pos == cursor->nr) {
Frederic Weisbecker108553e2010-07-08 03:41:46 +0200965 root->hit += period;
Namhyung Kim5e47f8f2015-11-09 14:45:40 +0900966 root->count++;
Namhyung Kim2d713b82016-02-16 23:08:22 +0900967 return MATCH_EQ;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200968 }
969
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200970 /* We match the node and still have a part remaining */
Namhyung Kimdca0d122016-02-16 23:08:24 +0900971 if (append_chain_children(root, cursor, period) < 0)
972 return MATCH_ERROR;
Frederic Weisbeckerdeac9112009-07-01 05:35:15 +0200973
Namhyung Kim2d713b82016-02-16 23:08:22 +0900974 return MATCH_EQ;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200975}
976
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100977int callchain_append(struct callchain_root *root,
978 struct callchain_cursor *cursor,
979 u64 period)
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300980{
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100981 if (!cursor->nr)
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300982 return 0;
983
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100984 callchain_cursor_commit(cursor);
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300985
Namhyung Kimdca0d122016-02-16 23:08:24 +0900986 if (append_chain_children(&root->node, cursor, period) < 0)
987 return -1;
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300988
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100989 if (cursor->nr > root->max_depth)
990 root->max_depth = cursor->nr;
Frederic Weisbecker301fde22010-03-22 13:09:33 -0300991
992 return 0;
Frederic Weisbecker8cb76d92009-06-26 16:28:00 +0200993}
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +0200994
995static int
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100996merge_chain_branch(struct callchain_cursor *cursor,
997 struct callchain_node *dst, struct callchain_node *src)
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +0200998{
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +0100999 struct callchain_cursor_node **old_last = cursor->last;
Namhyung Kime3695172013-10-11 14:15:36 +09001000 struct callchain_node *child;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001001 struct callchain_list *list, *next_list;
Namhyung Kime3695172013-10-11 14:15:36 +09001002 struct rb_node *n;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001003 int old_pos = cursor->nr;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001004 int err = 0;
1005
1006 list_for_each_entry_safe(list, next_list, &src->val, list) {
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001007 callchain_cursor_append(cursor, list->ip, &list->ms,
Milian Wolff40a342c2017-10-09 22:32:56 +02001008 false, NULL, 0, 0, 0, list->srcline);
Arnaldo Carvalho de Meloe56fbc92019-07-04 12:13:46 -03001009 list_del_init(&list->list);
Krister Johansen9c68ae92017-01-05 22:23:31 -08001010 map__zput(list->ms.map);
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001011 free(list);
1012 }
1013
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001014 if (src->hit) {
1015 callchain_cursor_commit(cursor);
Namhyung Kimdca0d122016-02-16 23:08:24 +09001016 if (append_chain_children(dst, cursor, src->hit) < 0)
1017 return -1;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001018 }
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001019
Namhyung Kime3695172013-10-11 14:15:36 +09001020 n = rb_first(&src->rb_root_in);
1021 while (n) {
1022 child = container_of(n, struct callchain_node, rb_node_in);
1023 n = rb_next(n);
1024 rb_erase(&child->rb_node_in, &src->rb_root_in);
1025
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001026 err = merge_chain_branch(cursor, dst, child);
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001027 if (err)
1028 break;
1029
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001030 free(child);
1031 }
1032
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001033 cursor->nr = old_pos;
1034 cursor->last = old_last;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001035
1036 return err;
1037}
1038
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001039int callchain_merge(struct callchain_cursor *cursor,
1040 struct callchain_root *dst, struct callchain_root *src)
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001041{
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001042 return merge_chain_branch(cursor, &dst->node, &src->node);
1043}
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001044
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001045int callchain_cursor_append(struct callchain_cursor *cursor,
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001046 u64 ip, struct map_symbol *ms,
Jin Yao410024d2016-10-31 09:19:49 +08001047 bool branch, struct branch_flags *flags,
Milian Wolff40a342c2017-10-09 22:32:56 +02001048 int nr_loop_iter, u64 iter_cycles, u64 branch_from,
1049 const char *srcline)
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001050{
1051 struct callchain_cursor_node *node = *cursor->last;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001052
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001053 if (!node) {
Paul Gortmaker91b98802013-01-30 20:05:49 -05001054 node = calloc(1, sizeof(*node));
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001055 if (!node)
1056 return -ENOMEM;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001057
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001058 *cursor->last = node;
1059 }
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001060
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001061 node->ip = ip;
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001062 map__zput(node->ms.map);
1063 node->ms = *ms;
1064 map__get(node->ms.map);
Jin Yao410024d2016-10-31 09:19:49 +08001065 node->branch = branch;
1066 node->nr_loop_iter = nr_loop_iter;
Jin Yaoc4ee0622017-08-07 21:05:15 +08001067 node->iter_cycles = iter_cycles;
Milian Wolff40a342c2017-10-09 22:32:56 +02001068 node->srcline = srcline;
Jin Yao410024d2016-10-31 09:19:49 +08001069
1070 if (flags)
1071 memcpy(&node->branch_flags, flags,
1072 sizeof(struct branch_flags));
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001073
Jin Yaob851dd42017-07-18 20:13:15 +08001074 node->branch_from = branch_from;
Frederic Weisbecker1b3a0e92011-01-14 04:51:58 +01001075 cursor->nr++;
1076
1077 cursor->last = &node->next;
1078
1079 return 0;
Frederic Weisbecker612d4fd2010-08-22 21:10:35 +02001080}
Namhyung Kim2dc9fb12014-01-14 14:25:35 +09001081
Arnaldo Carvalho de Melo91d7b2d2016-04-14 14:48:07 -03001082int sample__resolve_callchain(struct perf_sample *sample,
1083 struct callchain_cursor *cursor, struct symbol **parent,
Jiri Olsa32dcd022019-07-21 13:23:51 +02001084 struct evsel *evsel, struct addr_location *al,
Namhyung Kim2dc9fb12014-01-14 14:25:35 +09001085 int max_stack)
1086{
Jin Yaob49a8212017-05-08 18:43:02 +08001087 if (sample->callchain == NULL && !symbol_conf.show_branchflag_count)
Namhyung Kim2dc9fb12014-01-14 14:25:35 +09001088 return 0;
1089
Namhyung Kim7a13aa22012-09-11 14:13:04 +09001090 if (symbol_conf.use_callchain || symbol_conf.cumulate_callchain ||
Jin Yaob49a8212017-05-08 18:43:02 +08001091 perf_hpp_list.parent || symbol_conf.show_branchflag_count) {
Arnaldo Carvalho de Melo91d7b2d2016-04-14 14:48:07 -03001092 return thread__resolve_callchain(al->thread, cursor, evsel, sample,
Arnaldo Carvalho de Melocc8b7c22014-10-23 15:26:17 -03001093 parent, al, max_stack);
Namhyung Kim2dc9fb12014-01-14 14:25:35 +09001094 }
1095 return 0;
1096}
1097
1098int hist_entry__append_callchain(struct hist_entry *he, struct perf_sample *sample)
1099{
Jin Yaob49a8212017-05-08 18:43:02 +08001100 if ((!symbol_conf.use_callchain || sample->callchain == NULL) &&
1101 !symbol_conf.show_branchflag_count)
Namhyung Kim2dc9fb12014-01-14 14:25:35 +09001102 return 0;
1103 return callchain_append(he->callchain, &callchain_cursor, sample->period);
1104}
Namhyung Kimc7405d82013-10-31 13:58:30 +09001105
1106int fill_callchain_info(struct addr_location *al, struct callchain_cursor_node *node,
1107 bool hide_unresolved)
1108{
Arnaldo Carvalho de Melof2eaea02019-11-25 22:15:35 -03001109 al->maps = node->ms.maps;
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001110 al->map = node->ms.map;
1111 al->sym = node->ms.sym;
Milian Wolff1fb7d062017-10-19 13:38:35 +02001112 al->srcline = node->srcline;
Namhyung Kimd6332a12017-10-20 14:15:33 +09001113 al->addr = node->ip;
Namhyung Kimc7405d82013-10-31 13:58:30 +09001114
1115 if (al->sym == NULL) {
1116 if (hide_unresolved)
1117 return 0;
1118 if (al->map == NULL)
1119 goto out;
1120 }
1121
Arnaldo Carvalho de Melo694520d2019-11-25 22:11:20 -03001122 if (al->maps == &al->maps->machine->kmaps) {
1123 if (machine__is_host(al->maps->machine)) {
Namhyung Kimc7405d82013-10-31 13:58:30 +09001124 al->cpumode = PERF_RECORD_MISC_KERNEL;
1125 al->level = 'k';
1126 } else {
1127 al->cpumode = PERF_RECORD_MISC_GUEST_KERNEL;
1128 al->level = 'g';
1129 }
1130 } else {
Arnaldo Carvalho de Melo694520d2019-11-25 22:11:20 -03001131 if (machine__is_host(al->maps->machine)) {
Namhyung Kimc7405d82013-10-31 13:58:30 +09001132 al->cpumode = PERF_RECORD_MISC_USER;
1133 al->level = '.';
1134 } else if (perf_guest) {
1135 al->cpumode = PERF_RECORD_MISC_GUEST_USER;
1136 al->level = 'u';
1137 } else {
1138 al->cpumode = PERF_RECORD_MISC_HYPERVISOR;
1139 al->level = 'H';
1140 }
1141 }
1142
1143out:
1144 return 1;
1145}
Andi Kleen2989cca2014-11-12 18:05:23 -08001146
1147char *callchain_list__sym_name(struct callchain_list *cl,
1148 char *bf, size_t bfsize, bool show_dso)
1149{
Milian Wolff5dfa2102017-03-18 22:49:28 +01001150 bool show_addr = callchain_param.key == CCKEY_ADDRESS;
1151 bool show_srcline = show_addr || callchain_param.key == CCKEY_SRCLINE;
Andi Kleen2989cca2014-11-12 18:05:23 -08001152 int printed;
1153
1154 if (cl->ms.sym) {
Milian Wolff8932f802017-10-09 22:33:01 +02001155 const char *inlined = cl->ms.sym->inlined ? " (inlined)" : "";
1156
Milian Wolff40a342c2017-10-09 22:32:56 +02001157 if (show_srcline && cl->srcline)
Milian Wolff8932f802017-10-09 22:33:01 +02001158 printed = scnprintf(bf, bfsize, "%s %s%s",
1159 cl->ms.sym->name, cl->srcline,
1160 inlined);
Andi Kleen23f09812014-11-12 18:05:24 -08001161 else
Milian Wolff8932f802017-10-09 22:33:01 +02001162 printed = scnprintf(bf, bfsize, "%s%s",
1163 cl->ms.sym->name, inlined);
Andi Kleen2989cca2014-11-12 18:05:23 -08001164 } else
1165 printed = scnprintf(bf, bfsize, "%#" PRIx64, cl->ip);
1166
1167 if (show_dso)
1168 scnprintf(bf + printed, bfsize - printed, " %s",
1169 cl->ms.map ?
1170 cl->ms.map->dso->short_name :
1171 "unknown");
1172
1173 return bf;
1174}
Namhyung Kimd1149602014-12-30 14:38:13 +09001175
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001176char *callchain_node__scnprintf_value(struct callchain_node *node,
1177 char *bf, size_t bfsize, u64 total)
1178{
1179 double percent = 0.0;
1180 u64 period = callchain_cumul_hits(node);
Namhyung Kimf2af0082015-11-09 14:45:41 +09001181 unsigned count = callchain_cumul_counts(node);
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001182
Namhyung Kimf2af0082015-11-09 14:45:41 +09001183 if (callchain_param.mode == CHAIN_FOLDED) {
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001184 period = node->hit;
Namhyung Kimf2af0082015-11-09 14:45:41 +09001185 count = node->count;
1186 }
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001187
Namhyung Kimf2af0082015-11-09 14:45:41 +09001188 switch (callchain_param.value) {
1189 case CCVAL_PERIOD:
1190 scnprintf(bf, bfsize, "%"PRIu64, period);
1191 break;
1192 case CCVAL_COUNT:
1193 scnprintf(bf, bfsize, "%u", count);
1194 break;
1195 case CCVAL_PERCENT:
1196 default:
1197 if (total)
1198 percent = period * 100.0 / total;
1199 scnprintf(bf, bfsize, "%.2f%%", percent);
1200 break;
1201 }
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001202 return bf;
1203}
1204
1205int callchain_node__fprintf_value(struct callchain_node *node,
1206 FILE *fp, u64 total)
1207{
1208 double percent = 0.0;
1209 u64 period = callchain_cumul_hits(node);
Namhyung Kimf2af0082015-11-09 14:45:41 +09001210 unsigned count = callchain_cumul_counts(node);
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001211
Namhyung Kimf2af0082015-11-09 14:45:41 +09001212 if (callchain_param.mode == CHAIN_FOLDED) {
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001213 period = node->hit;
Namhyung Kimf2af0082015-11-09 14:45:41 +09001214 count = node->count;
1215 }
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001216
Namhyung Kimf2af0082015-11-09 14:45:41 +09001217 switch (callchain_param.value) {
1218 case CCVAL_PERIOD:
1219 return fprintf(fp, "%"PRIu64, period);
1220 case CCVAL_COUNT:
1221 return fprintf(fp, "%u", count);
1222 case CCVAL_PERCENT:
1223 default:
1224 if (total)
1225 percent = period * 100.0 / total;
1226 return percent_color_fprintf(fp, "%.2f%%", percent);
1227 }
1228 return 0;
Namhyung Kim5ab250c2015-11-09 14:45:39 +09001229}
1230
Jin Yao3dd029e2016-10-31 09:19:51 +08001231static void callchain_counts_value(struct callchain_node *node,
1232 u64 *branch_count, u64 *predicted_count,
1233 u64 *abort_count, u64 *cycles_count)
1234{
1235 struct callchain_list *clist;
1236
1237 list_for_each_entry(clist, &node->val, list) {
1238 if (branch_count)
1239 *branch_count += clist->branch_count;
1240
1241 if (predicted_count)
1242 *predicted_count += clist->predicted_count;
1243
1244 if (abort_count)
1245 *abort_count += clist->abort_count;
1246
1247 if (cycles_count)
1248 *cycles_count += clist->cycles_count;
1249 }
1250}
1251
1252static int callchain_node_branch_counts_cumul(struct callchain_node *node,
1253 u64 *branch_count,
1254 u64 *predicted_count,
1255 u64 *abort_count,
1256 u64 *cycles_count)
1257{
1258 struct callchain_node *child;
1259 struct rb_node *n;
1260
1261 n = rb_first(&node->rb_root_in);
1262 while (n) {
1263 child = rb_entry(n, struct callchain_node, rb_node_in);
1264 n = rb_next(n);
1265
1266 callchain_node_branch_counts_cumul(child, branch_count,
1267 predicted_count,
1268 abort_count,
1269 cycles_count);
1270
1271 callchain_counts_value(child, branch_count,
1272 predicted_count, abort_count,
1273 cycles_count);
1274 }
1275
1276 return 0;
1277}
1278
1279int callchain_branch_counts(struct callchain_root *root,
1280 u64 *branch_count, u64 *predicted_count,
1281 u64 *abort_count, u64 *cycles_count)
1282{
1283 if (branch_count)
1284 *branch_count = 0;
1285
1286 if (predicted_count)
1287 *predicted_count = 0;
1288
1289 if (abort_count)
1290 *abort_count = 0;
1291
1292 if (cycles_count)
1293 *cycles_count = 0;
1294
1295 return callchain_node_branch_counts_cumul(&root->node,
1296 branch_count,
1297 predicted_count,
1298 abort_count,
1299 cycles_count);
1300}
1301
Jin Yao8d517352017-07-18 20:13:12 +08001302static int count_pri64_printf(int idx, const char *str, u64 value, char *bf, int bfsize)
1303{
1304 int printed;
1305
1306 printed = scnprintf(bf, bfsize, "%s%s:%" PRId64 "", (idx) ? " " : " (", str, value);
1307
1308 return printed;
1309}
1310
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001311static int count_float_printf(int idx, const char *str, float value,
1312 char *bf, int bfsize, float threshold)
Jin Yao8d517352017-07-18 20:13:12 +08001313{
1314 int printed;
1315
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001316 if (threshold != 0.0 && value < threshold)
1317 return 0;
1318
Jin Yao8d517352017-07-18 20:13:12 +08001319 printed = scnprintf(bf, bfsize, "%s%s:%.1f%%", (idx) ? " " : " (", str, value);
1320
1321 return printed;
1322}
1323
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001324static int branch_to_str(char *bf, int bfsize,
1325 u64 branch_count, u64 predicted_count,
1326 u64 abort_count,
1327 struct branch_type_stat *brtype_stat)
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001328{
Jin Yaob851dd42017-07-18 20:13:15 +08001329 int printed, i = 0;
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001330
Jin Yaob851dd42017-07-18 20:13:15 +08001331 printed = branch_type_str(brtype_stat, bf, bfsize);
1332 if (printed)
1333 i++;
1334
Jin Yao8d517352017-07-18 20:13:12 +08001335 if (predicted_count < branch_count) {
1336 printed += count_float_printf(i++, "predicted",
1337 predicted_count * 100.0 / branch_count,
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001338 bf + printed, bfsize - printed, 0.0);
Jin Yao8d517352017-07-18 20:13:12 +08001339 }
1340
1341 if (abort_count) {
1342 printed += count_float_printf(i++, "abort",
1343 abort_count * 100.0 / branch_count,
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001344 bf + printed, bfsize - printed, 0.1);
Jin Yao8d517352017-07-18 20:13:12 +08001345 }
1346
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001347 if (i)
1348 printed += scnprintf(bf + printed, bfsize - printed, ")");
1349
1350 return printed;
1351}
1352
1353static int branch_from_str(char *bf, int bfsize,
1354 u64 branch_count,
1355 u64 cycles_count, u64 iter_count,
Jin Yaoa3366db02019-01-04 14:10:30 +08001356 u64 iter_cycles, u64 from_count)
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001357{
1358 int printed = 0, i = 0;
Jin Yaoa3366db02019-01-04 14:10:30 +08001359 u64 cycles, v = 0;
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001360
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001361 cycles = cycles_count / branch_count;
Jin Yao8d517352017-07-18 20:13:12 +08001362 if (cycles) {
1363 printed += count_pri64_printf(i++, "cycles",
1364 cycles,
1365 bf + printed, bfsize - printed);
1366 }
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001367
Jin Yaoa3366db02019-01-04 14:10:30 +08001368 if (iter_count && from_count) {
1369 v = iter_count / from_count;
1370 if (v) {
1371 printed += count_pri64_printf(i++, "iter",
1372 v, bf + printed, bfsize - printed);
Jin Yaoc4ee0622017-08-07 21:05:15 +08001373
Jin Yaoa3366db02019-01-04 14:10:30 +08001374 printed += count_pri64_printf(i++, "avg_cycles",
1375 iter_cycles / iter_count,
1376 bf + printed, bfsize - printed);
1377 }
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001378 }
1379
Jin Yao8d517352017-07-18 20:13:12 +08001380 if (i)
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001381 printed += scnprintf(bf + printed, bfsize - printed, ")");
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001382
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001383 return printed;
1384}
1385
1386static int counts_str_build(char *bf, int bfsize,
1387 u64 branch_count, u64 predicted_count,
1388 u64 abort_count, u64 cycles_count,
Jin Yaoc4ee0622017-08-07 21:05:15 +08001389 u64 iter_count, u64 iter_cycles,
Jin Yaoa3366db02019-01-04 14:10:30 +08001390 u64 from_count,
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001391 struct branch_type_stat *brtype_stat)
1392{
1393 int printed;
1394
1395 if (branch_count == 0)
1396 return scnprintf(bf, bfsize, " (calltrace)");
1397
1398 if (brtype_stat->branch_to) {
1399 printed = branch_to_str(bf, bfsize, branch_count,
1400 predicted_count, abort_count, brtype_stat);
1401 } else {
1402 printed = branch_from_str(bf, bfsize, branch_count,
Jin Yaoa3366db02019-01-04 14:10:30 +08001403 cycles_count, iter_count, iter_cycles,
1404 from_count);
Jin Yaoa1a8bed2017-07-24 19:09:07 +08001405 }
1406
1407 if (!printed)
1408 bf[0] = 0;
1409
1410 return printed;
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001411}
1412
Jin Yao3dd029e2016-10-31 09:19:51 +08001413static int callchain_counts_printf(FILE *fp, char *bf, int bfsize,
1414 u64 branch_count, u64 predicted_count,
1415 u64 abort_count, u64 cycles_count,
Jin Yaoc4ee0622017-08-07 21:05:15 +08001416 u64 iter_count, u64 iter_cycles,
Jin Yaoa3366db02019-01-04 14:10:30 +08001417 u64 from_count,
Jin Yaob851dd42017-07-18 20:13:15 +08001418 struct branch_type_stat *brtype_stat)
Jin Yao3dd029e2016-10-31 09:19:51 +08001419{
Jin Yaob851dd42017-07-18 20:13:15 +08001420 char str[256];
Jin Yao3dd029e2016-10-31 09:19:51 +08001421
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001422 counts_str_build(str, sizeof(str), branch_count,
1423 predicted_count, abort_count, cycles_count,
Jin Yaoa3366db02019-01-04 14:10:30 +08001424 iter_count, iter_cycles, from_count, brtype_stat);
Jin Yao3dd029e2016-10-31 09:19:51 +08001425
1426 if (fp)
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001427 return fprintf(fp, "%s", str);
Jin Yao3dd029e2016-10-31 09:19:51 +08001428
Jin Yaoc1dfcfa2017-03-09 16:06:26 +08001429 return scnprintf(bf, bfsize, "%s", str);
Jin Yao3dd029e2016-10-31 09:19:51 +08001430}
1431
Jin Yaoc4ee0622017-08-07 21:05:15 +08001432int callchain_list_counts__printf_value(struct callchain_list *clist,
Jin Yao3dd029e2016-10-31 09:19:51 +08001433 FILE *fp, char *bf, int bfsize)
1434{
1435 u64 branch_count, predicted_count;
1436 u64 abort_count, cycles_count;
Jin Yaoc4ee0622017-08-07 21:05:15 +08001437 u64 iter_count, iter_cycles;
Jin Yaoa3366db02019-01-04 14:10:30 +08001438 u64 from_count;
Jin Yao3dd029e2016-10-31 09:19:51 +08001439
1440 branch_count = clist->branch_count;
1441 predicted_count = clist->predicted_count;
1442 abort_count = clist->abort_count;
1443 cycles_count = clist->cycles_count;
Jin Yaoc4ee0622017-08-07 21:05:15 +08001444 iter_count = clist->iter_count;
1445 iter_cycles = clist->iter_cycles;
Jin Yaoa3366db02019-01-04 14:10:30 +08001446 from_count = clist->from_count;
Jin Yao3dd029e2016-10-31 09:19:51 +08001447
1448 return callchain_counts_printf(fp, bf, bfsize, branch_count,
1449 predicted_count, abort_count,
Jin Yaoc4ee0622017-08-07 21:05:15 +08001450 cycles_count, iter_count, iter_cycles,
Jin Yaoa3366db02019-01-04 14:10:30 +08001451 from_count, &clist->brtype_stat);
Jin Yao3dd029e2016-10-31 09:19:51 +08001452}
1453
Namhyung Kimd1149602014-12-30 14:38:13 +09001454static void free_callchain_node(struct callchain_node *node)
1455{
1456 struct callchain_list *list, *tmp;
1457 struct callchain_node *child;
1458 struct rb_node *n;
1459
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001460 list_for_each_entry_safe(list, tmp, &node->parent_val, list) {
Arnaldo Carvalho de Meloe56fbc92019-07-04 12:13:46 -03001461 list_del_init(&list->list);
Krister Johansen9c68ae92017-01-05 22:23:31 -08001462 map__zput(list->ms.map);
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001463 free(list);
1464 }
1465
Namhyung Kimd1149602014-12-30 14:38:13 +09001466 list_for_each_entry_safe(list, tmp, &node->val, list) {
Arnaldo Carvalho de Meloe56fbc92019-07-04 12:13:46 -03001467 list_del_init(&list->list);
Krister Johansen9c68ae92017-01-05 22:23:31 -08001468 map__zput(list->ms.map);
Namhyung Kimd1149602014-12-30 14:38:13 +09001469 free(list);
1470 }
1471
1472 n = rb_first(&node->rb_root_in);
1473 while (n) {
1474 child = container_of(n, struct callchain_node, rb_node_in);
1475 n = rb_next(n);
1476 rb_erase(&child->rb_node_in, &node->rb_root_in);
1477
1478 free_callchain_node(child);
1479 free(child);
1480 }
1481}
1482
1483void free_callchain(struct callchain_root *root)
1484{
1485 if (!symbol_conf.use_callchain)
1486 return;
1487
1488 free_callchain_node(&root->node);
1489}
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001490
Namhyung Kim42b276a2016-01-05 12:06:00 +09001491static u64 decay_callchain_node(struct callchain_node *node)
1492{
1493 struct callchain_node *child;
1494 struct rb_node *n;
1495 u64 child_hits = 0;
1496
1497 n = rb_first(&node->rb_root_in);
1498 while (n) {
1499 child = container_of(n, struct callchain_node, rb_node_in);
1500
1501 child_hits += decay_callchain_node(child);
1502 n = rb_next(n);
1503 }
1504
1505 node->hit = (node->hit * 7) / 8;
1506 node->children_hit = child_hits;
1507
1508 return node->hit;
1509}
1510
1511void decay_callchain(struct callchain_root *root)
1512{
1513 if (!symbol_conf.use_callchain)
1514 return;
1515
1516 decay_callchain_node(&root->node);
1517}
1518
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001519int callchain_node__make_parent_list(struct callchain_node *node)
1520{
1521 struct callchain_node *parent = node->parent;
1522 struct callchain_list *chain, *new;
1523 LIST_HEAD(head);
1524
1525 while (parent) {
1526 list_for_each_entry_reverse(chain, &parent->val, list) {
1527 new = malloc(sizeof(*new));
1528 if (new == NULL)
1529 goto out;
1530 *new = *chain;
1531 new->has_children = false;
Krister Johansen9c68ae92017-01-05 22:23:31 -08001532 map__get(new->ms.map);
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001533 list_add_tail(&new->list, &head);
1534 }
1535 parent = parent->parent;
1536 }
1537
1538 list_for_each_entry_safe_reverse(chain, new, &head, list)
1539 list_move_tail(&chain->list, &node->parent_val);
1540
1541 if (!list_empty(&node->parent_val)) {
1542 chain = list_first_entry(&node->parent_val, struct callchain_list, list);
1543 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node);
1544
1545 chain = list_first_entry(&node->val, struct callchain_list, list);
1546 chain->has_children = false;
1547 }
1548 return 0;
1549
1550out:
1551 list_for_each_entry_safe(chain, new, &head, list) {
Arnaldo Carvalho de Meloe56fbc92019-07-04 12:13:46 -03001552 list_del_init(&chain->list);
Krister Johansen9c68ae92017-01-05 22:23:31 -08001553 map__zput(chain->ms.map);
Namhyung Kim4b3a3212015-11-09 14:45:43 +09001554 free(chain);
1555 }
1556 return -ENOMEM;
1557}
Namhyung Kim571f1eb2016-12-06 12:40:02 +09001558
1559int callchain_cursor__copy(struct callchain_cursor *dst,
1560 struct callchain_cursor *src)
1561{
1562 int rc = 0;
1563
1564 callchain_cursor_reset(dst);
1565 callchain_cursor_commit(src);
1566
1567 while (true) {
1568 struct callchain_cursor_node *node;
1569
1570 node = callchain_cursor_current(src);
1571 if (node == NULL)
1572 break;
1573
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001574 rc = callchain_cursor_append(dst, node->ip, &node->ms,
Namhyung Kim571f1eb2016-12-06 12:40:02 +09001575 node->branch, &node->branch_flags,
Jin Yaoc4ee0622017-08-07 21:05:15 +08001576 node->nr_loop_iter,
1577 node->iter_cycles,
Milian Wolff40a342c2017-10-09 22:32:56 +02001578 node->branch_from, node->srcline);
Namhyung Kim571f1eb2016-12-06 12:40:02 +09001579 if (rc)
1580 break;
1581
1582 callchain_cursor_advance(src);
1583 }
1584
1585 return rc;
1586}
Arnaldo Carvalho de Melo7b644f92019-01-27 11:55:39 +01001587
1588/*
1589 * Initialize a cursor before adding entries inside, but keep
1590 * the previously allocated entries as a cache.
1591 */
1592void callchain_cursor_reset(struct callchain_cursor *cursor)
1593{
1594 struct callchain_cursor_node *node;
1595
1596 cursor->nr = 0;
1597 cursor->last = &cursor->first;
1598
1599 for (node = cursor->first; node != NULL; node = node->next)
Arnaldo Carvalho de Melo5f0fef82019-11-04 12:14:32 -03001600 map__zput(node->ms.map);
Arnaldo Carvalho de Melo7b644f92019-01-27 11:55:39 +01001601}
Jiri Olsa0d71a2b2020-05-07 11:50:23 +02001602
1603void callchain_param_setup(u64 sample_type)
1604{
1605 if (symbol_conf.use_callchain || symbol_conf.cumulate_callchain) {
1606 if ((sample_type & PERF_SAMPLE_REGS_USER) &&
1607 (sample_type & PERF_SAMPLE_STACK_USER)) {
1608 callchain_param.record_mode = CALLCHAIN_DWARF;
1609 dwarf_callchain_users = true;
1610 } else if (sample_type & PERF_SAMPLE_BRANCH_STACK)
1611 callchain_param.record_mode = CALLCHAIN_LBR;
1612 else
1613 callchain_param.record_mode = CALLCHAIN_FP;
1614 }
1615}
Jin Yao47ef8392020-10-09 10:28:41 +08001616
1617static bool chain_match(struct callchain_list *base_chain,
1618 struct callchain_list *pair_chain)
1619{
1620 enum match_result match;
1621
1622 match = match_chain_strings(base_chain->srcline,
1623 pair_chain->srcline);
1624 if (match != MATCH_ERROR)
1625 return match == MATCH_EQ;
1626
1627 match = match_chain_dso_addresses(base_chain->ms.map,
1628 base_chain->ip,
1629 pair_chain->ms.map,
1630 pair_chain->ip);
1631
1632 return match == MATCH_EQ;
1633}
1634
1635bool callchain_cnode_matched(struct callchain_node *base_cnode,
1636 struct callchain_node *pair_cnode)
1637{
1638 struct callchain_list *base_chain, *pair_chain;
1639 bool match = false;
1640
1641 pair_chain = list_first_entry(&pair_cnode->val,
1642 struct callchain_list,
1643 list);
1644
1645 list_for_each_entry(base_chain, &base_cnode->val, list) {
1646 if (&pair_chain->list == &pair_cnode->val)
1647 return false;
1648
1649 if (!base_chain->srcline || !pair_chain->srcline) {
1650 pair_chain = list_next_entry(pair_chain, list);
1651 continue;
1652 }
1653
1654 match = chain_match(base_chain, pair_chain);
1655 if (!match)
1656 return false;
1657
1658 pair_chain = list_next_entry(pair_chain, list);
1659 }
1660
1661 /*
1662 * Say chain1 is ABC, chain2 is ABCD, we consider they are
1663 * not fully matched.
1664 */
1665 if (pair_chain && (&pair_chain->list != &pair_cnode->val))
1666 return false;
1667
1668 return match;
1669}
Jin Yao28904f42020-10-09 10:28:43 +08001670
1671static u64 count_callchain_hits(struct hist_entry *he)
1672{
1673 struct rb_root *root = &he->sorted_chain;
1674 struct rb_node *rb_node = rb_first(root);
1675 struct callchain_node *node;
1676 u64 chain_hits = 0;
1677
1678 while (rb_node) {
1679 node = rb_entry(rb_node, struct callchain_node, rb_node);
1680 chain_hits += node->hit;
1681 rb_node = rb_next(rb_node);
1682 }
1683
1684 return chain_hits;
1685}
1686
1687u64 callchain_total_hits(struct hists *hists)
1688{
1689 struct rb_node *next = rb_first_cached(&hists->entries);
1690 u64 chain_hits = 0;
1691
1692 while (next) {
1693 struct hist_entry *he = rb_entry(next, struct hist_entry,
1694 rb_node);
1695
1696 chain_hits += count_callchain_hits(he);
1697 next = rb_next(&he->rb_node);
1698 }
1699
1700 return chain_hits;
1701}
Jin Yao5bbd6ba2020-10-09 10:28:44 +08001702
1703s64 callchain_avg_cycles(struct callchain_node *cnode)
1704{
1705 struct callchain_list *chain;
1706 s64 cycles = 0;
1707
1708 list_for_each_entry(chain, &cnode->val, list) {
1709 if (chain->srcline && chain->branch_count)
1710 cycles += chain->cycles_count / chain->branch_count;
1711 }
1712
1713 return cycles;
1714}