aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/util
diff options
context:
space:
mode:
authorJohn Kacur <jkacur@redhat.com>2009-09-28 09:32:55 -0400
committerIngo Molnar <mingo@elte.hu>2009-09-30 07:57:56 -0400
commit3d1d07ecd2009f65cb2091563fa21f9600c36774 (patch)
treea1ef97a8264fc880ee8a9406a9be9070d0d12176 /tools/perf/util
parentdd68ada2d417e57b848822a1407b5317a54136c5 (diff)
perf tools: Put common histogram functions in their own file
Move histogram related functions into their own files (hist.c and hist.h) and make use of them in builtin-annotate.c and builtin-report.c. Signed-off-by: John Kacur <jkacur@redhat.com> Acked-by: Frederic Weisbecker <fweisbec@gmail.com> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> LKML-Reference: <alpine.LFD.2.00.0909281531180.8316@localhost.localdomain> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'tools/perf/util')
-rw-r--r--tools/perf/util/hist.c164
-rw-r--r--tools/perf/util/hist.h47
2 files changed, 211 insertions, 0 deletions
diff --git a/tools/perf/util/hist.c b/tools/perf/util/hist.c
new file mode 100644
index 000000000000..82808dc4f8e3
--- /dev/null
+++ b/tools/perf/util/hist.c
@@ -0,0 +1,164 @@
1#include "hist.h"
2
3struct rb_root hist;
4struct rb_root collapse_hists;
5struct rb_root output_hists;
6int callchain;
7
8struct callchain_param callchain_param = {
9 .mode = CHAIN_GRAPH_REL,
10 .min_percent = 0.5
11};
12
13unsigned long total;
14unsigned long total_mmap;
15unsigned long total_comm;
16unsigned long total_fork;
17unsigned long total_unknown;
18unsigned long total_lost;
19
20/*
21 * histogram, sorted on item, collects counts
22 */
23
24int64_t
25hist_entry__cmp(struct hist_entry *left, struct hist_entry *right)
26{
27 struct sort_entry *se;
28 int64_t cmp = 0;
29
30 list_for_each_entry(se, &hist_entry__sort_list, list) {
31 cmp = se->cmp(left, right);
32 if (cmp)
33 break;
34 }
35
36 return cmp;
37}
38
39int64_t
40hist_entry__collapse(struct hist_entry *left, struct hist_entry *right)
41{
42 struct sort_entry *se;
43 int64_t cmp = 0;
44
45 list_for_each_entry(se, &hist_entry__sort_list, list) {
46 int64_t (*f)(struct hist_entry *, struct hist_entry *);
47
48 f = se->collapse ?: se->cmp;
49
50 cmp = f(left, right);
51 if (cmp)
52 break;
53 }
54
55 return cmp;
56}
57
58void hist_entry__free(struct hist_entry *he)
59{
60 free(he);
61}
62
63/*
64 * collapse the histogram
65 */
66
67void collapse__insert_entry(struct hist_entry *he)
68{
69 struct rb_node **p = &collapse_hists.rb_node;
70 struct rb_node *parent = NULL;
71 struct hist_entry *iter;
72 int64_t cmp;
73
74 while (*p != NULL) {
75 parent = *p;
76 iter = rb_entry(parent, struct hist_entry, rb_node);
77
78 cmp = hist_entry__collapse(iter, he);
79
80 if (!cmp) {
81 iter->count += he->count;
82 hist_entry__free(he);
83 return;
84 }
85
86 if (cmp < 0)
87 p = &(*p)->rb_left;
88 else
89 p = &(*p)->rb_right;
90 }
91
92 rb_link_node(&he->rb_node, parent, p);
93 rb_insert_color(&he->rb_node, &collapse_hists);
94}
95
96void collapse__resort(void)
97{
98 struct rb_node *next;
99 struct hist_entry *n;
100
101 if (!sort__need_collapse)
102 return;
103
104 next = rb_first(&hist);
105 while (next) {
106 n = rb_entry(next, struct hist_entry, rb_node);
107 next = rb_next(&n->rb_node);
108
109 rb_erase(&n->rb_node, &hist);
110 collapse__insert_entry(n);
111 }
112}
113
114/*
115 * reverse the map, sort on count.
116 */
117
118void output__insert_entry(struct hist_entry *he, u64 min_callchain_hits)
119{
120 struct rb_node **p = &output_hists.rb_node;
121 struct rb_node *parent = NULL;
122 struct hist_entry *iter;
123
124 if (callchain)
125 callchain_param.sort(&he->sorted_chain, &he->callchain,
126 min_callchain_hits, &callchain_param);
127
128 while (*p != NULL) {
129 parent = *p;
130 iter = rb_entry(parent, struct hist_entry, rb_node);
131
132 if (he->count > iter->count)
133 p = &(*p)->rb_left;
134 else
135 p = &(*p)->rb_right;
136 }
137
138 rb_link_node(&he->rb_node, parent, p);
139 rb_insert_color(&he->rb_node, &output_hists);
140}
141
142void output__resort(u64 total_samples)
143{
144 struct rb_node *next;
145 struct hist_entry *n;
146 struct rb_root *tree = &hist;
147 u64 min_callchain_hits;
148
149 min_callchain_hits =
150 total_samples * (callchain_param.min_percent / 100);
151
152 if (sort__need_collapse)
153 tree = &collapse_hists;
154
155 next = rb_first(tree);
156
157 while (next) {
158 n = rb_entry(next, struct hist_entry, rb_node);
159 next = rb_next(&n->rb_node);
160
161 rb_erase(&n->rb_node, tree);
162 output__insert_entry(n, min_callchain_hits);
163 }
164}
diff --git a/tools/perf/util/hist.h b/tools/perf/util/hist.h
new file mode 100644
index 000000000000..9a8daa12b43a
--- /dev/null
+++ b/tools/perf/util/hist.h
@@ -0,0 +1,47 @@
1#ifndef __PERF_HIST_H
2#define __PERF_HIST_H
3#include "../builtin.h"
4
5#include "util.h"
6
7#include "color.h"
8#include <linux/list.h>
9#include "cache.h"
10#include <linux/rbtree.h>
11#include "symbol.h"
12#include "string.h"
13#include "callchain.h"
14#include "strlist.h"
15#include "values.h"
16
17#include "../perf.h"
18#include "debug.h"
19#include "header.h"
20
21#include "parse-options.h"
22#include "parse-events.h"
23
24#include "thread.h"
25#include "sort.h"
26
27extern struct rb_root hist;
28extern struct rb_root collapse_hists;
29extern struct rb_root output_hists;
30extern int callchain;
31extern struct callchain_param callchain_param;
32extern unsigned long total;
33extern unsigned long total_mmap;
34extern unsigned long total_comm;
35extern unsigned long total_fork;
36extern unsigned long total_unknown;
37extern unsigned long total_lost;
38
39extern int64_t hist_entry__cmp(struct hist_entry *, struct hist_entry *);
40extern int64_t hist_entry__collapse(struct hist_entry *, struct hist_entry *);
41extern void hist_entry__free(struct hist_entry *);
42extern void collapse__insert_entry(struct hist_entry *);
43extern void collapse__resort(void);
44extern void output__insert_entry(struct hist_entry *, u64);
45extern void output__resort(u64);
46
47#endif /* __PERF_HIST_H */
generated by cgit v1.2.2 (git 2.25.0) at 2024-12-14 12:59:09 -0500