提交 af0a6fa4 编写于 作者: F Frederic Weisbecker 提交者: Ingo Molnar

perf tools: Fix missing top level callchain

While recursively printing the branches of each callchains, we
forget to display the root. It is never printed.

Say we have:

    symbol
    f1
    f2
     |
     -------- f3
     |        f4
     |
     ---------f5
              f6

Actually we never see that, instead it displays:

    symbol
    |
    --------- f3
    |         f4
    |
    --------- f5
              f6

However f1 is always the same than "symbol" and if we are
sorting by symbols first then "symbol", f1 and f2 will be well
aligned like in the above example, so displaying f1 looks
redundant here.

But if we are sorting by something else first (dso, comm,
etc...), displaying f1 doesn't look redundant but rather
necessary because the symbol is not well aligned anymore with
its callchain:

     comm     dso        symbol
     f1
     f2
     |
     --------- [...]

And we want the callchain to be obvious.
So we fix the bug by printing the root branch, but we also
filter its first entry if we are sorting by symbols first.
Reported-by: NAnton Blanchard <anton@samba.org>
Signed-off-by: NFrederic Weisbecker <fweisbec@gmail.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Arnaldo Carvalho de Melo <acme@redhat.com>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Paul Mackerras <paulus@samba.org>
LKML-Reference: <1256246604-17156-1-git-send-email-fweisbec@gmail.com>
Signed-off-by: NIngo Molnar <mingo@elte.hu>
上级 4e3b799d
...@@ -122,8 +122,8 @@ static void init_rem_hits(void) ...@@ -122,8 +122,8 @@ static void init_rem_hits(void)
} }
static size_t static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self, __callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
u64 total_samples, int depth, int depth_mask) u64 total_samples, int depth, int depth_mask)
{ {
struct rb_node *node, *next; struct rb_node *node, *next;
struct callchain_node *child; struct callchain_node *child;
...@@ -174,9 +174,9 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self, ...@@ -174,9 +174,9 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
new_total, new_total,
cumul); cumul);
} }
ret += callchain__fprintf_graph(fp, child, new_total, ret += __callchain__fprintf_graph(fp, child, new_total,
depth + 1, depth + 1,
new_depth_mask | (1 << depth)); new_depth_mask | (1 << depth));
node = next; node = next;
} }
...@@ -196,6 +196,33 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self, ...@@ -196,6 +196,33 @@ callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
return ret; return ret;
} }
static size_t
callchain__fprintf_graph(FILE *fp, struct callchain_node *self,
u64 total_samples)
{
struct callchain_list *chain;
int i = 0;
int ret = 0;
list_for_each_entry(chain, &self->val, list) {
if (chain->ip >= PERF_CONTEXT_MAX)
continue;
if (!i++ && sort_by_sym_first)
continue;
if (chain->sym)
ret += fprintf(fp, " %s\n", chain->sym->name);
else
ret += fprintf(fp, " %p\n",
(void *)(long)chain->ip);
}
ret += __callchain__fprintf_graph(fp, self, total_samples, 1, 1);
return ret;
}
static size_t static size_t
callchain__fprintf_flat(FILE *fp, struct callchain_node *self, callchain__fprintf_flat(FILE *fp, struct callchain_node *self,
u64 total_samples) u64 total_samples)
...@@ -244,8 +271,7 @@ hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self, ...@@ -244,8 +271,7 @@ hist_entry_callchain__fprintf(FILE *fp, struct hist_entry *self,
break; break;
case CHAIN_GRAPH_ABS: /* Falldown */ case CHAIN_GRAPH_ABS: /* Falldown */
case CHAIN_GRAPH_REL: case CHAIN_GRAPH_REL:
ret += callchain__fprintf_graph(fp, chain, ret += callchain__fprintf_graph(fp, chain, total_samples);
total_samples, 1, 1);
case CHAIN_NONE: case CHAIN_NONE:
default: default:
break; break;
......
...@@ -5,8 +5,9 @@ char default_parent_pattern[] = "^sys_|^do_page_fault"; ...@@ -5,8 +5,9 @@ char default_parent_pattern[] = "^sys_|^do_page_fault";
char *parent_pattern = default_parent_pattern; char *parent_pattern = default_parent_pattern;
char default_sort_order[] = "comm,dso,symbol"; char default_sort_order[] = "comm,dso,symbol";
char *sort_order = default_sort_order; char *sort_order = default_sort_order;
int sort__need_collapse = 0; int sort__need_collapse = 0;
int sort__has_parent = 0; int sort__has_parent = 0;
int sort_by_sym_first;
unsigned int dsos__col_width; unsigned int dsos__col_width;
unsigned int comms__col_width; unsigned int comms__col_width;
...@@ -265,6 +266,10 @@ int sort_dimension__add(const char *tok) ...@@ -265,6 +266,10 @@ int sort_dimension__add(const char *tok)
sort__has_parent = 1; sort__has_parent = 1;
} }
if (list_empty(&hist_entry__sort_list) &&
!strcmp(sd->name, "symbol"))
sort_by_sym_first = true;
list_add_tail(&sd->entry->list, &hist_entry__sort_list); list_add_tail(&sd->entry->list, &hist_entry__sort_list);
sd->taken = 1; sd->taken = 1;
...@@ -273,4 +278,3 @@ int sort_dimension__add(const char *tok) ...@@ -273,4 +278,3 @@ int sort_dimension__add(const char *tok)
return -ESRCH; return -ESRCH;
} }
...@@ -39,6 +39,7 @@ extern struct sort_entry sort_parent; ...@@ -39,6 +39,7 @@ extern struct sort_entry sort_parent;
extern unsigned int dsos__col_width; extern unsigned int dsos__col_width;
extern unsigned int comms__col_width; extern unsigned int comms__col_width;
extern unsigned int threads__col_width; extern unsigned int threads__col_width;
extern int sort_by_sym_first;
struct hist_entry { struct hist_entry {
struct rb_node rb_node; struct rb_node rb_node;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册