Chromium Code Reviews| Index: webrtc/modules/audio_processing/aec3/aec3_fft_unittest.cc |
| diff --git a/webrtc/modules/audio_processing/aec3/aec3_fft_unittest.cc b/webrtc/modules/audio_processing/aec3/aec3_fft_unittest.cc |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..d8845c0974e864b59a4149776521050a6b6465cf |
| --- /dev/null |
| +++ b/webrtc/modules/audio_processing/aec3/aec3_fft_unittest.cc |
| @@ -0,0 +1,211 @@ |
| +/* |
| + * Copyright (c) 2017 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 "webrtc/modules/audio_processing/aec3/aec3_fft.h" |
| + |
| +#include <algorithm> |
| + |
| +#include "webrtc/test/gtest.h" |
| + |
| +namespace webrtc { |
| +namespace {} // namespace |
|
hlundin-webrtc
2017/02/21 16:34:02
... but why?
peah-webrtc
2017/02/21 23:00:40
:-)
Done.
|
| + |
| +#if RTC_DCHECK_IS_ON && GTEST_HAS_DEATH_TEST && !defined(WEBRTC_ANDROID) |
| + |
| +// Verifies that the check for non-null input in Fft works. |
| +TEST(Aec3Fft, NullFftInput) { |
| + Aec3Fft fft; |
| + FftData X; |
| + EXPECT_DEATH(fft.Fft(nullptr, &X), ""); |
| +} |
| + |
| +// Verifies that the check for non-null input in Fft works. |
| +TEST(Aec3Fft, NullFftOutput) { |
| + Aec3Fft fft; |
| + std::array<float, kFftLength> x; |
| + EXPECT_DEATH(fft.Fft(&x, nullptr), ""); |
| +} |
| + |
| +// Verifies that the check for non-null output in Ifft works. |
| +TEST(Aec3Fft, NullIfftOutput) { |
| + Aec3Fft fft; |
| + FftData X; |
| + EXPECT_DEATH(fft.Ifft(X, nullptr), ""); |
| +} |
| + |
| +// Verifies that the check for non-null output in ZeroPaddedFft works. |
| +TEST(Aec3Fft, NullZeroPaddedFftOutput) { |
| + Aec3Fft fft; |
| + std::array<float, kFftLengthBy2> x; |
| + EXPECT_DEATH(fft.ZeroPaddedFft(x, nullptr), ""); |
| +} |
| + |
| +// Verifies that the check for input length in ZeroPaddedFft works. |
| +TEST(Aec3Fft, ZeroPaddedFftWrongInputLength) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLengthBy2 - 1> x; |
| + EXPECT_DEATH(fft.ZeroPaddedFft(x, &X), ""); |
| +} |
| + |
| +// Verifies that the check for non-null output in PaddedFft works. |
| +TEST(Aec3Fft, NullPaddedFftOutput) { |
| + Aec3Fft fft; |
| + std::array<float, kFftLengthBy2> x; |
| + std::array<float, kFftLengthBy2> x_old; |
| + EXPECT_DEATH(fft.PaddedFft(x, x_old, nullptr), ""); |
| +} |
| + |
| +// Verifies that the check for input length in PaddedFft works. |
| +TEST(Aec3Fft, PaddedFftWrongInputLength) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLengthBy2 - 1> x; |
| + std::array<float, kFftLengthBy2> x_old; |
| + EXPECT_DEATH(fft.PaddedFft(x, x_old, &X), ""); |
| +} |
| + |
| +// Verifies that the check for length in the old value in PaddedFft works. |
| +TEST(Aec3Fft, PaddedFftWrongOldValuesLength) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLengthBy2> x; |
| + std::array<float, kFftLengthBy2 - 1> x_old; |
| + EXPECT_DEATH(fft.PaddedFft(x, x_old, &X), ""); |
| +} |
| + |
| +#endif |
| + |
| +// Verifies that Fft works as intended. |
| +TEST(Aec3Fft, Fft) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLength> x; |
| + x.fill(0.f); |
| + fft.Fft(&x, &X); |
| + std::for_each(X.re.begin(), X.re.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
|
hlundin-webrtc
2017/02/21 16:34:02
After googling around a bit, I think you can make
peah-webrtc
2017/02/21 23:00:40
Nice!
For some reason, it does not build for me th
hlundin-webrtc
2017/02/22 15:24:05
You will have to #include "webrtc/test/gmock.h" si
peah-webrtc
2017/02/22 23:51:36
Ah! Thanks! That worked.
I changed to using what
|
| + std::for_each(X.im.begin(), X.im.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
| + |
| + x.fill(0.f); |
| + x[0] = 1.f; |
| + fft.Fft(&x, &X); |
| + std::for_each(X.re.begin(), X.re.end(), [](float a) { EXPECT_EQ(1.f, a); }); |
| + std::for_each(X.im.begin(), X.im.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
| + |
| + x.fill(1.f); |
| + fft.Fft(&x, &X); |
| + EXPECT_EQ(128.f, X.re[0]); |
| + std::for_each(X.re.begin() + 1, X.re.end(), |
| + [](float a) { EXPECT_EQ(0.f, a); }); |
| + std::for_each(X.im.begin(), X.im.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
| +} |
| + |
| +// Verifies that InverseFft works as intended. |
| +TEST(Aec3Fft, Ifft) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLength> x; |
| + |
| + X.re.fill(0.f); |
| + X.im.fill(0.f); |
| + fft.Ifft(X, &x); |
| + std::for_each(x.begin(), x.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
| + |
| + X.re.fill(1.f); |
| + X.im.fill(0.f); |
| + fft.Ifft(X, &x); |
| + EXPECT_EQ(64.f, x[0]); |
| + std::for_each(x.begin() + 1, x.end(), [](float a) { EXPECT_EQ(0.f, a); }); |
| + |
| + X.re.fill(0.f); |
| + X.re[0] = 128; |
| + X.im.fill(0.f); |
| + fft.Ifft(X, &x); |
| + std::for_each(x.begin(), x.end(), [](float a) { EXPECT_EQ(64.f, a); }); |
| +} |
| + |
| +// Verifies that InverseFft and Fft work as intended. |
| +TEST(Aec3Fft, FftAndIfft) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLength> x; |
| + std::array<float, kFftLength> x_ref; |
| + |
| + int v = 0; |
| + for (int k = 0; k < 20; ++k) { |
| + for (size_t j = 0; j < x.size(); ++j) { |
| + x[j] = v++; |
| + x_ref[j] = x[j] * 64.f; |
| + } |
| + fft.Fft(&x, &X); |
| + fft.Ifft(X, &x); |
| + for (size_t j = 0; j < x.size(); ++j) { |
| + EXPECT_NEAR(x_ref[j], x[j], 0.1f); |
|
hlundin-webrtc
2017/02/21 16:34:02
0.1 doesn't see to be very precise. Can you tighte
peah-webrtc
2017/02/21 23:00:40
Done.
|
| + } |
| + } |
| +} |
| + |
| +// Verifies that ZeroPaddedFft work as intended. |
| +TEST(Aec3Fft, ZeroPaddedFft) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLengthBy2> x_in; |
| + std::array<float, kFftLength> x_ref; |
| + std::array<float, kFftLength> x_out; |
| + |
| + int v = 0; |
| + x_ref.fill(0.f); |
| + for (int k = 0; k < 20; ++k) { |
| + for (size_t j = 0; j < x_in.size(); ++j) { |
| + x_in[j] = v++; |
| + x_ref[j + kFftLengthBy2] = x_in[j] * 64.f; |
| + } |
| + fft.ZeroPaddedFft(x_in, &X); |
| + fft.Ifft(X, &x_out); |
| + for (size_t j = 0; j < x_out.size(); ++j) { |
| + EXPECT_NEAR(x_ref[j], x_out[j], 0.1f); |
| + } |
| + } |
| +} |
| + |
| +// Verifies that ZeroPaddedFft work as intended. |
| +TEST(Aec3Fft, PaddedFft) { |
| + Aec3Fft fft; |
| + FftData X; |
| + std::array<float, kFftLengthBy2> x_in; |
| + std::array<float, kFftLength> x_out; |
| + std::array<float, kFftLengthBy2> x_old; |
| + std::array<float, kFftLengthBy2> x_old_ref; |
| + std::array<float, kFftLength> x_ref; |
| + |
| + int v = 0; |
| + x_old.fill(0.f); |
| + for (int k = 0; k < 20; ++k) { |
| + for (size_t j = 0; j < x_in.size(); ++j) { |
| + x_in[j] = v++; |
| + } |
| + |
| + std::copy(x_old.begin(), x_old.end(), x_ref.begin()); |
| + std::copy(x_in.begin(), x_in.end(), x_ref.begin() + kFftLengthBy2); |
| + std::copy(x_in.begin(), x_in.end(), x_old_ref.begin()); |
| + std::for_each(x_ref.begin(), x_ref.end(), [](float& a) { a *= 64.f; }); |
| + |
| + fft.PaddedFft(x_in, x_old, &X); |
| + fft.Ifft(X, &x_out); |
| + |
| + for (size_t j = 0; j < x_out.size(); ++j) { |
| + EXPECT_NEAR(x_ref[j], x_out[j], 0.1f); |
| + } |
| + |
| + EXPECT_EQ(x_old_ref, x_old); |
| + } |
| +} |
| + |
| +} // namespace webrtc |