mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-11 21:37:58 +03:00
This is to avoid UB in cases where we need to be able to read from the buffer immediately after resizing it.
90 lines
2.7 KiB
C++
90 lines
2.7 KiB
C++
/*
|
||
* Copyright (c) 2020, the SerenityOS developers.
|
||
*
|
||
* SPDX-License-Identifier: BSD-2-Clause
|
||
*/
|
||
|
||
#include <LibTest/TestCase.h>
|
||
|
||
#include <AK/ByteBuffer.h>
|
||
#include <AK/Vector.h>
|
||
|
||
TEST_CASE(equality_operator)
|
||
{
|
||
ByteBuffer a = ByteBuffer::copy("Hello, world", 7).release_value();
|
||
ByteBuffer b = ByteBuffer::copy("Hello, friend", 7).release_value();
|
||
// `a` and `b` are both "Hello, ".
|
||
ByteBuffer c = ByteBuffer::copy("asdf", 4).release_value();
|
||
ByteBuffer d;
|
||
EXPECT_EQ(a == a, true);
|
||
EXPECT_EQ(a == b, true);
|
||
EXPECT_EQ(a == c, false);
|
||
EXPECT_EQ(a == d, false);
|
||
EXPECT_EQ(b == a, true);
|
||
EXPECT_EQ(b == b, true);
|
||
EXPECT_EQ(b == c, false);
|
||
EXPECT_EQ(b == d, false);
|
||
EXPECT_EQ(c == a, false);
|
||
EXPECT_EQ(c == b, false);
|
||
EXPECT_EQ(c == c, true);
|
||
EXPECT_EQ(c == d, false);
|
||
EXPECT_EQ(d == a, false);
|
||
EXPECT_EQ(d == b, false);
|
||
EXPECT_EQ(d == c, false);
|
||
EXPECT_EQ(d == d, true);
|
||
}
|
||
|
||
TEST_CASE(byte_buffer_vector_contains_slow_bytes)
|
||
{
|
||
Vector<ByteBuffer> vector;
|
||
ByteBuffer a = ByteBuffer::copy("Hello, friend", 13).release_value();
|
||
vector.append(a);
|
||
|
||
ReadonlyBytes b = "Hello, friend"sv.bytes();
|
||
Bytes c = a.bytes();
|
||
EXPECT_EQ(vector.contains_slow(b), true);
|
||
EXPECT_EQ(vector.contains_slow(c), true);
|
||
}
|
||
|
||
TEST_CASE(zero_fill_new_elements_on_growth)
|
||
{
|
||
auto buffer = MUST(ByteBuffer::create_uninitialized(5));
|
||
|
||
buffer.span().fill(1);
|
||
EXPECT_EQ(buffer.span(), (Array<u8, 5> { 1, 1, 1, 1, 1 }));
|
||
|
||
buffer.resize(8, ByteBuffer::ZeroFillNewElements::Yes);
|
||
EXPECT_EQ(buffer.span(), (Array<u8, 8> { 1, 1, 1, 1, 1, 0, 0, 0 }));
|
||
|
||
buffer.span().fill(2);
|
||
EXPECT_EQ(buffer.span(), (Array<u8, 8> { 2, 2, 2, 2, 2, 2, 2, 2 }));
|
||
|
||
buffer.resize(10, ByteBuffer::ZeroFillNewElements::Yes);
|
||
EXPECT_EQ(buffer.span(), (Array<u8, 10> { 2, 2, 2, 2, 2, 2, 2, 2, 0, 0 }));
|
||
}
|
||
|
||
BENCHMARK_CASE(append)
|
||
{
|
||
ByteBuffer bb;
|
||
for (size_t i = 0; i < 1000000; ++i) {
|
||
bb.append(static_cast<u8>(i));
|
||
}
|
||
}
|
||
|
||
/*
|
||
* FIXME: These `negative_*` tests should cause precisely one compilation error
|
||
* each, and always for the specified reason. Currently we do not have a harness
|
||
* for that, so in order to run the test you need to set the #define to 1, compile
|
||
* it, and check the error messages manually.
|
||
*/
|
||
#define COMPILE_NEGATIVE_TESTS 0
|
||
#if COMPILE_NEGATIVE_TESTS
|
||
TEST_CASE(negative_operator_lt)
|
||
{
|
||
ByteBuffer a = ByteBuffer::copy("Hello, world", 10).release_value();
|
||
ByteBuffer b = ByteBuffer::copy("Hello, friend", 10).release_value();
|
||
[[maybe_unused]] auto res = a < b;
|
||
// error: error: use of deleted function ‘bool AK::ByteBuffer::operator<(const AK::ByteBuffer&) const’
|
||
}
|
||
#endif /* COMPILE_NEGATIVE_TESTS */
|