130 lines
4.4 KiB
C#
130 lines
4.4 KiB
C#
//-----------------------------------------------------------------------
|
|
// -----------------------------------------------------------------------
|
|
// file="MatrixParallel.Task.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.
|
|
//
|
|
// -----------------------------------------------------------------------
|
|
// -----------------------------------------------------------------------
|
|
using StgSharp.HighPerformance;
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Drawing;
|
|
using System.Numerics;
|
|
using System.Runtime.CompilerServices;
|
|
using System.Runtime.ExceptionServices;
|
|
using System.Runtime.InteropServices;
|
|
using System.Threading;
|
|
|
|
namespace StgSharp.Mathematics
|
|
{
|
|
[StructLayout(LayoutKind.Explicit)]
|
|
public unsafe struct MatrixParallelTaskPackage
|
|
{
|
|
|
|
[FieldOffset(0)] public MatrixKernel* left;
|
|
[FieldOffset(8)] public MatrixKernel* result;
|
|
[FieldOffset(16)] public MatrixKernel* right;
|
|
[FieldOffset(40)] public ScalarDataPacket* scalerPacket;
|
|
[FieldOffset(24)] public int ComputeMode;
|
|
[FieldOffset(60)] public int count;
|
|
|
|
[FieldOffset(48)] public int leftStride;
|
|
[FieldOffset(56)] public int resultStride;
|
|
[FieldOffset(52)] public int rightStride;
|
|
[FieldOffset(32)] public IntPtr executionHandle;
|
|
|
|
}
|
|
|
|
/// <summary>
|
|
/// Scalar data packet for storing up to 8 parameters as type-erased ulong values Supports
|
|
/// reference counting for shared usage across multiple tasks Used to separate scalar data
|
|
/// allocation from task allocation and track batch completion
|
|
/// </summary>
|
|
[StructLayout(LayoutKind.Explicit, Size = 72)]
|
|
public unsafe struct ScalarDataPacket
|
|
{
|
|
|
|
public const int MaxScalarCount = 8;
|
|
public const int PacketSize = 64;
|
|
|
|
[FieldOffset(0)] private fixed ulong Value[8];
|
|
|
|
public ScalarDataPacket()
|
|
{
|
|
Unsafe.SkipInit(out this);
|
|
}
|
|
|
|
public ref T GetScalerRef<T>(int index) where T: unmanaged, INumber<T>
|
|
{
|
|
if (index is < 0 or >= MaxScalarCount) {
|
|
throw new IndexOutOfRangeException("ScalarDataPacket index out of range");
|
|
}
|
|
return ref Unsafe.As<ulong, T>(ref Value[index]);
|
|
}
|
|
|
|
}
|
|
|
|
public unsafe class MatrixParallelWrap
|
|
{
|
|
|
|
public Queue<IntPtr>[] cache;
|
|
|
|
public MatrixParallelWrap(int wrapSize)
|
|
{
|
|
cache = new Queue<IntPtr>[wrapSize];
|
|
for (int i = 0; i < cache.Length; i++) {
|
|
cache[i] = new Queue<IntPtr>(8);
|
|
}
|
|
}
|
|
|
|
public Span<IntPtr> EnqueuePackage(Span<IntPtr> packageSpan)
|
|
{
|
|
int idx = 0;
|
|
for (; idx < cache.Length; idx++) {
|
|
cache[idx].Enqueue(packageSpan[idx]);
|
|
}
|
|
return packageSpan[idx..];
|
|
}
|
|
|
|
public void EnqueuePackage(MatrixParallelTaskPackage* task)
|
|
{
|
|
Span<IntPtr> span = stackalloc IntPtr[cache.Length];
|
|
MatrixParallelFactory.
|
|
|
|
}
|
|
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
public bool TryGetNextWrapTask(int idInWrap, out IntPtr handle)
|
|
{
|
|
return cache[idInWrap].TryDequeue(out handle);
|
|
}
|
|
|
|
public record class Handle(int InWrapIndex, MatrixParallelWrap Wrap);
|
|
|
|
}
|
|
}
|