Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
174 lines
5.1 KiB
C++
174 lines
5.1 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0 */
|
|
|
|
#include "BLI_linear_allocator.hh"
|
|
#include "BLI_rand.hh"
|
|
#include "BLI_strict_flags.h"
|
|
#include "testing/testing.h"
|
|
|
|
namespace blender::tests {
|
|
|
|
static bool is_aligned(void *ptr, uint alignment)
|
|
{
|
|
BLI_assert(is_power_of_2_i(int(alignment)));
|
|
return (POINTER_AS_UINT(ptr) & (alignment - 1)) == 0;
|
|
}
|
|
|
|
TEST(linear_allocator, AllocationAlignment)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 4), 4));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 4), 4));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 4), 4));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 8), 8));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 4), 4));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 16), 16));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 4), 4));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 64), 64));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 64), 64));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 8), 8));
|
|
EXPECT_TRUE(is_aligned(allocator.allocate(10, 128), 128));
|
|
}
|
|
|
|
TEST(linear_allocator, PackedAllocation)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
blender::AlignedBuffer<256, 32> buffer;
|
|
allocator.provide_buffer(buffer);
|
|
|
|
uintptr_t ptr1 = uintptr_t(allocator.allocate(10, 4)); /* 0 - 10 */
|
|
uintptr_t ptr2 = uintptr_t(allocator.allocate(10, 4)); /* 12 - 22 */
|
|
uintptr_t ptr3 = uintptr_t(allocator.allocate(8, 32)); /* 32 - 40 */
|
|
uintptr_t ptr4 = uintptr_t(allocator.allocate(16, 8)); /* 40 - 56 */
|
|
uintptr_t ptr5 = uintptr_t(allocator.allocate(1, 8)); /* 56 - 57 */
|
|
uintptr_t ptr6 = uintptr_t(allocator.allocate(1, 4)); /* 60 - 61 */
|
|
uintptr_t ptr7 = uintptr_t(allocator.allocate(1, 1)); /* 61 - 62 */
|
|
|
|
EXPECT_EQ(ptr2 - ptr1, 12); /* 12 - 0 = 12 */
|
|
EXPECT_EQ(ptr3 - ptr2, 20); /* 32 - 12 = 20 */
|
|
EXPECT_EQ(ptr4 - ptr3, 8); /* 40 - 32 = 8 */
|
|
EXPECT_EQ(ptr5 - ptr4, 16); /* 56 - 40 = 16 */
|
|
EXPECT_EQ(ptr6 - ptr5, 4); /* 60 - 56 = 4 */
|
|
EXPECT_EQ(ptr7 - ptr6, 1); /* 61 - 60 = 1 */
|
|
}
|
|
|
|
TEST(linear_allocator, CopyString)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
blender::AlignedBuffer<256, 1> buffer;
|
|
allocator.provide_buffer(buffer);
|
|
|
|
StringRefNull ref1 = allocator.copy_string("Hello");
|
|
StringRefNull ref2 = allocator.copy_string("World");
|
|
|
|
EXPECT_EQ(ref1, "Hello");
|
|
EXPECT_EQ(ref2, "World");
|
|
EXPECT_EQ(ref2.data() - ref1.data(), 6);
|
|
}
|
|
|
|
TEST(linear_allocator, AllocateArray)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
|
|
MutableSpan<int> span = allocator.allocate_array<int>(5);
|
|
EXPECT_EQ(span.size(), 5);
|
|
}
|
|
|
|
TEST(linear_allocator, Construct)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
|
|
std::array<int, 5> values = {1, 2, 3, 4, 5};
|
|
Vector<int> *vector = allocator.construct<Vector<int>>(values).release();
|
|
EXPECT_EQ(vector->size(), 5);
|
|
EXPECT_EQ((*vector)[3], 4);
|
|
vector->~Vector();
|
|
}
|
|
|
|
TEST(linear_allocator, ConstructElementsAndPointerArray)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
|
|
std::array<int, 7> values = {1, 2, 3, 4, 5, 6, 7};
|
|
Span<Vector<int> *> vectors = allocator.construct_elements_and_pointer_array<Vector<int>>(
|
|
5, values);
|
|
|
|
EXPECT_EQ(vectors.size(), 5);
|
|
EXPECT_EQ(vectors[3]->size(), 7);
|
|
EXPECT_EQ((*vectors[2])[5], 6);
|
|
|
|
for (Vector<int> *vector : vectors) {
|
|
vector->~Vector();
|
|
}
|
|
}
|
|
|
|
TEST(linear_allocator, ConstructArrayCopy)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
|
|
Vector<int> values = {1, 2, 3};
|
|
MutableSpan<int> span1 = allocator.construct_array_copy(values.as_span());
|
|
MutableSpan<int> span2 = allocator.construct_array_copy(values.as_span());
|
|
EXPECT_NE(span1.data(), span2.data());
|
|
EXPECT_EQ(span1.size(), 3);
|
|
EXPECT_EQ(span2.size(), 3);
|
|
EXPECT_EQ(span1[1], 2);
|
|
EXPECT_EQ(span2[2], 3);
|
|
}
|
|
|
|
TEST(linear_allocator, AllocateLarge)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
void *buffer1 = allocator.allocate(1024 * 1024, 8);
|
|
void *buffer2 = allocator.allocate(1024 * 1024, 8);
|
|
EXPECT_NE(buffer1, buffer2);
|
|
}
|
|
|
|
TEST(linear_allocator, ManyAllocations)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
RandomNumberGenerator rng;
|
|
for (int i = 0; i < 1000; i++) {
|
|
int size = rng.get_int32(10000);
|
|
int alignment = 1 << rng.get_int32(7);
|
|
void *buffer = allocator.allocate(size, alignment);
|
|
EXPECT_NE(buffer, nullptr);
|
|
}
|
|
}
|
|
|
|
TEST(linear_allocator, ConstructArray)
|
|
{
|
|
LinearAllocator<> allocator;
|
|
MutableSpan<std::string> strings = allocator.construct_array<std::string>(4, "hello");
|
|
EXPECT_EQ(strings[0], "hello");
|
|
EXPECT_EQ(strings[1], "hello");
|
|
EXPECT_EQ(strings[2], "hello");
|
|
EXPECT_EQ(strings[3], "hello");
|
|
for (std::string &string : strings) {
|
|
string.~basic_string();
|
|
}
|
|
}
|
|
|
|
TEST(linear_allocator, TransferOwnership)
|
|
{
|
|
LinearAllocator<> main_allocator;
|
|
MutableSpan<int> values;
|
|
|
|
/* Allocate a large buffer that is likely to be given back to the system when freed. This test
|
|
* essentially only fails by crashing with a segfault. */
|
|
const int size = 1'000'000;
|
|
const int value = 42;
|
|
const int index = 500'000;
|
|
{
|
|
LinearAllocator<> nested_allocator;
|
|
values = nested_allocator.allocate_array<int>(size);
|
|
values[index] = value;
|
|
main_allocator.transfer_ownership_from(nested_allocator);
|
|
}
|
|
EXPECT_EQ(values[index], value);
|
|
}
|
|
|
|
} // namespace blender::tests
|