1 /*
2 * Copyright (c) 2018 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 #include "modules/audio_processing/agc2/rnn_vad/sequence_buffer.h"
12
13 #include <algorithm>
14 #include <array>
15
16 #include "test/gtest.h"
17
18 namespace webrtc {
19 namespace rnn_vad {
20 namespace {
21
22 template <typename T, int S, int N>
TestSequenceBufferPushOp()23 void TestSequenceBufferPushOp() {
24 SCOPED_TRACE(S);
25 SCOPED_TRACE(N);
26 SequenceBuffer<T, S, N> seq_buf;
27 auto seq_buf_view = seq_buf.GetBufferView();
28 std::array<T, N> chunk;
29
30 // Check that a chunk is fully gone after ceil(S / N) push ops.
31 chunk.fill(1);
32 seq_buf.Push(chunk);
33 chunk.fill(0);
34 constexpr int required_push_ops = (S % N) ? S / N + 1 : S / N;
35 for (int i = 0; i < required_push_ops - 1; ++i) {
36 SCOPED_TRACE(i);
37 seq_buf.Push(chunk);
38 // Still in the buffer.
39 const auto* m = std::max_element(seq_buf_view.begin(), seq_buf_view.end());
40 EXPECT_EQ(1, *m);
41 }
42 // Gone after another push.
43 seq_buf.Push(chunk);
44 const auto* m = std::max_element(seq_buf_view.begin(), seq_buf_view.end());
45 EXPECT_EQ(0, *m);
46
47 // Check that the last item moves left by N positions after a push op.
48 if (S > N) {
49 // Fill in with non-zero values.
50 for (int i = 0; i < N; ++i)
51 chunk[i] = static_cast<T>(i + 1);
52 seq_buf.Push(chunk);
53 // With the next Push(), `last` will be moved left by N positions.
54 const T last = chunk[N - 1];
55 for (int i = 0; i < N; ++i)
56 chunk[i] = static_cast<T>(last + i + 1);
57 seq_buf.Push(chunk);
58 EXPECT_EQ(last, seq_buf_view[S - N - 1]);
59 }
60 }
61
TEST(RnnVadTest,SequenceBufferGetters)62 TEST(RnnVadTest, SequenceBufferGetters) {
63 constexpr int buffer_size = 8;
64 constexpr int chunk_size = 8;
65 SequenceBuffer<int, buffer_size, chunk_size> seq_buf;
66 EXPECT_EQ(buffer_size, seq_buf.size());
67 EXPECT_EQ(chunk_size, seq_buf.chunks_size());
68 // Test view.
69 auto seq_buf_view = seq_buf.GetBufferView();
70 EXPECT_EQ(0, seq_buf_view[0]);
71 EXPECT_EQ(0, seq_buf_view[seq_buf_view.size() - 1]);
72 constexpr std::array<int, chunk_size> chunk = {10, 20, 30, 40,
73 50, 60, 70, 80};
74 seq_buf.Push(chunk);
75 EXPECT_EQ(10, *seq_buf_view.begin());
76 EXPECT_EQ(80, *(seq_buf_view.end() - 1));
77 }
78
TEST(RnnVadTest,SequenceBufferPushOpsUnsigned)79 TEST(RnnVadTest, SequenceBufferPushOpsUnsigned) {
80 TestSequenceBufferPushOp<uint8_t, 32, 8>(); // Chunk size: 25%.
81 TestSequenceBufferPushOp<uint8_t, 32, 16>(); // Chunk size: 50%.
82 TestSequenceBufferPushOp<uint8_t, 32, 32>(); // Chunk size: 100%.
83 TestSequenceBufferPushOp<uint8_t, 23, 7>(); // Non-integer ratio.
84 }
85
TEST(RnnVadTest,SequenceBufferPushOpsSigned)86 TEST(RnnVadTest, SequenceBufferPushOpsSigned) {
87 TestSequenceBufferPushOp<int, 32, 8>(); // Chunk size: 25%.
88 TestSequenceBufferPushOp<int, 32, 16>(); // Chunk size: 50%.
89 TestSequenceBufferPushOp<int, 32, 32>(); // Chunk size: 100%.
90 TestSequenceBufferPushOp<int, 23, 7>(); // Non-integer ratio.
91 }
92
TEST(RnnVadTest,SequenceBufferPushOpsFloating)93 TEST(RnnVadTest, SequenceBufferPushOpsFloating) {
94 TestSequenceBufferPushOp<float, 32, 8>(); // Chunk size: 25%.
95 TestSequenceBufferPushOp<float, 32, 16>(); // Chunk size: 50%.
96 TestSequenceBufferPushOp<float, 32, 32>(); // Chunk size: 100%.
97 TestSequenceBufferPushOp<float, 23, 7>(); // Non-integer ratio.
98 }
99
100 } // namespace
101 } // namespace rnn_vad
102 } // namespace webrtc
103