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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/*
* libjingle
* Copyright 2013, Google Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "talk/base/profiler.h"
#include <math.h>
#include "talk/base/timeutils.h"
namespace {
// When written to an ostream, FormattedTime chooses an appropriate scale and
// suffix for a time value given in seconds.
class FormattedTime {
public:
explicit FormattedTime(double t) : time_(t) {}
double time() const { return time_; }
private:
double time_;
};
std::ostream& operator<<(std::ostream& stream, const FormattedTime& time) {
if (time.time() < 1.0) {
stream << (time.time() * 1000.0) << "ms";
} else {
stream << time.time() << 's';
}
return stream;
}
} // namespace
namespace talk_base {
ProfilerEvent::ProfilerEvent()
: total_time_(0.0),
mean_(0.0),
sum_of_squared_differences_(0.0),
start_count_(0),
event_count_(0) {
}
void ProfilerEvent::Start() {
if (start_count_ == 0) {
current_start_time_ = TimeNanos();
}
++start_count_;
}
void ProfilerEvent::Stop(uint64 stop_time) {
--start_count_;
ASSERT(start_count_ >= 0);
if (start_count_ == 0) {
double elapsed = static_cast<double>(stop_time - current_start_time_) /
kNumNanosecsPerSec;
total_time_ += elapsed;
if (event_count_ == 0) {
minimum_ = maximum_ = elapsed;
} else {
minimum_ = _min(minimum_, elapsed);
maximum_ = _max(maximum_, elapsed);
}
// Online variance and mean algorithm: http://en.wikipedia.org/wiki/
// Algorithms_for_calculating_variance#Online_algorithm
++event_count_;
double delta = elapsed - mean_;
mean_ = mean_ + delta / event_count_;
sum_of_squared_differences_ += delta * (elapsed - mean_);
}
}
void ProfilerEvent::Stop() {
Stop(TimeNanos());
}
double ProfilerEvent::standard_deviation() const {
if (event_count_ <= 1) return 0.0;
return sqrt(sum_of_squared_differences_ / (event_count_ - 1.0));
}
Profiler* Profiler::Instance() {
LIBJINGLE_DEFINE_STATIC_LOCAL(Profiler, instance, ());
return &instance;
}
void Profiler::StartEvent(const std::string& event_name) {
lock_.LockShared();
EventMap::iterator it = events_.find(event_name);
bool needs_insert = (it == events_.end());
lock_.UnlockShared();
if (needs_insert) {
// Need an exclusive lock to modify the map.
ExclusiveScope scope(&lock_);
it = events_.insert(
EventMap::value_type(event_name, ProfilerEvent())).first;
}
it->second.Start();
}
void Profiler::StopEvent(const std::string& event_name) {
// Get the time ASAP, then wait for the lock.
uint64 stop_time = TimeNanos();
SharedScope scope(&lock_);
EventMap::iterator it = events_.find(event_name);
if (it != events_.end()) {
it->second.Stop(stop_time);
}
}
void Profiler::ReportToLog(const char* file, int line,
LoggingSeverity severity_to_use,
const std::string& event_prefix) {
if (!LogMessage::Loggable(severity_to_use)) {
return;
}
SharedScope scope(&lock_);
{ // Output first line.
LogMessage msg(file, line, severity_to_use);
msg.stream() << "=== Profile report ";
if (event_prefix.empty()) {
msg.stream() << "(prefix: '" << event_prefix << "') ";
}
msg.stream() << "===";
}
for (EventMap::const_iterator it = events_.begin();
it != events_.end(); ++it) {
if (event_prefix.empty() || it->first.find(event_prefix) == 0) {
LogMessage(file, line, severity_to_use).stream()
<< it->first << " " << it->second;
}
}
LogMessage(file, line, severity_to_use).stream()
<< "=== End profile report ===";
}
void Profiler::ReportAllToLog(const char* file, int line,
LoggingSeverity severity_to_use) {
ReportToLog(file, line, severity_to_use, "");
}
const ProfilerEvent* Profiler::GetEvent(const std::string& event_name) const {
SharedScope scope(&lock_);
EventMap::const_iterator it =
events_.find(event_name);
return (it == events_.end()) ? NULL : &it->second;
}
bool Profiler::Clear() {
ExclusiveScope scope(&lock_);
bool result = true;
// Clear all events that aren't started.
EventMap::iterator it = events_.begin();
while (it != events_.end()) {
if (it->second.is_started()) {
++it; // Can't clear started events.
result = false;
} else {
events_.erase(it++);
}
}
return result;
}
std::ostream& operator<<(std::ostream& stream,
const ProfilerEvent& profiler_event) {
stream << "count=" << profiler_event.event_count()
<< " total=" << FormattedTime(profiler_event.total_time())
<< " mean=" << FormattedTime(profiler_event.mean())
<< " min=" << FormattedTime(profiler_event.minimum())
<< " max=" << FormattedTime(profiler_event.maximum())
<< " sd=" << profiler_event.standard_deviation();
return stream;
}
} // namespace talk_base
|
