@@ -488,14 +488,13 @@ static int hist_browser__show_callchain_node_rb_tree(struct hist_browser *browse
488
488
{
489
489
struct rb_node * node ;
490
490
int first_row = row , width , offset = level * LEVEL_OFFSET_STEP ;
491
- u64 new_total , remaining ;
491
+ u64 new_total ;
492
492
493
493
if (callchain_param .mode == CHAIN_GRAPH_REL )
494
494
new_total = chain_node -> children_hit ;
495
495
else
496
496
new_total = total ;
497
497
498
- remaining = new_total ;
499
498
node = rb_first (& chain_node -> rb_root );
500
499
while (node ) {
501
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
505
int first = true;
507
506
int extra_offset = 0 ;
508
507
509
- remaining -= cumul ;
510
-
511
508
list_for_each_entry (chain , & child -> val , list ) {
512
509
char bf [1024 ], * alloc_str ;
513
510
const char * str ;
@@ -1084,15 +1081,14 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro
1084
1081
{
1085
1082
struct rb_node * node ;
1086
1083
int offset = level * LEVEL_OFFSET_STEP ;
1087
- u64 new_total , remaining ;
1084
+ u64 new_total ;
1088
1085
int printed = 0 ;
1089
1086
1090
1087
if (callchain_param .mode == CHAIN_GRAPH_REL )
1091
1088
new_total = chain_node -> children_hit ;
1092
1089
else
1093
1090
new_total = total ;
1094
1091
1095
- remaining = new_total ;
1096
1092
node = rb_first (& chain_node -> rb_root );
1097
1093
while (node ) {
1098
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
1099
int first = true;
1104
1100
int extra_offset = 0 ;
1105
1101
1106
- remaining -= cumul ;
1107
-
1108
1102
list_for_each_entry (chain , & child -> val , list ) {
1109
1103
char bf [1024 ], * alloc_str ;
1110
1104
const char * str ;
0 commit comments