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

Daily update on 20260312-004950 by Nitload Youmu. Additional Message : use one single index mux as replacement of two slab allocators for L4.

Browse Source 
Signed-off-by: Nitload <YoumuLiu_NSI@whv0t.onmicrosoft.com>
This commit is contained in:
Nitload
2026-03-12 00:49:50 +08:00
parent 9b5dfec9d5
commit 0c1887d8f8
7 changed files with 197 additions and 88 deletions
Download Patch File Download Diff File Expand all files Collapse all files
StgSharp.Common/HighPerformance/Memory/L4.Allocate.cs
+53
View File
@@ -0,0 +1,53 @@
//-----------------------------------------------------------------------
// -----------------------------------------------------------------------
// file="L4.Allocate.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. 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.
//
// -----------------------------------------------------------------------
// -----------------------------------------------------------------------
namespace StgSharp.HighPerformance.Memory
{
public partial class L4
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
private void RecycleLine(int id)
{
_idMux.Push(id);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
private bool TryGetEmptyLine(out int index)
{
if (_idMux.TryPop(out index)) {
return true;
}
index = _maxId;
return Interlocked.Increment(ref _maxId) >= CacheLineCount;
}
}
}
StgSharp.Common/HighPerformance/Memory/L4.CacheLine.cs
+7 -6
View File
@@ -2,8 +2,8 @@
// -----------------------------------------------------------------------
// file="L4.CacheLine"
// Project: StgSharp
// AuthorGroup: Nitload
// Copyright (c) Nitload. All rights reserved.
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. 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
@@ -63,15 +63,16 @@ namespace StgSharp.HighPerformance.Memory
}
[StructLayout(LayoutKind.Sequential)]
[StructLayout(LayoutKind.Sequential, Pack = 16)]
private unsafe struct CacheLineHead
{
internal CacheLineHead* _next;
internal CacheLineHead* _prev;
internal int _level;
internal int _id;
internal int _refCount;
internal long _profile;
internal nuint _address;
internal nuint _origin;
}
StgSharp.Common/HighPerformance/Memory/L4.Prefetch.cs
+9 -6
View File
@@ -2,8 +2,8 @@
// -----------------------------------------------------------------------
// file="L4.Prefetch"
// Project: StgSharp
// AuthorGroup: Nitload
// Copyright (c) Nitload. All rights reserved.
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. 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
@@ -71,11 +71,14 @@ namespace StgSharp.HighPerformance.Memory
}
}
private partial bool TestHit(
nuint origin
)
private partial bool TestHit(nuint origin)
{
// needs implementation
if (_map.TryGet(origin, out nuint handle))
{
CacheLineHead* head = (CacheLineHead*)handle;
int index = head->_id;
(*_eviction)[index] = 0; // reset eviction counter
}
return false;
}
StgSharp.Common/HighPerformance/Memory/L4.cs
+19 -23
View File
@@ -2,8 +2,8 @@
// -----------------------------------------------------------------------
// file="L4"
// Project: StgSharp
// AuthorGroup: Nitload
// Copyright (c) Nitload. All rights reserved.
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. 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
@@ -42,33 +42,36 @@ namespace StgSharp.HighPerformance.Memory
private const int CacheLineCount = 8192;
private const int PredictionCount = 2048;
private const int PredictionLeaseAhead = 1024;
private const int PredictionLeastAhead = 1024;
private readonly CacheLineData* _data;
private readonly EvictionArray* _eviction;
private readonly CacheLineHead* _head;
private readonly CacheLinePrediction* _prediction;
private bool _disposed;
private int _activeCount;
private int _aheadCount;
private int _maxId;
private readonly nuint _baseAddress;
private readonly SlabAllocator<CacheLineData> _cacheLineAllocator;
private readonly SlabAllocator<CacheLineHead> _entryAllocator;
private readonly SwissTable _map;
private readonly UnmanagedStack<int> _idMux;
public L4()
{
int cacheSize = Unsafe.SizeOf<CacheLineData>() * CacheLineCount;
int entrySize = Unsafe.SizeOf<CacheLineHead>() * CacheLineCount;
int stackSize = sizeof(int) * CacheLineCount;
int mapSize = SwissTable.RequestedNativeMemorySize;
int pprvSize = Unsafe.SizeOf<EvictionArray>();
_baseAddress = (nuint)NativeMemory.AlignedAlloc((nuint)(cacheSize + entrySize + mapSize), 16);
int predictionSize = Unsafe.SizeOf<CacheLinePrediction>() * PredictionCount;
int rrpvSize = Unsafe.SizeOf<EvictionArray>();
_baseAddress = (nuint)NativeMemory.AlignedAlloc((nuint)(cacheSize + entrySize + stackSize + mapSize + predictionSize + rrpvSize), 16);
nuint _buffer = _baseAddress;
_cacheLineAllocator = SlabAllocator.FromBuffer<CacheLineData>(_buffer, CacheLineCount, _ => { });
_entryAllocator = SlabAllocator.FromBuffer<CacheLineHead>(_buffer + (nuint)cacheSize, CacheLineCount, _ => { });
_data = (CacheLineData*)_buffer;
_head = (CacheLineHead*)(_buffer + (nuint)cacheSize);
_prediction = (CacheLinePrediction*)(_buffer + (nuint)(cacheSize + entrySize));
_map = SwissTable.Create(_baseAddress + (nuint)(cacheSize + entrySize), _ => { });
_eviction = (EvictionArray*)(_baseAddress + (nuint)(cacheSize + entrySize + mapSize));
}
@@ -89,13 +92,12 @@ namespace StgSharp.HighPerformance.Memory
return;
}
_disposed = true;
_map.Dispose();
NativeMemory.AlignedFree((void*)_baseAddress);
GC.SuppressFinalize(this);
}
public CacheLine Map(
nuint origin
)
public CacheLine Map(nuint origin)
{
if (_map.TryGet(origin, out nuint entryHandle))
{
@@ -114,9 +116,7 @@ namespace StgSharp.HighPerformance.Memory
private partial void Prefetch();
private partial bool TestHit(
nuint origin
);
private partial bool TestHit(nuint origin);
public ref struct CacheLine : IDisposable
{
@@ -125,11 +125,7 @@ namespace StgSharp.HighPerformance.Memory
private ref int _refCount;
private nuint _handle;
internal CacheLine(
nuint handle,
ref int activeCount,
ref int cacheRefCount
)
internal CacheLine(nuint handle, ref int activeCount, ref int cacheRefCount)
{
_handle = handle;
_refCount = ref cacheRefCount;