Skip to content

Commit

Permalink
[UMA] add more tests for allocations
Browse files Browse the repository at this point in the history
  • Loading branch information
Damian Duy committed Jul 18, 2023
1 parent ba27e7d commit 23bfaea
Show file tree
Hide file tree
Showing 4 changed files with 242 additions and 2 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -129,7 +129,8 @@ enum umf_result_t umfFree(void *ptr);
enum umf_result_t umfPoolGetLastAllocationError(umf_memory_pool_handle_t hPool);

///
/// \brief Retrieve memory pool associated with a given ptr.
/// \brief Retrieve memory pool associated with a given ptr. Only memory allocated
/// with the usage of a memory provider is being tracked.
/// \param ptr pointer to memory belonging to a memory pool
/// \return Handle to a memory pool that contains ptr or NULL if pointer does not belong to any UMF pool.
umf_memory_pool_handle_t umfPoolByPtr(const void *ptr);
Expand Down
5 changes: 5 additions & 0 deletions test/unified_malloc_framework/common/pool.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -97,6 +97,8 @@ struct proxy_pool : public pool_base {
}
void *realloc(void *ptr, size_t size) noexcept {
// TODO: not supported
umf::getPoolLastStatusRef<proxy_pool>() =
UMF_RESULT_ERROR_NOT_SUPPORTED;
return nullptr;
}
void *aligned_malloc(size_t size, size_t alignment) noexcept {
Expand All @@ -116,6 +118,9 @@ struct proxy_pool : public pool_base {
EXPECT_EQ_NOEXCEPT(ret, UMF_RESULT_SUCCESS);
return ret;
}
enum umf_result_t get_last_allocation_error() {
return umf::getPoolLastStatusRef<proxy_pool>();
}
umf_memory_provider_handle_t provider;
};

Expand Down
234 changes: 234 additions & 0 deletions test/unified_malloc_framework/memoryPool.hpp
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,12 @@

#include "pool.hpp"

#include <array>
#include <cstring>
#include <functional>
#include <random>
#include <string>
#include <thread>

#ifndef UMF_TEST_MEMORY_POOL_OPS_HPP
#define UMF_TEST_MEMORY_POOL_OPS_HPP
Expand All @@ -30,6 +33,7 @@ struct umfPoolTest : umf_test::test,
}

umf::pool_unique_handle_t pool;
static constexpr int NTHREADS = 5;
};

struct umfMultiPoolTest : umfPoolTest {
Expand Down Expand Up @@ -57,6 +61,33 @@ TEST_P(umfPoolTest, allocFree) {
umfPoolFree(pool.get(), ptr);
}

TEST_P(umfPoolTest, reallocFree) {
static constexpr size_t allocSize = 64;
static constexpr size_t multiplier = 3;
auto *ptr = umfPoolMalloc(pool.get(), allocSize);
ASSERT_NE(ptr, nullptr);
auto *new_ptr = umfPoolRealloc(pool.get(), ptr, allocSize * multiplier);
umf_result_t ret = umfPoolGetLastAllocationError(pool.get());
if (ret == UMF_RESULT_ERROR_NOT_SUPPORTED) {
GTEST_SKIP();
}
ASSERT_NE(new_ptr, nullptr);
std::memset(new_ptr, 0, allocSize * multiplier);
umfPoolFree(pool.get(), new_ptr);
}

TEST_P(umfPoolTest, callocFree) {
static constexpr size_t num = 10;
static constexpr size_t size = sizeof(int);
auto *ptr = umfPoolCalloc(pool.get(), num, size);
umf_result_t ret = umfPoolGetLastAllocationError(pool.get());
if (ret == UMF_RESULT_ERROR_NOT_SUPPORTED) {
GTEST_SKIP();
}
ASSERT_NE(ptr, nullptr);
umfPoolFree(pool.get(), ptr);
}

TEST_P(umfPoolTest, pow2AlignedAlloc) {
#ifdef _WIN32
// TODO: implement support for windows
Expand Down Expand Up @@ -84,6 +115,209 @@ TEST_P(umfPoolTest, pow2AlignedAlloc) {
}
}

TEST_P(umfPoolTest, freeNullptr) {
void *ptr = nullptr;
auto ret = umfPoolFree(pool.get(), ptr);
ASSERT_EQ(ret, UMF_RESULT_SUCCESS);
}

TEST_P(umfPoolTest, allocOutOfMem) {
static constexpr size_t numProviders = 1;
size_t numProvidersRet = 0;
std::array<umf_memory_provider_handle_t, numProviders> retProviders;

auto ret = umfPoolGetMemoryProviders(pool.get(), numProviders,
retProviders.data(), &numProvidersRet);
ASSERT_EQ(ret, UMF_RESULT_SUCCESS);
ASSERT_EQ(numProvidersRet, numProviders);

for (auto provider : retProviders) {
if (std::string(umfMemoryProviderGetName(provider)) ==
std::string("null")) {
GTEST_SKIP();
}
}

// test whether memory is kept in a pool accordingly to MaxSize
static constexpr size_t allocSize = 16;
// MaxSize equals 16 * 1024 * 1024;
static constexpr size_t maxAllocs = 1024 * 1024;

// allocate until oom
void *ptr = nullptr;
std::vector<void *> allocations;

for (size_t i = 0; i <= maxAllocs; ++i) {
allocations.emplace_back(umfPoolMalloc(pool.get(), allocSize));
ASSERT_NE(allocations.back(), nullptr);
}

ASSERT_EQ(umfPoolByPtr(allocations.back()), pool.get());

// free some memory
umfPoolFree(pool.get(), allocations.back());

allocations.pop_back();

ptr = umfPoolMalloc(pool.get(), allocSize);
ASSERT_NE(ptr, nullptr);

umfPoolFree(pool.get(), ptr);

for (auto allocation : allocations) {
umfPoolFree(pool.get(), allocation);
}
}

TEST_P(umfPoolTest, multiThreadedMallocFree) {
static constexpr size_t allocSize = 64;
auto poolMalloc = [](size_t allocSize, umf_memory_pool_handle_t pool) {
std::vector<void *> allocations;
for (size_t i = 0; i <= 10; ++i) {
allocations.emplace_back(umfPoolMalloc(pool, allocSize));
ASSERT_NE(allocations.back(), nullptr);
}

for (auto allocation : allocations) {
umfPoolFree(pool, allocation);
}
};

std::vector<std::thread> threads;
for (int i = 0; i < NTHREADS; i++) {
threads.push_back(std::thread(poolMalloc, allocSize, pool.get()));
}

for (auto &thread : threads) {
thread.join();
}
}

TEST_P(umfPoolTest, multiThreadedpow2AlignedAlloc) {
#ifdef _WIN32
// TODO: implement support for windows
GTEST_SKIP();
#endif

static constexpr size_t maxAlignment = (1u << 22);
static constexpr size_t numAllocs = 4;
auto poolPow2AlignedAlloc = [](size_t maxAlignment, size_t numAllocs,
umf_memory_pool_handle_t pool) {
for (size_t alignment = 1; alignment <= maxAlignment; alignment <<= 1) {
std::cout << alignment << std::endl;
std::vector<void *> allocs;

for (size_t alloc = 0; alloc < numAllocs; alloc++) {
auto *ptr = umfPoolAlignedMalloc(pool, alignment, alignment);
ASSERT_NE(ptr, nullptr);
ASSERT_TRUE(reinterpret_cast<uintptr_t>(ptr) % alignment == 0);
std::memset(ptr, 0, alignment);
allocs.push_back(ptr);
}

for (auto &ptr : allocs) {
umfPoolFree(pool, ptr);
}
}
};

std::vector<std::thread> threads;
for (int i = 0; i < NTHREADS; i++) {
threads.push_back(std::thread(poolPow2AlignedAlloc, maxAlignment,
numAllocs, pool.get()));
}

for (auto &thread : threads) {
thread.join();
}
}

TEST_P(umfPoolTest, multiThreadedReallocFree) {
static constexpr size_t allocSize = 64;
static constexpr size_t multiplier = 3;
auto poolRealloc = [](size_t allocSize, size_t multiplier,
umf_memory_pool_handle_t pool) {
std::vector<void *> allocations;
for (size_t i = 0; i <= 10; ++i) {
allocations.emplace_back(umfPoolMalloc(pool, allocSize));
ASSERT_NE(allocations.back(), nullptr);
}

for (auto allocation : allocations) {
auto *ptr =
umfPoolRealloc(pool, allocation, allocSize * multiplier);
umf_result_t ret = umfPoolGetLastAllocationError(pool);
if (ret == UMF_RESULT_ERROR_NOT_SUPPORTED) {
GTEST_SKIP();
}
umfPoolFree(pool, ptr);
}
};

std::vector<std::thread> threads;
for (int i = 0; i < NTHREADS; i++) {
threads.push_back(
std::thread(poolRealloc, allocSize, multiplier, pool.get()));
}

for (auto &thread : threads) {
thread.join();
}
}

TEST_P(umfPoolTest, multiThreadedCallocFree) {
static constexpr size_t num = 10;
auto poolCalloc = [](size_t num, size_t size,
umf_memory_pool_handle_t pool) {
std::vector<void *> allocations;
for (size_t i = 0; i <= 10; ++i) {
allocations.emplace_back(umfPoolCalloc(pool, num, size));
umf_result_t ret = umfPoolGetLastAllocationError(pool);
if (ret == UMF_RESULT_ERROR_NOT_SUPPORTED) {
GTEST_SKIP();
}
ASSERT_NE(allocations.back(), nullptr);
}

for (auto allocation : allocations) {
umfPoolFree(pool, allocation);
}
};

std::vector<std::thread> threads;
for (int i = 0; i < NTHREADS; i++) {
threads.push_back(
std::thread(poolCalloc, num, sizeof(int), pool.get()));
}

for (auto &thread : threads) {
thread.join();
}
}

TEST_P(umfPoolTest, multiThreadedMallocFreeRandomSizes) {
auto poolMalloc = [](size_t allocSize, umf_memory_pool_handle_t pool) {
std::vector<void *> allocations;
for (size_t i = 0; i <= 10; ++i) {
allocations.emplace_back(umfPoolMalloc(pool, allocSize));
ASSERT_NE(allocations.back(), nullptr);
}

for (auto allocation : allocations) {
umfPoolFree(pool, allocation);
}
};

std::vector<std::thread> threads;
for (int i = 0; i < NTHREADS; i++) {
threads.push_back(std::thread(poolMalloc, rand() % 64 + 1, pool.get()));
}

for (auto &thread : threads) {
thread.join();
}
}

// TODO: add similar tests for realloc/aligned_alloc, etc.
// TODO: add multithreaded tests
TEST_P(umfMultiPoolTest, memoryTracking) {
Expand Down
2 changes: 1 addition & 1 deletion test/unified_malloc_framework/memoryPoolAPI.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -82,7 +82,7 @@ TEST_F(test, memoryPoolTrace) {
ASSERT_EQ(providerCalls.size(), provider_call_count);

ret = umfPoolGetLastAllocationError(tracingPool.get());
ASSERT_EQ(ret, UMF_RESULT_SUCCESS);
ASSERT_EQ(ret, UMF_RESULT_ERROR_NOT_SUPPORTED);
ASSERT_EQ(poolCalls["get_last_native_error"], 1);
ASSERT_EQ(poolCalls.size(), ++pool_call_count);

Expand Down

0 comments on commit 23bfaea

Please sign in to comment.