L4 is now on new algo, using new eviction arrays, using union of hlsf and cache line head.
This commit is contained in:
@@ -44,8 +44,9 @@ namespace StgSharp.HighPerformance.Memory
|
||||
private const int PredictionLeastAhead = 1024;
|
||||
|
||||
private static readonly IIntrinsicKernel _intrinsic = IIntrinsicKernel.Instance;
|
||||
private readonly EvictionArray* _eviction;
|
||||
private readonly CacheLineHead* _head;
|
||||
private readonly MapArray* _mapCount;
|
||||
private readonly PredictionArray* _predictCount;
|
||||
private readonly CacheLineDescription* _prediction;
|
||||
private bool _disposed;
|
||||
private bool _exhausted;
|
||||
@@ -75,13 +76,13 @@ namespace StgSharp.HighPerformance.Memory
|
||||
nuint headSize = ((nuint)Unsafe.SizeOf<CacheLineHead>()) * CacheLineCount; // 16 byte align
|
||||
nuint predictionSize = ((nuint)Unsafe.SizeOf<CacheLineDescription>()) * PredictionCount; //16 byte align
|
||||
nuint mapSize = SwissTable.RequestedNativeMemorySize; // 16 byte align
|
||||
nuint rrpvSize = (nuint)Unsafe.SizeOf<EvictionArray>(); // 16 byte align
|
||||
nuint predictionCountSize = (nuint)Unsafe.SizeOf<PredictionArray>(); // 16 byte align
|
||||
nuint normalizedBufferSize = (bufferSize + (PageSize - 1)) & (~(PageSize - 1)); // align to 4096 byte, page size
|
||||
ByteCapacity = normalizedBufferSize;
|
||||
|
||||
// malloc all memory at once, and free at once in Dispose.
|
||||
// This is to avoid fragmentation and improve performance.
|
||||
_baseAddress = (nuint)Numa.Alloc(bindedNuma, entrySize + headSize + mapSize + predictionSize + rrpvSize + normalizedBufferSize);
|
||||
_baseAddress = (nuint)Numa.Alloc(bindedNuma, entrySize + headSize + mapSize + predictionSize + (predictionCountSize * 2) + normalizedBufferSize);
|
||||
nuint ptr = _baseAddress;
|
||||
|
||||
AllocSize = entrySize;
|
||||
@@ -98,8 +99,10 @@ namespace StgSharp.HighPerformance.Memory
|
||||
ptr += predictionSize;
|
||||
_map = SwissTable.Create(ptr, _ => { });
|
||||
ptr += mapSize;
|
||||
_eviction = (EvictionArray*)ptr;
|
||||
ptr += rrpvSize;
|
||||
_predictCount = (PredictionArray*)ptr;
|
||||
ptr += predictionCountSize;
|
||||
_mapCount = (MapArray*)ptr;
|
||||
ptr += predictionCountSize;
|
||||
}
|
||||
|
||||
public nuint ByteCapacity { get; init; }
|
||||
@@ -142,9 +145,9 @@ namespace StgSharp.HighPerformance.Memory
|
||||
nuint headSize = ((nuint)Unsafe.SizeOf<CacheLineHead>()) * CacheLineCount; // 16 byte align
|
||||
nuint predictionSize = ((nuint)Unsafe.SizeOf<CacheLineDescription>()) * PredictionCount; //16 byte align
|
||||
nuint mapSize = SwissTable.RequestedNativeMemorySize; // 16 byte align
|
||||
nuint rrpvSize = (nuint)Unsafe.SizeOf<EvictionArray>(); // 16 byte align
|
||||
nuint predictionCountSize = (nuint)Unsafe.SizeOf<PredictionArray>(); // 16 byte align
|
||||
nuint normalizedBufferSize = ByteCapacity; // align to 4096 byte, page size
|
||||
Numa.Free((void*)_baseAddress, _bindedNuma, entrySize + headSize + mapSize + predictionSize + rrpvSize + normalizedBufferSize);
|
||||
Numa.Free((void*)_baseAddress, _bindedNuma, entrySize + headSize + mapSize + predictionSize + (predictionCountSize * 2) + normalizedBufferSize);
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
@@ -179,7 +182,7 @@ namespace StgSharp.HighPerformance.Memory
|
||||
CacheLineHead* entry = (CacheLineHead*)entryHandle;
|
||||
if (Interlocked.Increment(ref entry->RefCount) > 0)
|
||||
{
|
||||
(*_eviction)[entry->Id] = 0;
|
||||
(*_predictCount)[entry->Id] = 0;
|
||||
_ = Interlocked.Increment(ref _activeCount);
|
||||
_ = Interlocked.Decrement(ref _aheadCount);
|
||||
_ = Interlocked.Decrement(ref entry->RemainingPredictionCount);
|
||||
|
||||
Reference in New Issue
Block a user