2013-01-29 12:09:21 +00:00
|
|
|
/*
|
|
|
|
|
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
|
|
|
|
*
|
|
|
|
|
* Use of this source code is governed by a BSD-style license
|
|
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
|
|
|
|
* in the file PATENTS. All contributing project authors may
|
|
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
// Unit tests for DelayManager class.
|
|
|
|
|
|
2017-09-15 06:47:31 +02:00
|
|
|
#include "modules/audio_coding/neteq/delay_manager.h"
|
2013-01-29 12:09:21 +00:00
|
|
|
|
|
|
|
|
#include <math.h>
|
|
|
|
|
|
2019-09-17 17:06:18 +02:00
|
|
|
#include <memory>
|
2024-08-29 13:00:40 +00:00
|
|
|
#include <optional>
|
2019-09-17 17:06:18 +02:00
|
|
|
|
2019-02-21 15:42:31 +01:00
|
|
|
#include "modules/audio_coding/neteq/histogram.h"
|
|
|
|
|
#include "modules/audio_coding/neteq/mock/mock_histogram.h"
|
2019-03-05 16:59:03 +01:00
|
|
|
#include "modules/audio_coding/neteq/mock/mock_statistics_calculator.h"
|
2019-02-13 14:25:39 +01:00
|
|
|
#include "rtc_base/checks.h"
|
2024-08-13 15:28:50 +02:00
|
|
|
#include "test/explicit_key_value_config.h"
|
2017-09-15 06:47:31 +02:00
|
|
|
#include "test/gmock.h"
|
|
|
|
|
#include "test/gtest.h"
|
2013-01-29 12:09:21 +00:00
|
|
|
|
|
|
|
|
namespace webrtc {
|
|
|
|
|
|
2019-02-27 10:08:09 +01:00
|
|
|
namespace {
|
2024-08-13 15:28:50 +02:00
|
|
|
|
|
|
|
|
using test::ExplicitKeyValueConfig;
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
constexpr int kMaxNumberOfPackets = 200;
|
2019-02-27 10:08:09 +01:00
|
|
|
constexpr int kTimeStepMs = 10;
|
|
|
|
|
constexpr int kFrameSizeMs = 20;
|
|
|
|
|
constexpr int kMaxBufferSizeMs = kMaxNumberOfPackets * kFrameSizeMs;
|
2021-09-07 14:24:56 +02:00
|
|
|
|
2019-02-27 10:08:09 +01:00
|
|
|
} // namespace
|
|
|
|
|
|
2013-01-29 12:09:21 +00:00
|
|
|
class DelayManagerTest : public ::testing::Test {
|
|
|
|
|
protected:
|
|
|
|
|
DelayManagerTest();
|
|
|
|
|
virtual void SetUp();
|
2022-05-25 21:06:14 +02:00
|
|
|
void Update(int delay);
|
2013-01-29 12:09:21 +00:00
|
|
|
void IncreaseTime(int inc_ms);
|
|
|
|
|
|
2021-11-08 19:09:28 +00:00
|
|
|
TickTimer tick_timer_;
|
2021-11-09 12:58:45 +01:00
|
|
|
DelayManager dm_;
|
2013-01-29 12:09:21 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
DelayManagerTest::DelayManagerTest()
|
2024-08-13 15:28:50 +02:00
|
|
|
: dm_(DelayManager::Config(ExplicitKeyValueConfig("")), &tick_timer_) {}
|
2013-01-29 12:09:21 +00:00
|
|
|
|
|
|
|
|
void DelayManagerTest::SetUp() {
|
2021-09-07 14:24:56 +02:00
|
|
|
dm_.SetPacketAudioLength(kFrameSizeMs);
|
2013-01-29 12:09:21 +00:00
|
|
|
}
|
|
|
|
|
|
2022-05-25 21:06:14 +02:00
|
|
|
void DelayManagerTest::Update(int delay) {
|
|
|
|
|
dm_.Update(delay, false);
|
2013-01-29 12:09:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void DelayManagerTest::IncreaseTime(int inc_ms) {
|
|
|
|
|
for (int t = 0; t < inc_ms; t += kTimeStepMs) {
|
2016-04-28 01:53:52 -07:00
|
|
|
tick_timer_.Increment();
|
2013-01-29 12:09:21 +00:00
|
|
|
}
|
|
|
|
|
}
|
2019-05-15 14:31:22 +02:00
|
|
|
|
2013-01-29 12:09:21 +00:00
|
|
|
TEST_F(DelayManagerTest, CreateAndDestroy) {
|
|
|
|
|
// Nothing to do here. The test fixture creates and destroys the DelayManager
|
|
|
|
|
// object.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, UpdateNormal) {
|
2021-11-09 12:58:45 +01:00
|
|
|
for (int i = 0; i < 50; ++i) {
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2021-11-09 12:58:45 +01:00
|
|
|
IncreaseTime(kFrameSizeMs);
|
|
|
|
|
}
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(20, dm_.TargetDelayMs());
|
2013-01-29 12:09:21 +00:00
|
|
|
}
|
|
|
|
|
|
2018-08-23 08:40:41 +02:00
|
|
|
TEST_F(DelayManagerTest, MaxDelay) {
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2021-11-09 12:58:45 +01:00
|
|
|
const int kMaxDelayMs = 60;
|
|
|
|
|
EXPECT_GT(dm_.TargetDelayMs(), kMaxDelayMs);
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(kMaxDelayMs));
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(kMaxDelayMs, dm_.TargetDelayMs());
|
2013-08-16 23:44:24 +00:00
|
|
|
}
|
|
|
|
|
|
2018-08-23 08:40:41 +02:00
|
|
|
TEST_F(DelayManagerTest, MinDelay) {
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2020-10-09 13:41:06 +02:00
|
|
|
int kMinDelayMs = 7 * kFrameSizeMs;
|
2021-11-09 12:58:45 +01:00
|
|
|
EXPECT_LT(dm_.TargetDelayMs(), kMinDelayMs);
|
2021-09-07 14:24:56 +02:00
|
|
|
dm_.SetMinimumDelay(kMinDelayMs);
|
2019-09-03 13:04:41 +02:00
|
|
|
IncreaseTime(kFrameSizeMs);
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(kMinDelayMs, dm_.TargetDelayMs());
|
2013-08-16 23:44:24 +00:00
|
|
|
}
|
|
|
|
|
|
2019-02-13 14:25:39 +01:00
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayCheckValidRange) {
|
|
|
|
|
// Base minimum delay should be between [0, 10000] milliseconds.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_FALSE(dm_.SetBaseMinimumDelay(-1));
|
|
|
|
|
EXPECT_FALSE(dm_.SetBaseMinimumDelay(10001));
|
|
|
|
|
EXPECT_EQ(dm_.GetBaseMinimumDelay(), 0);
|
2019-02-13 14:25:39 +01:00
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(7999));
|
|
|
|
|
EXPECT_EQ(dm_.GetBaseMinimumDelay(), 7999);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayLowerThanMinimumDelay) {
|
|
|
|
|
constexpr int kBaseMinimumDelayMs = 100;
|
|
|
|
|
constexpr int kMinimumDelayMs = 200;
|
|
|
|
|
|
|
|
|
|
// Base minimum delay sets lower bound on minimum. That is why when base
|
|
|
|
|
// minimum delay is lower than minimum delay we use minimum delay.
|
|
|
|
|
RTC_DCHECK_LT(kBaseMinimumDelayMs, kMinimumDelayMs);
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
|
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanMinimumDelay) {
|
|
|
|
|
constexpr int kBaseMinimumDelayMs = 70;
|
|
|
|
|
constexpr int kMinimumDelayMs = 30;
|
|
|
|
|
|
|
|
|
|
// Base minimum delay sets lower bound on minimum. That is why when base
|
|
|
|
|
// minimum delay is greater than minimum delay we use base minimum delay.
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs);
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
|
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanBufferSize) {
|
|
|
|
|
constexpr int kBaseMinimumDelayMs = kMaxBufferSizeMs + 1;
|
|
|
|
|
constexpr int kMinimumDelayMs = 12;
|
2019-02-20 13:41:59 +01:00
|
|
|
constexpr int kMaximumDelayMs = 20;
|
2019-02-13 14:25:39 +01:00
|
|
|
constexpr int kMaxBufferSizeMsQ75 = 3 * kMaxBufferSizeMs / 4;
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs));
|
2019-02-20 13:41:59 +01:00
|
|
|
|
2019-02-13 14:25:39 +01:00
|
|
|
// Base minimum delay is greater than minimum delay, that is why we clamp
|
|
|
|
|
// it to current the highest possible value which is maximum delay.
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs);
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaxBufferSizeMs);
|
2019-02-20 13:41:59 +01:00
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaximumDelayMs);
|
|
|
|
|
RTC_DCHECK_LT(kMaximumDelayMs, kMaxBufferSizeMsQ75);
|
2019-02-13 14:25:39 +01:00
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
2019-02-13 14:25:39 +01:00
|
|
|
|
|
|
|
|
// Unset maximum value.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(0));
|
2019-02-13 14:25:39 +01:00
|
|
|
|
|
|
|
|
// With maximum value unset, the highest possible value now is 75% of
|
|
|
|
|
// currently possible maximum buffer size.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMaxBufferSizeMsQ75);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayGreaterThanMaximumDelay) {
|
|
|
|
|
constexpr int kMaximumDelayMs = 400;
|
|
|
|
|
constexpr int kBaseMinimumDelayMs = kMaximumDelayMs + 1;
|
|
|
|
|
constexpr int kMinimumDelayMs = 20;
|
|
|
|
|
|
|
|
|
|
// Base minimum delay is greater than minimum delay, that is why we clamp
|
|
|
|
|
// it to current the highest possible value which is kMaximumDelayMs.
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs);
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMaximumDelayMs);
|
|
|
|
|
RTC_DCHECK_LT(kMaximumDelayMs, kMaxBufferSizeMs);
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
|
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMaximumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelayLowerThanMaxSize) {
|
|
|
|
|
constexpr int kMaximumDelayMs = 400;
|
|
|
|
|
constexpr int kBaseMinimumDelayMs = kMaximumDelayMs - 1;
|
|
|
|
|
constexpr int kMinimumDelayMs = 20;
|
|
|
|
|
|
|
|
|
|
// Base minimum delay is greater than minimum delay, and lower than maximum
|
|
|
|
|
// delays that is why it is used.
|
|
|
|
|
RTC_DCHECK_GT(kBaseMinimumDelayMs, kMinimumDelayMs);
|
|
|
|
|
RTC_DCHECK_LT(kBaseMinimumDelayMs, kMaximumDelayMs);
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(kMaximumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
|
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
|
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, MinimumDelayMemorization) {
|
|
|
|
|
// Check that when we increase base minimum delay to value higher than
|
|
|
|
|
// minimum delay then minimum delay is still memorized. This allows to
|
|
|
|
|
// restore effective minimum delay to memorized minimum delay value when we
|
|
|
|
|
// decrease base minimum delay.
|
|
|
|
|
constexpr int kBaseMinimumDelayMsLow = 10;
|
|
|
|
|
constexpr int kMinimumDelayMs = 20;
|
|
|
|
|
constexpr int kBaseMinimumDelayMsHigh = 30;
|
|
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsLow));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(kMinimumDelayMs));
|
2019-02-13 14:25:39 +01:00
|
|
|
// Minimum delay is used as it is higher than base minimum delay.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsHigh));
|
2019-02-13 14:25:39 +01:00
|
|
|
// Base minimum delay is used as it is now higher than minimum delay.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kBaseMinimumDelayMsHigh);
|
2019-02-13 14:25:39 +01:00
|
|
|
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMsLow));
|
2019-02-13 14:25:39 +01:00
|
|
|
// Check that minimum delay is memorized and is used again.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(dm_.effective_minimum_delay_ms_for_test(), kMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
TEST_F(DelayManagerTest, BaseMinimumDelay) {
|
2019-02-04 16:17:31 +01:00
|
|
|
// First packet arrival.
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2019-02-04 16:17:31 +01:00
|
|
|
|
2020-10-09 13:41:06 +02:00
|
|
|
constexpr int kBaseMinimumDelayMs = 7 * kFrameSizeMs;
|
2021-11-09 12:58:45 +01:00
|
|
|
EXPECT_LT(dm_.TargetDelayMs(), kBaseMinimumDelayMs);
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetBaseMinimumDelay(kBaseMinimumDelayMs));
|
|
|
|
|
EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs);
|
2019-02-13 14:25:39 +01:00
|
|
|
|
2019-09-03 13:04:41 +02:00
|
|
|
IncreaseTime(kFrameSizeMs);
|
2022-05-25 21:06:14 +02:00
|
|
|
Update(0);
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(dm_.GetBaseMinimumDelay(), kBaseMinimumDelayMs);
|
|
|
|
|
EXPECT_EQ(kBaseMinimumDelayMs, dm_.TargetDelayMs());
|
Handle padded audio packets correctly
RTP packets can be padded with extra data at the end of the payload. The usable
payload length of the packet should then be reduced with the padding length,
since the padding must be discarded. This was not the case; instead, the entire
payload, including padding data, was forwarded to the audio channel and in the
end to the decoder.
A special case of padding is packets which are empty except for the padding.
That is, they carry no usable payload. These packets are sometimes used for
probing the network and were discarded in
RTPReceiverAudio::ParseAudioCodecSpecific. The result is that NetEq never sees
those empty packets, just the holes in the sequence number series; this can
throw off the target buffer calculations.
With this change, the empty (after removing the padding) packets are let through,
all the way down to NetEq, to a new method called NetEq::InsertEmptyPacket. This
method notifies the DelayManager that an empty packet was received.
BUG=webrtc:7610, webrtc:7625
Review-Url: https://codereview.webrtc.org/2870043003
Cr-Commit-Position: refs/heads/master@{#18083}
2017-05-10 07:38:01 -07:00
|
|
|
}
|
|
|
|
|
|
2013-01-29 12:09:21 +00:00
|
|
|
TEST_F(DelayManagerTest, Failures) {
|
|
|
|
|
// Wrong packet size.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_EQ(-1, dm_.SetPacketAudioLength(0));
|
|
|
|
|
EXPECT_EQ(-1, dm_.SetPacketAudioLength(-1));
|
2013-08-16 23:44:24 +00:00
|
|
|
|
|
|
|
|
// Minimum delay higher than a maximum delay is not accepted.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(20));
|
|
|
|
|
EXPECT_FALSE(dm_.SetMinimumDelay(40));
|
2013-08-16 23:44:24 +00:00
|
|
|
|
|
|
|
|
// Maximum delay less than minimum delay is not accepted.
|
2021-09-07 14:24:56 +02:00
|
|
|
EXPECT_TRUE(dm_.SetMaximumDelay(100));
|
|
|
|
|
EXPECT_TRUE(dm_.SetMinimumDelay(80));
|
|
|
|
|
EXPECT_FALSE(dm_.SetMaximumDelay(60));
|
2019-08-22 15:00:16 +02:00
|
|
|
}
|
|
|
|
|
|
2013-01-29 12:09:21 +00:00
|
|
|
} // namespace webrtc
|