Files
RobustToolbox/Robust.Shared.Maths/NumericsHelpers.Max.cs

296 lines
9.2 KiB
C#

using System;
using System.Runtime.CompilerServices;
using System.Runtime.Intrinsics;
using System.Runtime.Intrinsics.Arm;
using System.Runtime.Intrinsics.X86;
namespace Robust.Shared.Maths
{
public static unsafe partial class NumericsHelpers
{
#region Max
/// <summary>
/// Gets the maximum number between a and b and stores the result in a.
/// </summary>
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Max(Span<float> a, ReadOnlySpan<float> b)
{
Max(a, b, a);
}
/// <summary>
/// Gets the maximum number between a and b and stores the result in s.
/// </summary>
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Max(ReadOnlySpan<float> a, ReadOnlySpan<float> b, Span<float> s)
{
if (a.Length != b.Length || a.Length != s.Length)
throw new ArgumentException("Length of arrays must be the same!");
if (Enabled)
{
if(AvxEnabled && LengthValid256Single(a.Length))
{
MaxAvx(a, b, s);
return;
}
if (LengthValid128Single(a.Length))
{
if (Sse.IsSupported)
{
MaxSse(a, b, s);
return;
}
if (AdvSimd.IsSupported)
{
MaxAdvSimd(a, b, s);
return;
}
}
}
MaxNaive(a, b, s, 0, a.Length);
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxNaive(ReadOnlySpan<float> a, ReadOnlySpan<float> b, Span<float> s, int start, int end)
{
for (var i = start; i < end; i++)
{
s[i] = MathF.Max(a[i], b[i]);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxSse(ReadOnlySpan<float> a, ReadOnlySpan<float> b, Span<float> s)
{
var remainder = a.Length & 3;
var length = a.Length - remainder;
fixed (float* ptr = a)
{
fixed (float* ptrB = b)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 4)
{
var j = Sse.LoadVector128(ptr + i);
var k = Sse.LoadVector128(ptrB + i);
Sse.Store(ptrS + i, Sse.Max(j, k));
}
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxAdvSimd(ReadOnlySpan<float> a, ReadOnlySpan<float> b, Span<float> s)
{
var remainder = a.Length & 3;
var length = a.Length - remainder;
fixed (float* ptr = a)
{
fixed (float* ptrB = b)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 4)
{
var j = AdvSimd.LoadVector128(ptr + i);
var k = AdvSimd.LoadVector128(ptrB + i);
AdvSimd.Store(ptrS + i, AdvSimd.Max(j, k));
}
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxAvx(ReadOnlySpan<float> a, ReadOnlySpan<float> b, Span<float> s)
{
var remainder = a.Length & 7;
var length = a.Length - remainder;
fixed (float* ptr = a)
{
fixed (float* ptrB = b)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 8)
{
var j = Avx.LoadVector256(ptr + i);
var k = Avx.LoadVector256(ptrB + i);
Avx.Store(ptrS + i, Avx.Max(j, k));
}
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
#endregion
#region MaxByScalar
/// <summary>
/// Gets the maximum number between a and b and stores the result in a.
/// </summary>
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Max(Span<float> a, float b)
{
Max(a, b, a);
}
/// <summary>
/// Gets the maximum number between a and b and stores the result in s.
/// </summary>
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
public static void Max(ReadOnlySpan<float> a, float b, Span<float> s)
{
if (a.Length != s.Length)
throw new ArgumentException("Length of arrays must be the same!");
if (Enabled)
{
if (AvxEnabled && LengthValid256Single(a.Length))
{
MaxAvx(a, b, s);
return;
}
if (LengthValid128Single(a.Length))
{
if (Sse.IsSupported)
{
MaxSse(a, b, s);
return;
}
if (AdvSimd.IsSupported)
{
MaxAdvSimd(a, b, s);
return;
}
}
}
MaxNaive(a, b, s, 0, a.Length);
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxNaive(ReadOnlySpan<float> a, float b, Span<float> s, int start, int end)
{
for (var i = start; i < end; i++)
{
s[i] = MathF.Max(a[i], b);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxSse(ReadOnlySpan<float> a, float b, Span<float> s)
{
var remainder = a.Length & 3;
var length = a.Length - remainder;
var scalar = Vector128.Create(b);
fixed (float* ptr = a)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 4)
{
var j = Sse.LoadVector128(ptr + i);
Sse.Store(ptrS + i, Sse.Max(j, scalar));
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxAdvSimd(ReadOnlySpan<float> a, float b, Span<float> s)
{
var remainder = a.Length & 3;
var length = a.Length - remainder;
var scalar = Vector128.Create(b);
fixed (float* ptr = a)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 4)
{
var j = AdvSimd.LoadVector128(ptr + i);
AdvSimd.Store(ptrS + i, AdvSimd.Max(j, scalar));
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
[MethodImpl(MethodImplOptions.AggressiveInlining | MethodImplOptions.AggressiveOptimization)]
private static void MaxAvx(ReadOnlySpan<float> a, float b, Span<float> s)
{
var remainder = a.Length & 7;
var length = a.Length - remainder;
var scalar = Vector256.Create(b);
fixed (float* ptr = a)
{
fixed (float* ptrS = s)
{
for (var i = 0; i < length; i += 8)
{
var j = Avx.LoadVector256(ptr + i);
Avx.Store(ptrS + i, Avx.Max(j, scalar));
}
}
}
if(remainder != 0)
{
MaxNaive(a, b, s, length, a.Length);
}
}
#endregion
}
}