mirror of
https://github.com/Heretek-AI/game-engine.git
synced 2026-11-07 10:55:58 -10:00
* [M1-01] Initialize monorepo: CMake C++20 build, .slnx workspace, vendored deps, CI - Root CMakeLists.txt (C++20 strict, PIC) + cmake/EngineHotFlags (-Wall/-Werror, -mavx2 x86-64 only, -fno-exceptions/-fno-rtti hot path) - CMakePresets.json: linux/macos/windows debug+release, ci-* (WERROR) - native/: engine_core shared lib (version API), core/ecs hot OBJECT libs, renderer/physics/audio/bridge stubs with owners - native/tests: engine_core_smoke CTest (version handshake) - deps/: flecs v4.1.6 + enkiTS pinned, README with re-vendor recipe - Engine.slnx + Directory.Build.props (net10.0, AllowUnsafeBlocks, TieredPGO, zero-warn) + Bindings/Runtime/Tests/abi_codegen stubs - .github/workflows/ci.yml: native (CMake+CTest) + managed (dotnet build+run) on ubuntu/macos/windows - Verified: configure+build+ctest green on linux-debug (Clang), AVX2/no-exceptions flags confirmed in compile_commands.json * fix(ci): AbiCodegen assembly name (CA1707), Windows Ninja+MSVC presets * fix(ci): fail-fast windows test (5min step timeout, 60s test timeout, verbose) * fix(ci): isolate windows hang — bootstrap control test + unbuffered smoke output * fix(ci): copy runtime DLLs next to windows test binaries * fix(ci): only copy DLLs for linked test target --------- Co-authored-by: hermes-agent <hermes-agent@local> Co-authored-by: hermes <[email protected]>
133 lines
4.0 KiB
C++
133 lines
4.0 KiB
C++
// Copyright (c) 2019 Doug Binks
|
|
//
|
|
// This software is provided 'as-is', without any express or implied
|
|
// warranty. In no event will the authors be held liable for any damages
|
|
// arising from the use of this software.
|
|
//
|
|
// Permission is granted to anyone to use this software for any purpose,
|
|
// including commercial applications, and to alter it and redistribute it
|
|
// freely, subject to the following restrictions:
|
|
//
|
|
// 1. The origin of this software must not be misrepresented; you must not
|
|
// claim that you wrote the original software. If you use this software
|
|
// in a product, an acknowledgement in the product documentation would be
|
|
// appreciated but is not required.
|
|
// 2. Altered source versions must be plainly marked as such, and must not be
|
|
// misrepresented as being the original software.
|
|
// 3. This notice may not be removed or altered from any source distribution.
|
|
|
|
#include "TaskScheduler.h"
|
|
#include "Timer.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
enki::TaskScheduler g_TS;
|
|
uint32_t g_Iteration;
|
|
|
|
std::atomic<int32_t> g_WaitForTaskCompletion(0);
|
|
std::atomic<int32_t> g_WaitCount(0);
|
|
|
|
struct SlowTask : enki::ITaskSet
|
|
{
|
|
void ExecuteRange( enki::TaskSetPartition range_, uint32_t threadnum_ ) override
|
|
{
|
|
// fake slow task with timer
|
|
Timer timer;
|
|
timer.Start();
|
|
while( timer.GetTimeMS() < waitTime )
|
|
{
|
|
}
|
|
}
|
|
|
|
double waitTime;
|
|
};
|
|
|
|
struct SlowPinnedTask : enki::IPinnedTask
|
|
{
|
|
void Execute() override
|
|
{
|
|
// fake slow task with timer
|
|
Timer timer;
|
|
timer.Start();
|
|
while( timer.GetTimeMS() < waitTime )
|
|
{
|
|
}
|
|
}
|
|
|
|
double waitTime;
|
|
};
|
|
|
|
struct WaitingTask : enki::ITaskSet
|
|
{
|
|
void ExecuteRange( enki::TaskSetPartition range_, uint32_t threadnum_ ) override
|
|
{
|
|
int numWaitTasks = maxWaitasks - depth;
|
|
for( int t = 0; t < numWaitTasks; ++t )
|
|
{
|
|
pWaitingTasks[t] = new WaitingTask;
|
|
pWaitingTasks[t]->depth = depth + 1;
|
|
g_TS.AddTaskSetToPipe( pWaitingTasks[t] );
|
|
}
|
|
for( SlowTask& task : tasks )
|
|
{
|
|
task.m_SetSize = 1000;
|
|
task.waitTime = 0.00001 * double( rand() % 100 );
|
|
g_TS.AddTaskSetToPipe( &task );
|
|
}
|
|
|
|
for( SlowTask& task : tasks )
|
|
{
|
|
++g_WaitCount;
|
|
g_TS.WaitforTask( &task );
|
|
|
|
// we add a random wait for pinned task here.
|
|
uint32_t randThread = (uint32_t)rand() % g_TS.GetNumTaskThreads();
|
|
pinnedTask.threadNum = randThread;
|
|
pinnedTask.waitTime = 0.00001 * double( rand() % 10 );
|
|
g_TS.AddPinnedTask( &pinnedTask );
|
|
g_TS.WaitforTask( &pinnedTask );
|
|
}
|
|
|
|
for( int t = 0; t < numWaitTasks; ++t )
|
|
{
|
|
++g_WaitCount;
|
|
g_TS.WaitforTask( pWaitingTasks[t] );
|
|
}
|
|
}
|
|
|
|
virtual ~WaitingTask()
|
|
{
|
|
for( WaitingTask* pWaitingTask : pWaitingTasks )
|
|
{
|
|
delete pWaitingTask;
|
|
}
|
|
}
|
|
SlowTask tasks[4];
|
|
SlowPinnedTask pinnedTask;
|
|
int32_t depth = 0;
|
|
static constexpr int maxWaitasks = 4;
|
|
WaitingTask* pWaitingTasks[maxWaitasks] = {};
|
|
};
|
|
|
|
|
|
|
|
// This example demonstrates how to run a long running task alongside tasks
|
|
// which must complete as early as possible using priorities.
|
|
int main(int argc, const char * argv[])
|
|
{
|
|
enki::TaskSchedulerConfig config;
|
|
config.profilerCallbacks.waitForTaskCompleteStart = []( uint32_t threadnum_ ) { ++g_WaitCount; };
|
|
config.profilerCallbacks.waitForTaskCompleteSuspendStart = []( uint32_t threadnum_ ) { ++g_WaitForTaskCompletion; };
|
|
g_TS.Initialize( config );
|
|
for( g_Iteration = 0; g_Iteration < 1000; ++g_Iteration )
|
|
{
|
|
printf( "\tIteration %d: Waits: %d blocking waits: %d\n",
|
|
g_Iteration, g_WaitCount.load(), g_WaitForTaskCompletion.load() );
|
|
WaitingTask taskRoot;
|
|
g_TS.AddTaskSetToPipe( &taskRoot );
|
|
g_TS.WaitforAll();
|
|
}
|
|
return 0;
|
|
}
|