blob: 0f98b01d3aae3ebe167c9d9a4528ab43f8065d7f (
plain)
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
|
/*
* Copyright (c) 2018 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.
*/
#include "modules/audio_processing/aec3/clockdrift_detector.h"
#include "test/gtest.h"
namespace webrtc {
TEST(ClockdriftDetector, ClockdriftDetector) {
ClockdriftDetector c;
// No clockdrift at start.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kNone);
// Monotonically increasing delay.
for (int i = 0; i < 100; i++)
c.Update(1000);
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kNone);
for (int i = 0; i < 100; i++)
c.Update(1001);
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kNone);
for (int i = 0; i < 100; i++)
c.Update(1002);
// Probable clockdrift.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kProbable);
for (int i = 0; i < 100; i++)
c.Update(1003);
// Verified clockdrift.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kVerified);
// Stable delay.
for (int i = 0; i < 10000; i++)
c.Update(1003);
// No clockdrift.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kNone);
// Decreasing delay.
for (int i = 0; i < 100; i++)
c.Update(1001);
for (int i = 0; i < 100; i++)
c.Update(999);
// Probable clockdrift.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kProbable);
for (int i = 0; i < 100; i++)
c.Update(1000);
for (int i = 0; i < 100; i++)
c.Update(998);
// Verified clockdrift.
EXPECT_TRUE(c.ClockdriftLevel() == ClockdriftDetector::Level::kVerified);
}
} // namespace webrtc
|
