diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 14:29:10 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-28 14:29:10 +0000 |
commit | 2aa4a82499d4becd2284cdb482213d541b8804dd (patch) | |
tree | b80bf8bf13c3766139fbacc530efd0dd9d54394c /third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc | |
parent | Initial commit. (diff) | |
download | firefox-2aa4a82499d4becd2284cdb482213d541b8804dd.tar.xz firefox-2aa4a82499d4becd2284cdb482213d541b8804dd.zip |
Adding upstream version 86.0.1.upstream/86.0.1upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc')
-rw-r--r-- | third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc | 86 |
1 files changed, 86 insertions, 0 deletions
diff --git a/third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc b/third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc new file mode 100644 index 0000000000..11d115f6cd --- /dev/null +++ b/third_party/libwebrtc/webrtc/rtc_base/bufferqueue_unittest.cc @@ -0,0 +1,86 @@ +/* + * Copyright 2015 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 "rtc_base/bufferqueue.h" +#include "rtc_base/gunit.h" + +namespace rtc { + +TEST(BufferQueueTest, TestAll) { + const size_t kSize = 16; + const char in[kSize * 2 + 1] = "0123456789ABCDEFGHIJKLMNOPQRSTUV"; + char out[kSize * 2]; + size_t bytes; + BufferQueue queue1(1, kSize); + BufferQueue queue2(2, kSize); + + // The queue is initially empty. + EXPECT_EQ(0u, queue1.size()); + EXPECT_FALSE(queue1.ReadFront(out, kSize, &bytes)); + + // A write should succeed. + EXPECT_TRUE(queue1.WriteBack(in, kSize, &bytes)); + EXPECT_EQ(kSize, bytes); + EXPECT_EQ(1u, queue1.size()); + + // The queue is full now (only one buffer allowed). + EXPECT_FALSE(queue1.WriteBack(in, kSize, &bytes)); + EXPECT_EQ(1u, queue1.size()); + + // Reading previously written buffer. + EXPECT_TRUE(queue1.ReadFront(out, kSize, &bytes)); + EXPECT_EQ(kSize, bytes); + EXPECT_EQ(0, memcmp(in, out, kSize)); + + // The queue is empty again now. + EXPECT_FALSE(queue1.ReadFront(out, kSize, &bytes)); + EXPECT_EQ(0u, queue1.size()); + + // Reading only returns available data. + EXPECT_TRUE(queue1.WriteBack(in, kSize, &bytes)); + EXPECT_EQ(kSize, bytes); + EXPECT_EQ(1u, queue1.size()); + EXPECT_TRUE(queue1.ReadFront(out, kSize * 2, &bytes)); + EXPECT_EQ(kSize, bytes); + EXPECT_EQ(0, memcmp(in, out, kSize)); + EXPECT_EQ(0u, queue1.size()); + + // Reading maintains buffer boundaries. + EXPECT_TRUE(queue2.WriteBack(in, kSize / 2, &bytes)); + EXPECT_EQ(1u, queue2.size()); + EXPECT_TRUE(queue2.WriteBack(in + kSize / 2, kSize / 2, &bytes)); + EXPECT_EQ(2u, queue2.size()); + EXPECT_TRUE(queue2.ReadFront(out, kSize, &bytes)); + EXPECT_EQ(kSize / 2, bytes); + EXPECT_EQ(0, memcmp(in, out, kSize / 2)); + EXPECT_EQ(1u, queue2.size()); + EXPECT_TRUE(queue2.ReadFront(out, kSize, &bytes)); + EXPECT_EQ(kSize / 2, bytes); + EXPECT_EQ(0, memcmp(in + kSize / 2, out, kSize / 2)); + EXPECT_EQ(0u, queue2.size()); + + // Reading truncates buffers. + EXPECT_TRUE(queue2.WriteBack(in, kSize / 2, &bytes)); + EXPECT_EQ(1u, queue2.size()); + EXPECT_TRUE(queue2.WriteBack(in + kSize / 2, kSize / 2, &bytes)); + EXPECT_EQ(2u, queue2.size()); + // Read first packet partially in too-small buffer. + EXPECT_TRUE(queue2.ReadFront(out, kSize / 4, &bytes)); + EXPECT_EQ(kSize / 4, bytes); + EXPECT_EQ(0, memcmp(in, out, kSize / 4)); + EXPECT_EQ(1u, queue2.size()); + // Remainder of first packet is truncated, reading starts with next packet. + EXPECT_TRUE(queue2.ReadFront(out, kSize, &bytes)); + EXPECT_EQ(kSize / 2, bytes); + EXPECT_EQ(0, memcmp(in + kSize / 2, out, kSize / 2)); + EXPECT_EQ(0u, queue2.size()); +} + +} // namespace rtc |