youmuliu/stgsharp
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

hlsf goes bad

Browse Source
This commit is contained in:
Youmu Liu
2026-05-08 18:09:12 +08:00
parent 8aa319a120
commit d1aca8f745
47 changed files with 5020 additions and 446 deletions
Download Patch File Download Diff File Expand all files Collapse all files
StgSharp.Benchmark/HlsfAllocatorBench.cs
+123 -59
View File
@@ -1,35 +1,32 @@
//-----------------------------------------------------------------------
// -----------------------------------------------------------------------
// file="HlsfAllocatorBench.cs"
// file="HlsfAllocatorBench"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
// AuthorGroup: Nitload
// Copyright (c) Nitload. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person
// obtaining a copy of this software and associated documentation
// files (the “Software”), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software,
// and to permit persons to whom the Software is furnished to do so,
// subject to the following conditions:
//
// The above copyright notice and
// this permission notice shall be included in all copies
// or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED “AS IS”,
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
// -----------------------------------------------------------------------
// -----------------------------------------------------------------------
using BenchmarkDotNet.Attributes;
using StgSharp.Mathematics.Memory;
using StgSharp.HighPerformance.Memory;
using System;
using System.Collections.Generic;
using System.Runtime.InteropServices;
@@ -37,7 +34,6 @@ using System.Runtime.InteropServices;
namespace StgSharp.Benchmark
{
[MemoryDiagnoser]
[InvocationCount(2048)]
public class HlsfAllocatorBench
{
@@ -45,10 +41,23 @@ namespace StgSharp.Benchmark
private const int AllocationCount = 2048;
private static readonly int[] AllocSizes = [ 64, 96, 150, 200, 400, 1024, 4096 ];
private const int BatchCount = 256;
private const int TotalOperationsPerInvoke = BatchCount * AllocationCount;
private static readonly int[] AllocSizes = [
64,
100,
200,
400,
1024,
4096
];
private HybridLayerSegregatedFitAllocator _hlsfAllocator = null!;
private readonly List<hlsfHandle> _hlsfLocalList = new();
private readonly List<HlsfHandle> _hlsfLocalList = new();
private readonly List<nint> _libcLocalList = new();
private readonly uint[] _requestSizesByBatch = new uint[TotalOperationsPerInvoke];
private readonly int[] _freeOrderByBatch = new int[TotalOperationsPerInvoke];
private Random _random = new(42);
[GlobalCleanup]
@@ -61,47 +70,45 @@ namespace StgSharp.Benchmark
_libcLocalList.TrimExcess();
}
[Benchmark]
[Benchmark(OperationsPerInvoke = TotalOperationsPerInvoke)]
public void Hlsf()
{
RunHlsf(_hlsfAllocator, FreePolicy.NoCollect);
for (int batch = 0; batch < BatchCount; batch++) {
RunHlsf(batch, _hlsfAllocator, FreePolicy.NoCollect);
}
}
[IterationCleanup]
public void IterationCleanup()
{
_hlsfAllocator?.Dispose();
_hlsfAllocator = null!;
_hlsfLocalList.Clear();
_libcLocalList.Clear();
}
[IterationSetup]
public void IterationSetup()
{
_hlsfAllocator?.Dispose();
_random = new Random(42);
_hlsfAllocator = new HybridLayerSegregatedFitAllocator(GetArenaBytes(), align:(int)Alignment);
BuildIterationWorkload();
_hlsfLocalList.Clear();
_libcLocalList.Clear();
}
[Benchmark(Baseline = true)]
[Benchmark(Baseline = true, OperationsPerInvoke = TotalOperationsPerInvoke)]
public unsafe void Libc()
{
_libcLocalList.Clear();
for (int i = 0; i < AllocationCount; i++)
{
uint size = AlignSize(GetNextRandomSize());
void* allocate = NativeMemory.AlignedAlloc(size, Alignment);
if (allocate == null) {
throw new OutOfMemoryException("NativeMemory.AlignedAlloc returned null.");
}
_libcLocalList.Add((nint)allocate);
}
for (int i = 0; i < _libcLocalList.Count; i++) {
NativeMemory.AlignedFree((void*)_libcLocalList[i]);
for (int batch = 0; batch < BatchCount; batch++) {
RunLibc(batch);
}
}
[GlobalSetup]
public void Setup()
{
_random = new Random(42);
_hlsfAllocator = new HybridLayerSegregatedFitAllocator(GetArenaBytes(), align:(int)Alignment);
}
private static uint AlignSize(uint size)
private static uint AlignSize(
uint size
)
{
uint mask = Alignment - 1;
return (size + mask) & ~mask;
@@ -114,28 +121,85 @@ namespace StgSharp.Benchmark
int mb = defaultMb;
string? env = Environment.GetEnvironmentVariable("HLSF_BENCH_ARENA_MB");
if (!string.IsNullOrWhiteSpace(env) && int.TryParse(env, out int parsed) && parsed >= minMb) {
if (!string.IsNullOrWhiteSpace(env) &&
int.TryParse(env, out int parsed) &&
parsed >= minMb) {
mb = parsed;
}
return (nuint)mb * 1024u * 1024u;
}
private uint GetNextRandomSize() => (uint)AllocSizes[_random.Next(AllocSizes.Length)];
private void RunHlsf(HybridLayerSegregatedFitAllocator allocator, FreePolicy policy)
private void RunHlsf(
int batch,
HybridLayerSegregatedFitAllocator allocator,
FreePolicy policy
)
{
int batchOffset = batch * AllocationCount;
_hlsfLocalList.Clear();
for (int i = 0; i < AllocationCount; i++)
{
uint size = AlignSize(GetNextRandomSize());
hlsfHandle allocate = allocator.Alloc(size);
uint size = _requestSizesByBatch[batchOffset + i];
HlsfHandle allocate = allocator.Alloc(size);
_hlsfLocalList.Add(allocate);
}
for (int i = 0; i < _hlsfLocalList.Count; i++) {
allocator.Free(_hlsfLocalList[i], policy);
allocator.Free(_hlsfLocalList[_freeOrderByBatch[batchOffset + i]], policy);
}
}
private unsafe void RunLibc(
int batch
)
{
int batchOffset = batch * AllocationCount;
_libcLocalList.Clear();
for (int i = 0; i < AllocationCount; i++)
{
uint size = _requestSizesByBatch[batchOffset + i];
void* allocate = NativeMemory.AlignedAlloc(size, Alignment);
if (allocate == null) {
throw new OutOfMemoryException("NativeMemory.AlignedAlloc returned null.");
}
_libcLocalList.Add((nint)allocate);
}
for (int i = 0; i < _libcLocalList.Count; i++) {
NativeMemory.AlignedFree((void*)_libcLocalList[_freeOrderByBatch[batchOffset + i]]);
}
}
private void BuildIterationWorkload()
{
for (int batch = 0; batch < BatchCount; batch++)
{
int batchOffset = batch * AllocationCount;
for (int i = 0; i < AllocationCount; i++)
{
_requestSizesByBatch[batchOffset + i] = AlignSize((uint)AllocSizes[_random.Next(AllocSizes.Length)]);
_freeOrderByBatch[batchOffset + i] = i;
}
ShuffleFreeOrder(batchOffset, AllocationCount);
}
}
private void ShuffleFreeOrder(
int offset,
int count
)
{
for (int i = count - 1; i > 0; i--)
{
int swapIndex = _random.Next(i + 1);
int left = offset + i;
int right = offset + swapIndex;
(_freeOrderByBatch[left], _freeOrderByBatch[right]) =
(_freeOrderByBatch[right], _freeOrderByBatch[left]);
}
}
StgSharp.Benchmark/Program.cs
+4 -18
View File
@@ -32,21 +32,7 @@ using BenchmarkDotNet.Running;
using BenchmarkDotNet.Toolchains.InProcess.Emit;
using StgSharp.Benchmark;
namespace StgSharp.Benchmark
{
internal static class Program
{
private static void Main(
string[] args
)
{
IConfig config = ManualConfig.Create(DefaultConfig.Instance)
.AddLogger(ConsoleLogger.Default)
.AddJob(Job.Default
.WithToolchain(InProcessEmitToolchain.Instance));
_ = BenchmarkRunner.Run<SwissTableBench>(config);
}
}
}
IConfig config = ManualConfig.Create(DefaultConfig.Instance)
.AddLogger(ConsoleLogger.Default)
.AddJob(Job.Default.WithToolchain(InProcessEmitToolchain.Instance));
_ = BenchmarkRunner.Run<HlsfAllocatorBench>(config);