diff options
author | Namhyung Kim <namhyung.kim@lge.com> | 2013-01-22 04:09:33 -0500 |
---|---|---|
committer | Arnaldo Carvalho de Melo <acme@redhat.com> | 2013-01-31 11:07:45 -0500 |
commit | 29d720ed5f897d7e26f6b36c12c7704dc200d107 (patch) | |
tree | 440fc33f1e4d8954c508eb3fab6296eb7b3d62cd /tools/perf/util/hist.c | |
parent | 6e1f601a10cbaa5cda869f844292dd81c519a8e7 (diff) |
perf hists: Resort hist entries using group members for output
When event group is enabled, sorting hist entries on periods for output
should consider groups members' period also. To do that, build period
table using link/pair information and compare the table.
Signed-off-by: Namhyung Kim <namhyung@kernel.org>
Acked-by: Jiri Olsa <jolsa@redhat.com>
Cc: Ingo Molnar <mingo@kernel.org>
Cc: Jiri Olsa <jolsa@redhat.com>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Stephane Eranian <eranian@google.com>
Link: http://lkml.kernel.org/r/1358845787-1350-6-git-send-email-namhyung@kernel.org
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
Diffstat (limited to 'tools/perf/util/hist.c')
-rw-r--r-- | tools/perf/util/hist.c | 59 |
1 files changed, 58 insertions, 1 deletions
diff --git a/tools/perf/util/hist.c b/tools/perf/util/hist.c index 8170a3d11ffa..f855941bebea 100644 --- a/tools/perf/util/hist.c +++ b/tools/perf/util/hist.c | |||
@@ -4,6 +4,7 @@ | |||
4 | #include "hist.h" | 4 | #include "hist.h" |
5 | #include "session.h" | 5 | #include "session.h" |
6 | #include "sort.h" | 6 | #include "sort.h" |
7 | #include "evsel.h" | ||
7 | #include <math.h> | 8 | #include <math.h> |
8 | 9 | ||
9 | static bool hists__filter_entry_by_dso(struct hists *hists, | 10 | static bool hists__filter_entry_by_dso(struct hists *hists, |
@@ -540,6 +541,62 @@ void hists__collapse_resort_threaded(struct hists *hists) | |||
540 | * reverse the map, sort on period. | 541 | * reverse the map, sort on period. |
541 | */ | 542 | */ |
542 | 543 | ||
544 | static int period_cmp(u64 period_a, u64 period_b) | ||
545 | { | ||
546 | if (period_a > period_b) | ||
547 | return 1; | ||
548 | if (period_a < period_b) | ||
549 | return -1; | ||
550 | return 0; | ||
551 | } | ||
552 | |||
553 | static int hist_entry__sort_on_period(struct hist_entry *a, | ||
554 | struct hist_entry *b) | ||
555 | { | ||
556 | int ret; | ||
557 | int i, nr_members; | ||
558 | struct perf_evsel *evsel; | ||
559 | struct hist_entry *pair; | ||
560 | u64 *periods_a, *periods_b; | ||
561 | |||
562 | ret = period_cmp(a->stat.period, b->stat.period); | ||
563 | if (ret || !symbol_conf.event_group) | ||
564 | return ret; | ||
565 | |||
566 | evsel = hists_to_evsel(a->hists); | ||
567 | nr_members = evsel->nr_members; | ||
568 | if (nr_members <= 1) | ||
569 | return ret; | ||
570 | |||
571 | periods_a = zalloc(sizeof(periods_a) * nr_members); | ||
572 | periods_b = zalloc(sizeof(periods_b) * nr_members); | ||
573 | |||
574 | if (!periods_a || !periods_b) | ||
575 | goto out; | ||
576 | |||
577 | list_for_each_entry(pair, &a->pairs.head, pairs.node) { | ||
578 | evsel = hists_to_evsel(pair->hists); | ||
579 | periods_a[perf_evsel__group_idx(evsel)] = pair->stat.period; | ||
580 | } | ||
581 | |||
582 | list_for_each_entry(pair, &b->pairs.head, pairs.node) { | ||
583 | evsel = hists_to_evsel(pair->hists); | ||
584 | periods_b[perf_evsel__group_idx(evsel)] = pair->stat.period; | ||
585 | } | ||
586 | |||
587 | for (i = 1; i < nr_members; i++) { | ||
588 | ret = period_cmp(periods_a[i], periods_b[i]); | ||
589 | if (ret) | ||
590 | break; | ||
591 | } | ||
592 | |||
593 | out: | ||
594 | free(periods_a); | ||
595 | free(periods_b); | ||
596 | |||
597 | return ret; | ||
598 | } | ||
599 | |||
543 | static void __hists__insert_output_entry(struct rb_root *entries, | 600 | static void __hists__insert_output_entry(struct rb_root *entries, |
544 | struct hist_entry *he, | 601 | struct hist_entry *he, |
545 | u64 min_callchain_hits) | 602 | u64 min_callchain_hits) |
@@ -556,7 +613,7 @@ static void __hists__insert_output_entry(struct rb_root *entries, | |||
556 | parent = *p; | 613 | parent = *p; |
557 | iter = rb_entry(parent, struct hist_entry, rb_node); | 614 | iter = rb_entry(parent, struct hist_entry, rb_node); |
558 | 615 | ||
559 | if (he->stat.period > iter->stat.period) | 616 | if (hist_entry__sort_on_period(he, iter) > 0) |
560 | p = &(*p)->rb_left; | 617 | p = &(*p)->rb_left; |
561 | else | 618 | else |
562 | p = &(*p)->rb_right; | 619 | p = &(*p)->rb_right; |