1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/metrics/sparse_histogram.h"
#include "base/metrics/sample_map.h"
#include "base/metrics/statistics_recorder.h"
#include "base/pickle.h"
#include "base/strings/stringprintf.h"
#include "base/synchronization/lock.h"
using std::map;
using std::string;
namespace base {
typedef HistogramBase::Count Count;
typedef HistogramBase::Sample Sample;
// static
HistogramBase* SparseHistogram::FactoryGet(const string& name, int32 flags) {
HistogramBase* histogram = StatisticsRecorder::FindHistogram(name);
if (!histogram) {
// To avoid racy destruction at shutdown, the following will be leaked.
HistogramBase* tentative_histogram = new SparseHistogram(name);
tentative_histogram->SetFlags(flags);
histogram =
StatisticsRecorder::RegisterOrDeleteDuplicate(tentative_histogram);
}
DCHECK_EQ(SPARSE_HISTOGRAM, histogram->GetHistogramType());
return histogram;
}
SparseHistogram::~SparseHistogram() {}
HistogramType SparseHistogram::GetHistogramType() const {
return SPARSE_HISTOGRAM;
}
bool SparseHistogram::HasConstructionArguments(
Sample expected_minimum,
Sample expected_maximum,
size_t expected_bucket_count) const {
// SparseHistogram never has min/max/bucket_count limit.
return false;
}
void SparseHistogram::Add(Sample value) {
base::AutoLock auto_lock(lock_);
samples_.Accumulate(value, 1);
}
scoped_ptr<HistogramSamples> SparseHistogram::SnapshotSamples() const {
scoped_ptr<SampleMap> snapshot(new SampleMap());
base::AutoLock auto_lock(lock_);
snapshot->Add(samples_);
return snapshot.PassAs<HistogramSamples>();
}
void SparseHistogram::AddSamples(const HistogramSamples& samples) {
base::AutoLock auto_lock(lock_);
samples_.Add(samples);
}
bool SparseHistogram::AddSamplesFromPickle(PickleIterator* iter) {
base::AutoLock auto_lock(lock_);
return samples_.AddFromPickle(iter);
}
void SparseHistogram::WriteHTMLGraph(string* output) const {
output->append("<PRE>");
WriteAsciiImpl(true, "<br>", output);
output->append("</PRE>");
}
void SparseHistogram::WriteAscii(string* output) const {
WriteAsciiImpl(true, "\n", output);
}
bool SparseHistogram::SerializeInfoImpl(Pickle* pickle) const {
return pickle->WriteString(histogram_name()) && pickle->WriteInt(flags());
}
SparseHistogram::SparseHistogram(const string& name)
: HistogramBase(name) {}
HistogramBase* SparseHistogram::DeserializeInfoImpl(PickleIterator* iter) {
string histogram_name;
int flags;
if (!iter->ReadString(&histogram_name) || !iter->ReadInt(&flags)) {
DLOG(ERROR) << "Pickle error decoding Histogram: " << histogram_name;
return NULL;
}
DCHECK(flags & HistogramBase::kIPCSerializationSourceFlag);
flags &= ~HistogramBase::kIPCSerializationSourceFlag;
return SparseHistogram::FactoryGet(histogram_name, flags);
}
void SparseHistogram::GetParameters(DictionaryValue* params) const {
// TODO(kaiwang): Implement. (See HistogramBase::WriteJSON.)
}
void SparseHistogram::GetCountAndBucketData(Count* count,
int64* sum,
ListValue* buckets) const {
// TODO(kaiwang): Implement. (See HistogramBase::WriteJSON.)
}
void SparseHistogram::WriteAsciiImpl(bool graph_it,
const std::string& newline,
std::string* output) const {
// Get a local copy of the data so we are consistent.
scoped_ptr<HistogramSamples> snapshot = SnapshotSamples();
Count total_count = snapshot->TotalCount();
double scaled_total_count = total_count / 100.0;
WriteAsciiHeader(total_count, output);
output->append(newline);
// Determine how wide the largest bucket range is (how many digits to print),
// so that we'll be able to right-align starts for the graphical bars.
// Determine which bucket has the largest sample count so that we can
// normalize the graphical bar-width relative to that sample count.
Count largest_count = 0;
Sample largest_sample = 0;
scoped_ptr<SampleCountIterator> it = snapshot->Iterator();
while (!it->Done())
{
Sample min;
Sample max;
Count count;
it->Get(&min, &max, &count);
if (min > largest_sample)
largest_sample = min;
if (count > largest_count)
largest_count = count;
it->Next();
}
size_t print_width = GetSimpleAsciiBucketRange(largest_sample).size() + 1;
// iterate over each item and display them
it = snapshot->Iterator();
while (!it->Done())
{
Sample min;
Sample max;
Count count;
it->Get(&min, &max, &count);
// value is min, so display it
string range = GetSimpleAsciiBucketRange(min);
output->append(range);
for (size_t j = 0; range.size() + j < print_width + 1; ++j)
output->push_back(' ');
if (graph_it)
WriteAsciiBucketGraph(count, largest_count, output);
WriteAsciiBucketValue(count, scaled_total_count, output);
output->append(newline);
it->Next();
}
}
void SparseHistogram::WriteAsciiHeader(const Count total_count,
std::string* output) const {
StringAppendF(output,
"Histogram: %s recorded %d samples",
histogram_name().c_str(),
total_count);
if (flags() & ~kHexRangePrintingFlag)
StringAppendF(output, " (flags = 0x%x)", flags() & ~kHexRangePrintingFlag);
}
} // namespace base
|
