Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit 36e15dd4 authored by Namhyung Kim's avatar Namhyung Kim Committed by Arnaldo Carvalho de Melo
Browse files

perf hists browser: Get rid of unused 'remaining' variable 



It seems that the 'remaining' variable is not used by any real code.

Signed-off-by: default avatarNamhyung Kim <namhyung@kernel.org>
Cc: Andi Kleen <andi@firstfloor.org>
Cc: David Ahern <dsahern@gmail.com>
Cc: Frederic Weisbecker <fweisbec@gmail.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Jiri Olsa <jolsa@redhat.com>
Cc: Namhyung Kim <namhyung.kim@lge.com>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Link: http://lkml.kernel.org/r/1408522080-26556-4-git-send-email-namhyung@kernel.org


Signed-off-by: default avatarArnaldo Carvalho de Melo <acme@redhat.com>
parent ad7e767a

tools/perf/ui/browsers/hists.c

+2 −8
Original line number Diff line number Diff line
@@ -488,14 +488,13 @@ static int hist_browser__show_callchain_node_rb_tree(struct hist_browser *browse 
{

	struct rb_node *node;

	int first_row = row, width, offset = level * LEVEL_OFFSET_STEP;

	u64 new_total, remaining;

	u64 new_total;



	if (callchain_param.mode == CHAIN_GRAPH_REL)

		new_total = chain_node->children_hit;

	else

		new_total = total;



	remaining = new_total;

	node = rb_first(&chain_node->rb_root);

	while (node) {

		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 
		int first = true;

		int extra_offset = 0;



		remaining -= cumul;



		list_for_each_entry(chain, &child->val, list) {

			char bf[1024], *alloc_str;

			const char *str;
@@ -1084,7 +1081,7 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro 
{

	struct rb_node *node;

	int offset = level * LEVEL_OFFSET_STEP;

	u64 new_total, remaining;

	u64 new_total;

	int printed = 0;



	if (callchain_param.mode == CHAIN_GRAPH_REL)
@@ -1092,7 +1089,6 @@ static int hist_browser__fprintf_callchain_node_rb_tree(struct hist_browser *bro 
	else

		new_total = total;



	remaining = new_total;

	node = rb_first(&chain_node->rb_root);

	while (node) {

		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 
		int first = true;

		int extra_offset = 0;



		remaining -= cumul;



		list_for_each_entry(chain, &child->val, list) {

			char bf[1024], *alloc_str;

			const char *str;