perf report: Show progress bar for output resorting
Sometimes it takes a long time to resort hist entries for output in case of a large data file. Show a progress bar window and inform user. Signed-off-by: Namhyung Kim <namhyung@kernel.org> Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: David Ahern <dsahern@gmail.com> Cc: Ingo Molnar <mingo@kernel.org> Cc: Jiri Olsa <jolsa@redhat.com> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> Cc: Stephane Eranian <eranian@google.com> Link: http://lkml.kernel.org/r/1419223455-4362-3-git-send-email-namhyung@kernel.org Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
This commit is contained in:
parent
ac931f87a6
commit
740b97f950
9 changed files with 43 additions and 15 deletions
|
@ -232,7 +232,7 @@ static int __cmd_annotate(struct perf_annotate *ann)
|
|||
if (nr_samples > 0) {
|
||||
total_nr_samples += nr_samples;
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (symbol_conf.event_group &&
|
||||
!perf_evsel__is_group_leader(pos))
|
||||
|
|
|
@ -605,7 +605,7 @@ static void hists__process(struct hists *hists)
|
|||
hists__precompute(hists);
|
||||
hists__compute_resort(hists);
|
||||
} else {
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
}
|
||||
|
||||
hists__fprintf(hists, true, 0, 0, 0, stdout);
|
||||
|
|
|
@ -457,6 +457,19 @@ static void report__collapse_hists(struct report *rep)
|
|||
ui_progress__finish();
|
||||
}
|
||||
|
||||
static void report__output_resort(struct report *rep)
|
||||
{
|
||||
struct ui_progress prog;
|
||||
struct perf_evsel *pos;
|
||||
|
||||
ui_progress__init(&prog, rep->nr_entries, "Sorting events for output...");
|
||||
|
||||
evlist__for_each(rep->session->evlist, pos)
|
||||
hists__output_resort(evsel__hists(pos), &prog);
|
||||
|
||||
ui_progress__finish();
|
||||
}
|
||||
|
||||
static int __cmd_report(struct report *rep)
|
||||
{
|
||||
int ret;
|
||||
|
@ -505,13 +518,20 @@ static int __cmd_report(struct report *rep)
|
|||
if (session_done())
|
||||
return 0;
|
||||
|
||||
/*
|
||||
* recalculate number of entries after collapsing since it
|
||||
* might be changed during the collapse phase.
|
||||
*/
|
||||
rep->nr_entries = 0;
|
||||
evlist__for_each(session->evlist, pos)
|
||||
rep->nr_entries += evsel__hists(pos)->nr_entries;
|
||||
|
||||
if (rep->nr_entries == 0) {
|
||||
ui__error("The %s file has no samples!\n", file->path);
|
||||
return 0;
|
||||
}
|
||||
|
||||
evlist__for_each(session->evlist, pos)
|
||||
hists__output_resort(evsel__hists(pos));
|
||||
report__output_resort(rep);
|
||||
|
||||
return report__browse_hists(rep);
|
||||
}
|
||||
|
|
|
@ -285,7 +285,7 @@ static void perf_top__print_sym_table(struct perf_top *top)
|
|||
}
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
hists__output_recalc_col_len(hists, top->print_entries - printed);
|
||||
putchar('\n');
|
||||
|
@ -554,7 +554,7 @@ static void perf_top__sort_new_samples(void *arg)
|
|||
}
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
}
|
||||
|
||||
static void *display_thread_tui(void *arg)
|
||||
|
|
|
@ -187,7 +187,7 @@ static int do_test(struct hists *hists, struct result *expected, size_t nr_expec
|
|||
* function since TEST_ASSERT_VAL() returns in case of failure.
|
||||
*/
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("use callchain: %d, cumulate callchain: %d\n",
|
||||
|
|
|
@ -138,7 +138,7 @@ int test__hists_filter(void)
|
|||
struct hists *hists = evsel__hists(evsel);
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("Normal histogram\n");
|
||||
|
|
|
@ -152,7 +152,7 @@ static int test1(struct perf_evsel *evsel, struct machine *machine)
|
|||
goto out;
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("[fields = %s, sort = %s]\n", field_order, sort_order);
|
||||
|
@ -252,7 +252,7 @@ static int test2(struct perf_evsel *evsel, struct machine *machine)
|
|||
goto out;
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("[fields = %s, sort = %s]\n", field_order, sort_order);
|
||||
|
@ -306,7 +306,7 @@ static int test3(struct perf_evsel *evsel, struct machine *machine)
|
|||
goto out;
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("[fields = %s, sort = %s]\n", field_order, sort_order);
|
||||
|
@ -384,7 +384,7 @@ static int test4(struct perf_evsel *evsel, struct machine *machine)
|
|||
goto out;
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("[fields = %s, sort = %s]\n", field_order, sort_order);
|
||||
|
@ -487,7 +487,7 @@ static int test5(struct perf_evsel *evsel, struct machine *machine)
|
|||
goto out;
|
||||
|
||||
hists__collapse_resort(hists, NULL);
|
||||
hists__output_resort(hists);
|
||||
hists__output_resort(hists, NULL);
|
||||
|
||||
if (verbose > 2) {
|
||||
pr_info("[fields = %s, sort = %s]\n", field_order, sort_order);
|
||||
|
|
|
@ -6,6 +6,7 @@
|
|||
#include "evlist.h"
|
||||
#include "evsel.h"
|
||||
#include "annotate.h"
|
||||
#include "ui/progress.h"
|
||||
#include <math.h>
|
||||
|
||||
static bool hists__filter_entry_by_dso(struct hists *hists,
|
||||
|
@ -987,6 +988,7 @@ static bool hists__collapse_insert_entry(struct hists *hists __maybe_unused,
|
|||
else
|
||||
p = &(*p)->rb_right;
|
||||
}
|
||||
hists->nr_entries++;
|
||||
|
||||
rb_link_node(&he->rb_node_in, parent, p);
|
||||
rb_insert_color(&he->rb_node_in, root);
|
||||
|
@ -1024,7 +1026,10 @@ void hists__collapse_resort(struct hists *hists, struct ui_progress *prog)
|
|||
if (!sort__need_collapse)
|
||||
return;
|
||||
|
||||
hists->nr_entries = 0;
|
||||
|
||||
root = hists__get_rotate_entries_in(hists);
|
||||
|
||||
next = rb_first(root);
|
||||
|
||||
while (next) {
|
||||
|
@ -1119,7 +1124,7 @@ static void __hists__insert_output_entry(struct rb_root *entries,
|
|||
rb_insert_color(&he->rb_node, entries);
|
||||
}
|
||||
|
||||
void hists__output_resort(struct hists *hists)
|
||||
void hists__output_resort(struct hists *hists, struct ui_progress *prog)
|
||||
{
|
||||
struct rb_root *root;
|
||||
struct rb_node *next;
|
||||
|
@ -1148,6 +1153,9 @@ void hists__output_resort(struct hists *hists)
|
|||
|
||||
if (!n->filtered)
|
||||
hists__calc_col_len(hists, n);
|
||||
|
||||
if (prog)
|
||||
ui_progress__update(prog, 1);
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -121,7 +121,7 @@ int hist_entry__sort_snprintf(struct hist_entry *he, char *bf, size_t size,
|
|||
struct hists *hists);
|
||||
void hist_entry__free(struct hist_entry *);
|
||||
|
||||
void hists__output_resort(struct hists *hists);
|
||||
void hists__output_resort(struct hists *hists, struct ui_progress *prog);
|
||||
void hists__collapse_resort(struct hists *hists, struct ui_progress *prog);
|
||||
|
||||
void hists__decay_entries(struct hists *hists, bool zap_user, bool zap_kernel);
|
||||
|
|
Loading…
Reference in a new issue