aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/ui/browsers/hists.c
diff options
context:
space:
mode:
Diffstat (limited to 'tools/perf/ui/browsers/hists.c')
-rw-r--r--tools/perf/ui/browsers/hists.c10
1 files changed, 2 insertions, 8 deletions
diff --git a/tools/perf/ui/browsers/hists.c b/tools/perf/ui/browsers/hists.c
index 4892480e8298..2f34c6b6d5dc 100644
--- a/tools/perf/ui/browsers/hists.c
+++ b/tools/perf/ui/browsers/hists.c
@@ -488,14 +488,13 @@ static int hist_browser__show_callchain_node_rb_tree(struct hist_browser *browse
488{ 488{
489 struct rb_node *node; 489 struct rb_node *node;
490 int first_row = row, width, offset = level * LEVEL_OFFSET_STEP; 490 int first_row = row, width, offset = level * LEVEL_OFFSET_STEP;
491 u64 new_total, remaining; 491 u64 new_total;
492 492
493 if (callchain_param.mode == CHAIN_GRAPH_REL) 493 if (callchain_param.mode == CHAIN_GRAPH_REL)
494 new_total = chain_node->children_hit; 494 new_total = chain_node->children_hit;
495 else 495 else
496 new_total = total; 496 new_total = total;
497 497
498 remaining = new_total;
499 node = rb_first(&chain_node->rb_root); 498 node = rb_first(&chain_node->rb_root);
500 while (node) { 499 while (node) {
501 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); 500 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
@@ -506,8 +505,6 @@ static int hist_browser__show_callchain_node_rb_tree(struct hist_browser *browse
506 int first = true; 505 int first = true;
507 int extra_offset = 0; 506 int extra_offset = 0;
508 507
509 remaining -= cumul;
510
511 list_for_each_entry(chain, &child->val, list) { 508 list_for_each_entry(chain, &child->val, list) {
512 char bf[1024], *alloc_str; 509 char bf[1024], *alloc_str;
513 const char *str; 510 const char *str;
@@ -1084,7 +1081,7 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro
1084{ 1081{
1085 struct rb_node *node; 1082 struct rb_node *node;
1086 int offset = level * LEVEL_OFFSET_STEP; 1083 int offset = level * LEVEL_OFFSET_STEP;
1087 u64 new_total, remaining; 1084 u64 new_total;
1088 int printed = 0; 1085 int printed = 0;
1089 1086
1090 if (callchain_param.mode == CHAIN_GRAPH_REL) 1087 if (callchain_param.mode == CHAIN_GRAPH_REL)
@@ -1092,7 +1089,6 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro
1092 else 1089 else
1093 new_total = total; 1090 new_total = total;
1094 1091
1095 remaining = new_total;
1096 node = rb_first(&chain_node->rb_root); 1092 node = rb_first(&chain_node->rb_root);
1097 while (node) { 1093 while (node) {
1098 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); 1094 struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);
@@ -1103,8 +1099,6 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro
1103 int first = true; 1099 int first = true;
1104 int extra_offset = 0; 1100 int extra_offset = 0;
1105 1101
1106 remaining -= cumul;
1107
1108 list_for_each_entry(chain, &child->val, list) { 1102 list_for_each_entry(chain, &child->val, list) {
1109 char bf[1024], *alloc_str; 1103 char bf[1024], *alloc_str;
1110 const char *str; 1104 const char *str;