MrPiglr
9dddce666d
- Forked from Godot Engine 4.7-dev (MIT License) - Rebranded to AeThex Engine with cyan/purple theme - Added AI-powered development assistant module - Integrated Claude API for code completion & error fixing - Custom hexagon logo and branding - Multi-platform CI/CD (Windows, Linux, macOS) - Built Linux editor binary (151MB) - Complete source code with all customizations Tech Stack: - C++ game engine core - AI Module: Claude 3.5 Sonnet integration - Build: SCons, 14K+ source files - License: MIT (Godot) + Custom (AeThex features) Ready for Windows build via GitHub Actions!
82 lines
2.2 KiB
C++
82 lines
2.2 KiB
C++
// Copyright 2009-2021 Intel Corporation
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
#include "alloc.h"
|
|
#include "../../common/sys/thread.h"
|
|
#if defined(APPLE) && defined(__aarch64__)
|
|
#include "../../common/sys/barrier.h"
|
|
#endif
|
|
|
|
namespace embree
|
|
{
|
|
__thread FastAllocator::ThreadLocal2* FastAllocator::thread_local_allocator2 = nullptr;
|
|
MutexSys FastAllocator::s_thread_local_allocators_lock;
|
|
std::vector<std::unique_ptr<FastAllocator::ThreadLocal2>> FastAllocator::s_thread_local_allocators;
|
|
|
|
struct fast_allocator_regression_test : public RegressionTest
|
|
{
|
|
BarrierSys barrier;
|
|
std::atomic<size_t> numFailed;
|
|
std::unique_ptr<FastAllocator> alloc;
|
|
|
|
fast_allocator_regression_test()
|
|
: RegressionTest("fast_allocator_regression_test"), numFailed(0)
|
|
{
|
|
registerRegressionTest(this);
|
|
}
|
|
|
|
static void thread_alloc(fast_allocator_regression_test* This)
|
|
{
|
|
FastAllocator::CachedAllocator threadalloc = This->alloc->getCachedAllocator();
|
|
|
|
size_t* ptrs[1000];
|
|
for (size_t j=0; j<1000; j++)
|
|
{
|
|
This->barrier.wait();
|
|
for (size_t i=0; i<1000; i++) {
|
|
ptrs[i] = (size_t*) threadalloc.malloc0(sizeof(size_t)+(i%32));
|
|
*ptrs[i] = size_t(threadalloc.talloc0) + i;
|
|
}
|
|
for (size_t i=0; i<1000; i++) {
|
|
if (*ptrs[i] != size_t(threadalloc.talloc0) + i)
|
|
This->numFailed++;
|
|
}
|
|
This->barrier.wait();
|
|
}
|
|
}
|
|
|
|
bool run ()
|
|
{
|
|
alloc = make_unique(new FastAllocator(nullptr,false));
|
|
numFailed.store(0);
|
|
|
|
size_t numThreads = getNumberOfLogicalThreads();
|
|
barrier.init(numThreads+1);
|
|
|
|
/* create threads */
|
|
std::vector<thread_t> threads;
|
|
for (size_t i=0; i<numThreads; i++)
|
|
threads.push_back(createThread((thread_func)thread_alloc,this));
|
|
|
|
/* run test */
|
|
for (size_t i=0; i<1000; i++)
|
|
{
|
|
alloc->reset();
|
|
barrier.wait();
|
|
barrier.wait();
|
|
}
|
|
|
|
/* destroy threads */
|
|
for (size_t i=0; i<numThreads; i++)
|
|
join(threads[i]);
|
|
|
|
alloc = nullptr;
|
|
|
|
return numFailed == 0;
|
|
}
|
|
};
|
|
|
|
fast_allocator_regression_test fast_allocator_regression;
|
|
}
|
|
|
|
|