blob: 4e034e63a05a08ea9ba7145354512e9d505516dd [file] [log] [blame]
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +00001/*
2 * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020011#include "modules/audio_coding/neteq/statistics_calculator.h"
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +000012
13#include <assert.h>
pbos@webrtc.org12dc1a32013-08-05 16:22:53 +000014#include <string.h> // memset
Henrik Lundin1bb8cf82015-08-25 13:08:04 +020015#include <algorithm>
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +000016
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020017#include "modules/audio_coding/neteq/delay_manager.h"
18#include "rtc_base/checks.h"
19#include "rtc_base/safe_conversions.h"
20#include "system_wrappers/include/metrics.h"
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +000021
22namespace webrtc {
23
henrik.lundin2979f552017-05-05 05:04:16 -070024namespace {
25size_t AddIntToSizeTWithLowerCap(int a, size_t b) {
26 const size_t ret = b + a;
27 // If a + b is negative, resulting in a negative wrap, cap it to zero instead.
28 static_assert(sizeof(size_t) >= sizeof(int),
29 "int must not be wider than size_t for this to work");
30 return (a < 0 && ret > b) ? 0 : ret;
31}
32} // namespace
33
henrikg91d6ede2015-09-17 00:24:34 -070034// Allocating the static const so that it can be passed by reference to
35// RTC_DCHECK.
Henrik Lundin1bb8cf82015-08-25 13:08:04 +020036const size_t StatisticsCalculator::kLenWaitingTimes;
37
Henrik Lundin1f4ffe02015-08-19 10:46:50 +020038StatisticsCalculator::PeriodicUmaLogger::PeriodicUmaLogger(
39 const std::string& uma_name,
40 int report_interval_ms,
41 int max_value)
42 : uma_name_(uma_name),
43 report_interval_ms_(report_interval_ms),
44 max_value_(max_value),
45 timer_(0) {
46}
47
48StatisticsCalculator::PeriodicUmaLogger::~PeriodicUmaLogger() = default;
49
50void StatisticsCalculator::PeriodicUmaLogger::AdvanceClock(int step_ms) {
51 timer_ += step_ms;
52 if (timer_ < report_interval_ms_) {
53 return;
54 }
55 LogToUma(Metric());
56 Reset();
57 timer_ -= report_interval_ms_;
henrikg91d6ede2015-09-17 00:24:34 -070058 RTC_DCHECK_GE(timer_, 0);
Henrik Lundin1f4ffe02015-08-19 10:46:50 +020059}
60
61void StatisticsCalculator::PeriodicUmaLogger::LogToUma(int value) const {
asapersson53805322015-12-21 01:46:20 -080062 RTC_HISTOGRAM_COUNTS_SPARSE(uma_name_, value, 1, max_value_, 50);
Henrik Lundin1f4ffe02015-08-19 10:46:50 +020063}
64
65StatisticsCalculator::PeriodicUmaCount::PeriodicUmaCount(
66 const std::string& uma_name,
67 int report_interval_ms,
68 int max_value)
69 : PeriodicUmaLogger(uma_name, report_interval_ms, max_value) {
70}
71
72StatisticsCalculator::PeriodicUmaCount::~PeriodicUmaCount() {
73 // Log the count for the current (incomplete) interval.
74 LogToUma(Metric());
75}
76
77void StatisticsCalculator::PeriodicUmaCount::RegisterSample() {
78 ++counter_;
79}
80
81int StatisticsCalculator::PeriodicUmaCount::Metric() const {
82 return counter_;
83}
84
85void StatisticsCalculator::PeriodicUmaCount::Reset() {
86 counter_ = 0;
87}
88
89StatisticsCalculator::PeriodicUmaAverage::PeriodicUmaAverage(
90 const std::string& uma_name,
91 int report_interval_ms,
92 int max_value)
93 : PeriodicUmaLogger(uma_name, report_interval_ms, max_value) {
94}
95
96StatisticsCalculator::PeriodicUmaAverage::~PeriodicUmaAverage() {
97 // Log the average for the current (incomplete) interval.
98 LogToUma(Metric());
99}
100
101void StatisticsCalculator::PeriodicUmaAverage::RegisterSample(int value) {
102 sum_ += value;
103 ++counter_;
104}
105
106int StatisticsCalculator::PeriodicUmaAverage::Metric() const {
henrik.lundine5942132016-02-09 00:35:53 -0800107 return counter_ == 0 ? 0 : static_cast<int>(sum_ / counter_);
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200108}
109
110void StatisticsCalculator::PeriodicUmaAverage::Reset() {
111 sum_ = 0.0;
112 counter_ = 0;
113}
114
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000115StatisticsCalculator::StatisticsCalculator()
116 : preemptive_samples_(0),
117 accelerate_samples_(0),
118 added_zero_samples_(0),
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000119 expanded_speech_samples_(0),
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000120 expanded_noise_samples_(0),
121 discarded_packets_(0),
122 lost_timestamps_(0),
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000123 timestamps_since_last_report_(0),
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200124 secondary_decoded_samples_(0),
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200125 discarded_secondary_packets_(0),
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200126 delayed_packet_outage_counter_(
127 "WebRTC.Audio.DelayedPacketOutageEventsPerMinute",
128 60000, // 60 seconds report interval.
129 100),
130 excess_buffer_delay_("WebRTC.Audio.AverageExcessBufferDelayMs",
131 60000, // 60 seconds report interval.
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200132 1000) {}
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000133
Henrik Lundin1bb8cf82015-08-25 13:08:04 +0200134StatisticsCalculator::~StatisticsCalculator() = default;
135
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000136void StatisticsCalculator::Reset() {
137 preemptive_samples_ = 0;
138 accelerate_samples_ = 0;
139 added_zero_samples_ = 0;
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000140 expanded_speech_samples_ = 0;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000141 expanded_noise_samples_ = 0;
minyue@webrtc.org2c1bcf22015-02-17 10:17:09 +0000142 secondary_decoded_samples_ = 0;
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200143 discarded_secondary_packets_ = 0;
Henrik Lundin1bb8cf82015-08-25 13:08:04 +0200144 waiting_times_.clear();
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000145}
146
147void StatisticsCalculator::ResetMcu() {
148 discarded_packets_ = 0;
149 lost_timestamps_ = 0;
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000150 timestamps_since_last_report_ = 0;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000151}
152
Gustaf Ullberg9a2e9062017-09-18 09:28:20 +0200153void StatisticsCalculator::ExpandedVoiceSamples(size_t num_samples,
154 bool is_new_concealment_event) {
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000155 expanded_speech_samples_ += num_samples;
Henrik Lundinac0a5032017-09-25 12:22:46 +0200156 ConcealedSamplesCorrection(num_samples);
Gustaf Ullberg9a2e9062017-09-18 09:28:20 +0200157 lifetime_stats_.concealment_events += is_new_concealment_event;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000158}
159
Gustaf Ullberg9a2e9062017-09-18 09:28:20 +0200160void StatisticsCalculator::ExpandedNoiseSamples(size_t num_samples,
161 bool is_new_concealment_event) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000162 expanded_noise_samples_ += num_samples;
Henrik Lundinac0a5032017-09-25 12:22:46 +0200163 ConcealedSamplesCorrection(num_samples);
Gustaf Ullberg9a2e9062017-09-18 09:28:20 +0200164 lifetime_stats_.concealment_events += is_new_concealment_event;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000165}
166
henrik.lundin2979f552017-05-05 05:04:16 -0700167void StatisticsCalculator::ExpandedVoiceSamplesCorrection(int num_samples) {
168 expanded_speech_samples_ =
169 AddIntToSizeTWithLowerCap(num_samples, expanded_speech_samples_);
Henrik Lundinac0a5032017-09-25 12:22:46 +0200170 ConcealedSamplesCorrection(num_samples);
henrik.lundin2979f552017-05-05 05:04:16 -0700171}
172
173void StatisticsCalculator::ExpandedNoiseSamplesCorrection(int num_samples) {
174 expanded_noise_samples_ =
175 AddIntToSizeTWithLowerCap(num_samples, expanded_noise_samples_);
Henrik Lundinac0a5032017-09-25 12:22:46 +0200176 ConcealedSamplesCorrection(num_samples);
177}
178
179void StatisticsCalculator::ConcealedSamplesCorrection(int num_samples) {
180 if (num_samples < 0) {
181 // Store negative correction to subtract from future positive additions.
182 // See also the function comment in the header file.
183 concealed_samples_correction_ -= num_samples;
184 return;
185 }
186
187 const size_t canceled_out =
188 std::min(static_cast<size_t>(num_samples), concealed_samples_correction_);
189 concealed_samples_correction_ -= canceled_out;
190 lifetime_stats_.concealed_samples += num_samples - canceled_out;
henrik.lundin2979f552017-05-05 05:04:16 -0700191}
192
Peter Kastingdce40cf2015-08-24 14:52:23 -0700193void StatisticsCalculator::PreemptiveExpandedSamples(size_t num_samples) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000194 preemptive_samples_ += num_samples;
195}
196
Peter Kastingdce40cf2015-08-24 14:52:23 -0700197void StatisticsCalculator::AcceleratedSamples(size_t num_samples) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000198 accelerate_samples_ += num_samples;
199}
200
Peter Kastingdce40cf2015-08-24 14:52:23 -0700201void StatisticsCalculator::AddZeros(size_t num_samples) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000202 added_zero_samples_ += num_samples;
203}
204
Peter Kastingdce40cf2015-08-24 14:52:23 -0700205void StatisticsCalculator::PacketsDiscarded(size_t num_packets) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000206 discarded_packets_ += num_packets;
207}
208
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200209void StatisticsCalculator::SecondaryPacketsDiscarded(size_t num_packets) {
210 discarded_secondary_packets_ += num_packets;
211}
212
Peter Kastingdce40cf2015-08-24 14:52:23 -0700213void StatisticsCalculator::LostSamples(size_t num_samples) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000214 lost_timestamps_ += num_samples;
215}
216
Peter Kastingdce40cf2015-08-24 14:52:23 -0700217void StatisticsCalculator::IncreaseCounter(size_t num_samples, int fs_hz) {
218 const int time_step_ms =
219 rtc::CheckedDivExact(static_cast<int>(1000 * num_samples), fs_hz);
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200220 delayed_packet_outage_counter_.AdvanceClock(time_step_ms);
221 excess_buffer_delay_.AdvanceClock(time_step_ms);
Peter Kastingb7e50542015-06-11 12:55:50 -0700222 timestamps_since_last_report_ += static_cast<uint32_t>(num_samples);
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000223 if (timestamps_since_last_report_ >
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000224 static_cast<uint32_t>(fs_hz * kMaxReportPeriod)) {
225 lost_timestamps_ = 0;
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000226 timestamps_since_last_report_ = 0;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000227 discarded_packets_ = 0;
228 }
Steve Anton2dbc69f2017-08-24 17:15:13 -0700229 lifetime_stats_.total_samples_received += num_samples;
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000230}
231
minyue@webrtc.org2c1bcf22015-02-17 10:17:09 +0000232void StatisticsCalculator::SecondaryDecodedSamples(int num_samples) {
233 secondary_decoded_samples_ += num_samples;
234}
235
Henrik Lundinbef77e22015-08-18 14:58:09 +0200236void StatisticsCalculator::LogDelayedPacketOutageEvent(int outage_duration_ms) {
asaperssona2c58e22016-03-07 01:52:59 -0800237 RTC_HISTOGRAM_COUNTS("WebRTC.Audio.DelayedPacketOutageEventMs",
238 outage_duration_ms, 1 /* min */, 2000 /* max */,
239 100 /* bucket count */);
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200240 delayed_packet_outage_counter_.RegisterSample();
Henrik Lundinbef77e22015-08-18 14:58:09 +0200241}
242
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000243void StatisticsCalculator::StoreWaitingTime(int waiting_time_ms) {
Henrik Lundin1f4ffe02015-08-19 10:46:50 +0200244 excess_buffer_delay_.RegisterSample(waiting_time_ms);
henrikg91d6ede2015-09-17 00:24:34 -0700245 RTC_DCHECK_LE(waiting_times_.size(), kLenWaitingTimes);
henrik.lundin1e346b22015-08-27 13:41:02 -0700246 if (waiting_times_.size() == kLenWaitingTimes) {
Henrik Lundin1bb8cf82015-08-25 13:08:04 +0200247 // Erase first value.
248 waiting_times_.pop_front();
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000249 }
Henrik Lundin1bb8cf82015-08-25 13:08:04 +0200250 waiting_times_.push_back(waiting_time_ms);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000251}
252
253void StatisticsCalculator::GetNetworkStatistics(
254 int fs_hz,
Peter Kastingdce40cf2015-08-24 14:52:23 -0700255 size_t num_samples_in_buffers,
256 size_t samples_per_packet,
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000257 NetEqNetworkStatistics *stats) {
Henrik Lundindccfc402017-09-25 12:30:58 +0200258 RTC_DCHECK_GT(fs_hz, 0);
259 RTC_DCHECK(stats);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000260
261 stats->added_zero_samples = added_zero_samples_;
Peter Kastingb7e50542015-06-11 12:55:50 -0700262 stats->current_buffer_size_ms =
263 static_cast<uint16_t>(num_samples_in_buffers * 1000 / fs_hz);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000264
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000265 stats->packet_loss_rate =
266 CalculateQ14Ratio(lost_timestamps_, timestamps_since_last_report_);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000267
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000268 stats->accelerate_rate =
269 CalculateQ14Ratio(accelerate_samples_, timestamps_since_last_report_);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000270
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000271 stats->preemptive_rate =
272 CalculateQ14Ratio(preemptive_samples_, timestamps_since_last_report_);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000273
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000274 stats->expand_rate =
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000275 CalculateQ14Ratio(expanded_speech_samples_ + expanded_noise_samples_,
henrik.lundin@webrtc.org5e3d7c72014-10-08 12:10:53 +0000276 timestamps_since_last_report_);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000277
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000278 stats->speech_expand_rate =
279 CalculateQ14Ratio(expanded_speech_samples_,
Peter Kasting728d9032015-06-11 14:31:38 -0700280 timestamps_since_last_report_);
minyue@webrtc.org7d721ee2015-02-18 10:01:53 +0000281
minyue@webrtc.org2c1bcf22015-02-17 10:17:09 +0000282 stats->secondary_decoded_rate =
283 CalculateQ14Ratio(secondary_decoded_samples_,
284 timestamps_since_last_report_);
285
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200286 const size_t discarded_secondary_samples =
287 discarded_secondary_packets_ * samples_per_packet;
288 stats->secondary_discarded_rate = CalculateQ14Ratio(
289 discarded_secondary_samples,
lliuuff2824b2017-08-28 13:01:45 -0700290 static_cast<uint32_t>(discarded_secondary_samples +
291 secondary_decoded_samples_));
minyue-webrtc0c3ca752017-08-23 15:59:38 +0200292
Henrik Lundin1bb8cf82015-08-25 13:08:04 +0200293 if (waiting_times_.size() == 0) {
294 stats->mean_waiting_time_ms = -1;
295 stats->median_waiting_time_ms = -1;
296 stats->min_waiting_time_ms = -1;
297 stats->max_waiting_time_ms = -1;
298 } else {
299 std::sort(waiting_times_.begin(), waiting_times_.end());
300 // Find mid-point elements. If the size is odd, the two values
301 // |middle_left| and |middle_right| will both be the one middle element; if
302 // the size is even, they will be the the two neighboring elements at the
303 // middle of the list.
304 const int middle_left = waiting_times_[(waiting_times_.size() - 1) / 2];
305 const int middle_right = waiting_times_[waiting_times_.size() / 2];
306 // Calculate the average of the two. (Works also for odd sizes.)
307 stats->median_waiting_time_ms = (middle_left + middle_right) / 2;
308 stats->min_waiting_time_ms = waiting_times_.front();
309 stats->max_waiting_time_ms = waiting_times_.back();
310 double sum = 0;
311 for (auto time : waiting_times_) {
312 sum += time;
313 }
314 stats->mean_waiting_time_ms = static_cast<int>(sum / waiting_times_.size());
315 }
316
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000317 // Reset counters.
318 ResetMcu();
319 Reset();
320}
321
Henrik Lundindccfc402017-09-25 12:30:58 +0200322void StatisticsCalculator::PopulateDelayManagerStats(
323 int ms_per_packet,
324 const DelayManager& delay_manager,
325 NetEqNetworkStatistics* stats) {
326 RTC_DCHECK(stats);
327 stats->preferred_buffer_size_ms =
328 (delay_manager.TargetLevel() >> 8) * ms_per_packet;
329 stats->jitter_peaks_found = delay_manager.PeakFound();
330 stats->clockdrift_ppm =
331 rtc::saturated_cast<int32_t>(delay_manager.EstimatedClockDriftPpm());
332}
333
Steve Anton2dbc69f2017-08-24 17:15:13 -0700334NetEqLifetimeStatistics StatisticsCalculator::GetLifetimeStatistics() const {
335 return lifetime_stats_;
336}
337
Peter Kastingdce40cf2015-08-24 14:52:23 -0700338uint16_t StatisticsCalculator::CalculateQ14Ratio(size_t numerator,
Peter Kastingb7e50542015-06-11 12:55:50 -0700339 uint32_t denominator) {
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000340 if (numerator == 0) {
341 return 0;
342 } else if (numerator < denominator) {
343 // Ratio must be smaller than 1 in Q14.
344 assert((numerator << 14) / denominator < (1 << 14));
Peter Kastingb7e50542015-06-11 12:55:50 -0700345 return static_cast<uint16_t>((numerator << 14) / denominator);
henrik.lundin@webrtc.orgd94659d2013-01-29 12:09:21 +0000346 } else {
347 // Will not produce a ratio larger than 1, since this is probably an error.
348 return 1 << 14;
349 }
350}
351
352} // namespace webrtc