OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved. | 2 * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 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 | 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 | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
11 #include "webrtc/modules/video_coding/codec_timer.h" | 11 #include "webrtc/modules/video_coding/codec_timer.h" |
12 | 12 |
13 #include <assert.h> | |
14 | |
15 namespace webrtc { | 13 namespace webrtc { |
16 | 14 |
| 15 namespace { |
| 16 |
17 // The first kIgnoredSampleCount samples will be ignored. | 17 // The first kIgnoredSampleCount samples will be ignored. |
18 static const int32_t kIgnoredSampleCount = 5; | 18 const int kIgnoredSampleCount = 5; |
| 19 // Return the |kPercentile| value in RequiredDecodeTimeMs(). |
| 20 const float kPercentile = 0.95f; |
| 21 // The window size in ms. |
| 22 const int64_t kTimeLimitMs = 10000; |
19 | 23 |
20 VCMCodecTimer::VCMCodecTimer() | 24 } // anonymous namespace |
21 : _filteredMax(0), _ignoredSampleCount(0), _shortMax(0), _history() { | 25 |
22 Reset(); | 26 VCMCodecTimer::VCMCodecTimer() : ignoredSampleCount_(0), filter_(kPercentile) {} |
| 27 |
| 28 void VCMCodecTimer::Reset() { |
| 29 ignoredSampleCount_ = 0; |
| 30 while (!history_.empty()) |
| 31 history_.pop(); |
| 32 filter_.Clear(); |
23 } | 33 } |
24 | 34 |
25 void VCMCodecTimer::Reset() { | 35 void VCMCodecTimer::AddTiming(int64_t decode_time_ms, int64_t now_ms) { |
26 _filteredMax = 0; | 36 // Ignore the first |kIgnoredSampleCount| samples. |
27 _ignoredSampleCount = 0; | 37 if (ignoredSampleCount_ < kIgnoredSampleCount) { |
28 _shortMax = 0; | 38 ++ignoredSampleCount_; |
29 for (int i = 0; i < MAX_HISTORY_SIZE; i++) { | 39 return; |
30 _history[i].shortMax = 0; | 40 } |
31 _history[i].timeMs = -1; | 41 |
| 42 // Insert new decode time value. |
| 43 filter_.Insert(decode_time_ms); |
| 44 history_.emplace(decode_time_ms, now_ms); |
| 45 |
| 46 // Pop old decode time values. |
| 47 while (!history_.empty() && |
| 48 now_ms - history_.front().sample_time_ms > kTimeLimitMs) { |
| 49 filter_.Erase(history_.front().decode_time_ms); |
| 50 history_.pop(); |
32 } | 51 } |
33 } | 52 } |
34 | 53 |
35 // Update the max-value filter | 54 // Get the 95th percentile observed decode time within a time window. |
36 void VCMCodecTimer::MaxFilter(int32_t decodeTime, int64_t nowMs) { | 55 int64_t VCMCodecTimer::RequiredDecodeTimeMs() const { |
37 if (_ignoredSampleCount >= kIgnoredSampleCount) { | 56 return filter_.GetPercentileValue(); |
38 UpdateMaxHistory(decodeTime, nowMs); | |
39 ProcessHistory(nowMs); | |
40 } else { | |
41 _ignoredSampleCount++; | |
42 } | |
43 } | 57 } |
44 | 58 |
45 void VCMCodecTimer::UpdateMaxHistory(int32_t decodeTime, int64_t now) { | 59 VCMCodecTimer::Sample::Sample(int64_t decode_time_ms, int64_t sample_time_ms) |
46 if (_history[0].timeMs >= 0 && now - _history[0].timeMs < SHORT_FILTER_MS) { | 60 : decode_time_ms(decode_time_ms), sample_time_ms(sample_time_ms) {} |
47 if (decodeTime > _shortMax) { | |
48 _shortMax = decodeTime; | |
49 } | |
50 } else { | |
51 // Only add a new value to the history once a second | |
52 if (_history[0].timeMs == -1) { | |
53 // First, no shift | |
54 _shortMax = decodeTime; | |
55 } else { | |
56 // Shift | |
57 for (int i = (MAX_HISTORY_SIZE - 2); i >= 0; i--) { | |
58 _history[i + 1].shortMax = _history[i].shortMax; | |
59 _history[i + 1].timeMs = _history[i].timeMs; | |
60 } | |
61 } | |
62 if (_shortMax == 0) { | |
63 _shortMax = decodeTime; | |
64 } | |
65 | 61 |
66 _history[0].shortMax = _shortMax; | |
67 _history[0].timeMs = now; | |
68 _shortMax = 0; | |
69 } | |
70 } | |
71 | |
72 void VCMCodecTimer::ProcessHistory(int64_t nowMs) { | |
73 _filteredMax = _shortMax; | |
74 if (_history[0].timeMs == -1) { | |
75 return; | |
76 } | |
77 for (int i = 0; i < MAX_HISTORY_SIZE; i++) { | |
78 if (_history[i].timeMs == -1) { | |
79 break; | |
80 } | |
81 if (nowMs - _history[i].timeMs > MAX_HISTORY_SIZE * SHORT_FILTER_MS) { | |
82 // This sample (and all samples after this) is too old | |
83 break; | |
84 } | |
85 if (_history[i].shortMax > _filteredMax) { | |
86 // This sample is the largest one this far into the history | |
87 _filteredMax = _history[i].shortMax; | |
88 } | |
89 } | |
90 } | |
91 | |
92 // Get the maximum observed time within a time window | |
93 int32_t VCMCodecTimer::RequiredDecodeTimeMs(FrameType /*frameType*/) const { | |
94 return _filteredMax; | |
95 } | |
96 } // namespace webrtc | 62 } // namespace webrtc |
OLD | NEW |