henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2012 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 | |
| 11 | // Unit tests for DelayManager class. |
| 12 | |
Mirko Bonadei | 92ea95e | 2017-09-15 06:47:31 +0200 | [diff] [blame] | 13 | #include "modules/audio_coding/neteq/delay_manager.h" |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 14 | |
| 15 | #include <math.h> |
| 16 | |
Mirko Bonadei | 317a1f0 | 2019-09-17 17:06:18 +0200 | [diff] [blame] | 17 | #include <memory> |
| 18 | |
Jakob Ivarsson | 7dff9f3 | 2020-11-11 15:26:10 +0100 | [diff] [blame] | 19 | #include "absl/types/optional.h" |
Jakob Ivarsson | 1eb3d7e | 2019-02-21 15:42:31 +0100 | [diff] [blame] | 20 | #include "modules/audio_coding/neteq/histogram.h" |
Jakob Ivarsson | 1eb3d7e | 2019-02-21 15:42:31 +0100 | [diff] [blame] | 21 | #include "modules/audio_coding/neteq/mock/mock_histogram.h" |
Jakob Ivarsson | 4450708 | 2019-03-05 16:59:03 +0100 | [diff] [blame] | 22 | #include "modules/audio_coding/neteq/mock/mock_statistics_calculator.h" |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 23 | #include "rtc_base/checks.h" |
Minyue Li | 002fbb8 | 2018-10-04 11:31:03 +0200 | [diff] [blame] | 24 | #include "test/field_trial.h" |
Mirko Bonadei | 92ea95e | 2017-09-15 06:47:31 +0200 | [diff] [blame] | 25 | #include "test/gmock.h" |
| 26 | #include "test/gtest.h" |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 27 | |
| 28 | namespace webrtc { |
| 29 | |
Jakob Ivarsson | db42ed2 | 2019-02-27 10:08:09 +0100 | [diff] [blame] | 30 | namespace { |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 31 | constexpr int kMaxNumberOfPackets = 200; |
Jakob Ivarsson | db42ed2 | 2019-02-27 10:08:09 +0100 | [diff] [blame] | 32 | constexpr int kTimeStepMs = 10; |
| 33 | constexpr int kFs = 8000; |
| 34 | constexpr int kFrameSizeMs = 20; |
| 35 | constexpr int kTsIncrement = kFrameSizeMs * kFs / 1000; |
| 36 | constexpr int kMaxBufferSizeMs = kMaxNumberOfPackets * kFrameSizeMs; |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 37 | |
Jakob Ivarsson | db42ed2 | 2019-02-27 10:08:09 +0100 | [diff] [blame] | 38 | } // namespace |
| 39 | |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 40 | class DelayManagerTest : public ::testing::Test { |
| 41 | protected: |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 42 | DelayManagerTest(); |
| 43 | virtual void SetUp(); |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 44 | absl::optional<int> InsertNextPacket(); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 45 | void IncreaseTime(int inc_ms); |
| 46 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 47 | DelayManager dm_; |
henrik.lundin | f393370 | 2016-04-28 01:53:52 -0700 | [diff] [blame] | 48 | TickTimer tick_timer_; |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 49 | uint32_t ts_; |
| 50 | }; |
| 51 | |
| 52 | DelayManagerTest::DelayManagerTest() |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 53 | : dm_(DelayManager::Config(), &tick_timer_), ts_(0x12345678) {} |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 54 | |
| 55 | void DelayManagerTest::SetUp() { |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 56 | dm_.SetPacketAudioLength(kFrameSizeMs); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 57 | } |
| 58 | |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 59 | absl::optional<int> DelayManagerTest::InsertNextPacket() { |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 60 | auto relative_delay = dm_.Update(ts_, kFs); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 61 | ts_ += kTsIncrement; |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 62 | return relative_delay; |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 63 | } |
| 64 | |
| 65 | void DelayManagerTest::IncreaseTime(int inc_ms) { |
| 66 | for (int t = 0; t < inc_ms; t += kTimeStepMs) { |
henrik.lundin | f393370 | 2016-04-28 01:53:52 -0700 | [diff] [blame] | 67 | tick_timer_.Increment(); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 68 | } |
| 69 | } |
Ruslan Burakov | 1e193fa | 2019-05-15 14:31:22 +0200 | [diff] [blame] | 70 | |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 71 | TEST_F(DelayManagerTest, CreateAndDestroy) { |
| 72 | // Nothing to do here. The test fixture creates and destroys the DelayManager |
| 73 | // object. |
| 74 | } |
| 75 | |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 76 | TEST_F(DelayManagerTest, UpdateNormal) { |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 77 | // First packet arrival. |
| 78 | InsertNextPacket(); |
| 79 | // Advance time by one frame size. |
| 80 | IncreaseTime(kFrameSizeMs); |
| 81 | // Second packet arrival. |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 82 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 83 | EXPECT_EQ(20, dm_.TargetDelayMs()); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 84 | } |
| 85 | |
| 86 | TEST_F(DelayManagerTest, UpdateLongInterArrivalTime) { |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 87 | // First packet arrival. |
| 88 | InsertNextPacket(); |
| 89 | // Advance time by two frame size. |
| 90 | IncreaseTime(2 * kFrameSizeMs); |
| 91 | // Second packet arrival. |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 92 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 93 | EXPECT_EQ(40, dm_.TargetDelayMs()); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 94 | } |
| 95 | |
Niels Möller | 18f1adc | 2018-08-23 08:40:41 +0200 | [diff] [blame] | 96 | TEST_F(DelayManagerTest, MaxDelay) { |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 97 | const int kExpectedTarget = 5 * kFrameSizeMs; |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 98 | // First packet arrival. |
| 99 | InsertNextPacket(); |
| 100 | // Second packet arrival. |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 101 | IncreaseTime(kExpectedTarget); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 102 | InsertNextPacket(); |
| 103 | |
| 104 | // No limit is set. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 105 | EXPECT_EQ(kExpectedTarget, dm_.TargetDelayMs()); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 106 | |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 107 | const int kMaxDelayMs = 3 * kFrameSizeMs; |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 108 | EXPECT_TRUE(dm_.SetMaximumDelay(kMaxDelayMs)); |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 109 | IncreaseTime(kFrameSizeMs); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 110 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 111 | EXPECT_EQ(kMaxDelayMs, dm_.TargetDelayMs()); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 112 | |
| 113 | // Target level at least should be one packet. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 114 | EXPECT_FALSE(dm_.SetMaximumDelay(kFrameSizeMs - 1)); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 115 | } |
| 116 | |
Niels Möller | 18f1adc | 2018-08-23 08:40:41 +0200 | [diff] [blame] | 117 | TEST_F(DelayManagerTest, MinDelay) { |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 118 | const int kExpectedTarget = 5 * kFrameSizeMs; |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 119 | // First packet arrival. |
| 120 | InsertNextPacket(); |
| 121 | // Second packet arrival. |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 122 | IncreaseTime(kExpectedTarget); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 123 | InsertNextPacket(); |
| 124 | |
| 125 | // No limit is applied. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 126 | EXPECT_EQ(kExpectedTarget, dm_.TargetDelayMs()); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 127 | |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 128 | int kMinDelayMs = 7 * kFrameSizeMs; |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 129 | dm_.SetMinimumDelay(kMinDelayMs); |
Jakob Ivarsson | 507f434 | 2019-09-03 13:04:41 +0200 | [diff] [blame] | 130 | IncreaseTime(kFrameSizeMs); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 131 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 132 | EXPECT_EQ(kMinDelayMs, dm_.TargetDelayMs()); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 133 | } |
| 134 | |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 135 | TEST_F(DelayManagerTest, BaseMinimumDelayCheckValidRange) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 136 | // Base minimum delay should be between [0, 10000] milliseconds. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 137 | EXPECT_FALSE(dm_.SetBaseMinimumDelay(-1)); |
| 138 | EXPECT_FALSE(dm_.SetBaseMinimumDelay(10001)); |
| 139 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), 0); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 140 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 141 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(7999)); |
| 142 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), 7999); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 143 | } |
| 144 | |
| 145 | TEST_F(DelayManagerTest, BaseMinimumDelayLowerThanMinimumDelay) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 146 | constexpr int kBaseMinimumDelayMs = 100; |
| 147 | constexpr int kMinimumDelayMs = 200; |
| 148 | |
| 149 | // Base minimum delay sets lower bound on minimum. That is why when base |
| 150 | // minimum delay is lower than minimum delay we use minimum delay. |
| 151 | RTC_DCHECK_LT(kBaseMinimumDelayMs, kMinimumDelayMs); |
| 152 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 153 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 154 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 155 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 156 | } |
| 157 | |
| 158 | TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanMinimumDelay) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 159 | constexpr int kBaseMinimumDelayMs = 70; |
| 160 | constexpr int kMinimumDelayMs = 30; |
| 161 | |
| 162 | // Base minimum delay sets lower bound on minimum. That is why when base |
| 163 | // minimum delay is greater than minimum delay we use base minimum delay. |
| 164 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs); |
| 165 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 166 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 167 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 168 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 169 | } |
| 170 | |
| 171 | TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanBufferSize) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 172 | constexpr int kBaseMinimumDelayMs = kMaxBufferSizeMs + 1; |
| 173 | constexpr int kMinimumDelayMs = 12; |
Ruslan Burakov | b35bacc | 2019-02-20 13:41:59 +0100 | [diff] [blame] | 174 | constexpr int kMaximumDelayMs = 20; |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 175 | constexpr int kMaxBufferSizeMsQ75 = 3 * kMaxBufferSizeMs / 4; |
| 176 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 177 | EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs)); |
Ruslan Burakov | b35bacc | 2019-02-20 13:41:59 +0100 | [diff] [blame] | 178 | |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 179 | // Base minimum delay is greater than minimum delay, that is why we clamp |
| 180 | // it to current the highest possible value which is maximum delay. |
| 181 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs); |
| 182 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaxBufferSizeMs); |
Ruslan Burakov | b35bacc | 2019-02-20 13:41:59 +0100 | [diff] [blame] | 183 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaximumDelayMs); |
| 184 | RTC_DCHECK_LT(kMaximumDelayMs, kMaxBufferSizeMsQ75); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 185 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 186 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 187 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 188 | |
| 189 | // Unset maximum value. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 190 | EXPECT_TRUE(dm_.SetMaximumDelay(0)); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 191 | |
| 192 | // With maximum value unset, the highest possible value now is 75% of |
| 193 | // currently possible maximum buffer size. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 194 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMaxBufferSizeMsQ75); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 195 | } |
| 196 | |
| 197 | TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanMaximumDelay) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 198 | constexpr int kMaximumDelayMs = 400; |
| 199 | constexpr int kBaseMinimumDelayMs = kMaximumDelayMs + 1; |
| 200 | constexpr int kMinimumDelayMs = 20; |
| 201 | |
| 202 | // Base minimum delay is greater than minimum delay, that is why we clamp |
| 203 | // it to current the highest possible value which is kMaximumDelayMs. |
| 204 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs); |
| 205 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaximumDelayMs); |
| 206 | RTC_DCHECK_LT(kMaximumDelayMs, kMaxBufferSizeMs); |
| 207 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 208 | EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs)); |
| 209 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 210 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 211 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMaximumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 212 | } |
| 213 | |
| 214 | TEST_F(DelayManagerTest, BaseMinimumDelayLowerThanMaxSize) { |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 215 | constexpr int kMaximumDelayMs = 400; |
| 216 | constexpr int kBaseMinimumDelayMs = kMaximumDelayMs - 1; |
| 217 | constexpr int kMinimumDelayMs = 20; |
| 218 | |
| 219 | // Base minimum delay is greater than minimum delay, and lower than maximum |
| 220 | // delays that is why it is used. |
| 221 | RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs); |
| 222 | RTC_DCHECK_LT(kBaseMinimumDelayMs, kMaximumDelayMs); |
| 223 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 224 | EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs)); |
| 225 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 226 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 227 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 228 | } |
| 229 | |
| 230 | TEST_F(DelayManagerTest, MinimumDelayMemorization) { |
| 231 | // Check that when we increase base minimum delay to value higher than |
| 232 | // minimum delay then minimum delay is still memorized. This allows to |
| 233 | // restore effective minimum delay to memorized minimum delay value when we |
| 234 | // decrease base minimum delay. |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 235 | constexpr int kBaseMinimumDelayMsLow = 10; |
| 236 | constexpr int kMinimumDelayMs = 20; |
| 237 | constexpr int kBaseMinimumDelayMsHigh = 30; |
| 238 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 239 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsLow)); |
| 240 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 241 | // Minimum delay is used as it is higher than base minimum delay. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 242 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 243 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 244 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsHigh)); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 245 | // Base minimum delay is used as it is now higher than minimum delay. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 246 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMsHigh); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 247 | |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 248 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsLow)); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 249 | // Check that minimum delay is memorized and is used again. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 250 | EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 251 | } |
| 252 | |
| 253 | TEST_F(DelayManagerTest, BaseMinimumDelay) { |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 254 | const int kExpectedTarget = 5 * kFrameSizeMs; |
Jakob Ivarsson | b1ae5cc | 2020-10-06 15:37:28 +0000 | [diff] [blame] | 255 | // First packet arrival. |
| 256 | InsertNextPacket(); |
| 257 | // Second packet arrival. |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 258 | IncreaseTime(kExpectedTarget); |
Jakob Ivarsson | b1ae5cc | 2020-10-06 15:37:28 +0000 | [diff] [blame] | 259 | InsertNextPacket(); |
| 260 | |
| 261 | // No limit is applied. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 262 | EXPECT_EQ(kExpectedTarget, dm_.TargetDelayMs()); |
Jakob Ivarsson | ff9f646 | 2020-10-07 12:46:42 +0000 | [diff] [blame] | 263 | |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 264 | constexpr int kBaseMinimumDelayMs = 7 * kFrameSizeMs; |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 265 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 266 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs); |
Jakob Ivarsson | ff9f646 | 2020-10-07 12:46:42 +0000 | [diff] [blame] | 267 | |
| 268 | IncreaseTime(kFrameSizeMs); |
| 269 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 270 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs); |
| 271 | EXPECT_EQ(kBaseMinimumDelayMs, dm_.TargetDelayMs()); |
Jakob Ivarsson | ff9f646 | 2020-10-07 12:46:42 +0000 | [diff] [blame] | 272 | } |
| 273 | |
Jakob Ivarsson | 80fb978 | 2020-10-09 13:41:06 +0200 | [diff] [blame] | 274 | TEST_F(DelayManagerTest, BaseMinimumDelayAffectsTargetDelay) { |
Jakob Ivarsson | ff9f646 | 2020-10-07 12:46:42 +0000 | [diff] [blame] | 275 | const int kExpectedTarget = 5; |
| 276 | const int kTimeIncrement = kExpectedTarget * kFrameSizeMs; |
Jakob Ivarsson | ff9f646 | 2020-10-07 12:46:42 +0000 | [diff] [blame] | 277 | // First packet arrival. |
| 278 | InsertNextPacket(); |
| 279 | // Second packet arrival. |
| 280 | IncreaseTime(kTimeIncrement); |
| 281 | InsertNextPacket(); |
| 282 | |
| 283 | // No limit is applied. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 284 | EXPECT_EQ(kTimeIncrement, dm_.TargetDelayMs()); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 285 | |
| 286 | // Minimum delay is lower than base minimum delay, that is why base minimum |
| 287 | // delay is used to calculate target level. |
| 288 | constexpr int kMinimumDelayPackets = kExpectedTarget + 1; |
| 289 | constexpr int kBaseMinimumDelayPackets = kExpectedTarget + 2; |
| 290 | |
| 291 | constexpr int kMinimumDelayMs = kMinimumDelayPackets * kFrameSizeMs; |
| 292 | constexpr int kBaseMinimumDelayMs = kBaseMinimumDelayPackets * kFrameSizeMs; |
| 293 | |
| 294 | EXPECT_TRUE(kMinimumDelayMs < kBaseMinimumDelayMs); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 295 | EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs)); |
| 296 | EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs)); |
| 297 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 298 | |
Jakob Ivarsson | 507f434 | 2019-09-03 13:04:41 +0200 | [diff] [blame] | 299 | IncreaseTime(kFrameSizeMs); |
Ruslan Burakov | 4a68fb9 | 2019-02-13 14:25:39 +0100 | [diff] [blame] | 300 | InsertNextPacket(); |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 301 | EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs); |
| 302 | EXPECT_EQ(kBaseMinimumDelayMs, dm_.TargetDelayMs()); |
henrik.lundin | b8c55b1 | 2017-05-10 07:38:01 -0700 | [diff] [blame] | 303 | } |
| 304 | |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 305 | TEST_F(DelayManagerTest, Failures) { |
| 306 | // Wrong sample rate. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 307 | EXPECT_EQ(absl::nullopt, dm_.Update(0, -1)); |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 308 | // Wrong packet size. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 309 | EXPECT_EQ(-1, dm_.SetPacketAudioLength(0)); |
| 310 | EXPECT_EQ(-1, dm_.SetPacketAudioLength(-1)); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 311 | |
| 312 | // Minimum delay higher than a maximum delay is not accepted. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 313 | EXPECT_TRUE(dm_.SetMaximumDelay(20)); |
| 314 | EXPECT_FALSE(dm_.SetMinimumDelay(40)); |
turaj@webrtc.org | f1efc57 | 2013-08-16 23:44:24 +0000 | [diff] [blame] | 315 | |
| 316 | // Maximum delay less than minimum delay is not accepted. |
Jakob Ivarsson | 74158ff | 2021-09-07 14:24:56 +0200 | [diff] [blame^] | 317 | EXPECT_TRUE(dm_.SetMaximumDelay(100)); |
| 318 | EXPECT_TRUE(dm_.SetMinimumDelay(80)); |
| 319 | EXPECT_FALSE(dm_.SetMaximumDelay(60)); |
Jakob Ivarsson | 74154e6 | 2019-08-22 15:00:16 +0200 | [diff] [blame] | 320 | } |
| 321 | |
Jakob Ivarsson | 4450708 | 2019-03-05 16:59:03 +0100 | [diff] [blame] | 322 | TEST_F(DelayManagerTest, RelativeArrivalDelayStatistic) { |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 323 | EXPECT_EQ(absl::nullopt, InsertNextPacket()); |
Jakob Ivarsson | 4450708 | 2019-03-05 16:59:03 +0100 | [diff] [blame] | 324 | IncreaseTime(kFrameSizeMs); |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 325 | EXPECT_EQ(0, InsertNextPacket()); |
Jakob Ivarsson | 4450708 | 2019-03-05 16:59:03 +0100 | [diff] [blame] | 326 | IncreaseTime(2 * kFrameSizeMs); |
Ivo Creusen | 53a31f7 | 2019-10-24 15:20:39 +0200 | [diff] [blame] | 327 | |
| 328 | EXPECT_EQ(20, InsertNextPacket()); |
Jakob Ivarsson | 4450708 | 2019-03-05 16:59:03 +0100 | [diff] [blame] | 329 | } |
| 330 | |
henrik.lundin@webrtc.org | d94659d | 2013-01-29 12:09:21 +0000 | [diff] [blame] | 331 | } // namespace webrtc |