91 lines
3.2 KiB
C#
91 lines
3.2 KiB
C#
using PerfectNumbers.Core.Gpu.Accelerators;
|
|
|
|
namespace PerfectNumbers.Core.Cpu;
|
|
|
|
internal sealed class MersenneCpuDivisorScanSession(PrimeOrderCalculatorAccelerator gpu, ComputationDevice orderDevice) : IMersenneNumberDivisorByDivisorTester.IDivisorScanSession
|
|
{
|
|
private Func<ulong, ulong> _getCycleLength = orderDevice switch
|
|
{
|
|
ComputationDevice.Gpu => divisor => DivisorCycleCache.Shared.GetCycleLengthGpu(gpu, divisor),
|
|
ComputationDevice.Hybrid => divisor => DivisorCycleCache.Shared.GetCycleLengthHybrid(gpu, divisor),
|
|
_ => static (divisor) => DivisorCycleCache.Shared.GetCycleLengthCpu(divisor),
|
|
};
|
|
|
|
public void Configure(PrimeOrderCalculatorAccelerator gpu, ComputationDevice orderDevice)
|
|
{
|
|
_getCycleLength = orderDevice switch
|
|
{
|
|
ComputationDevice.Gpu => divisor => DivisorCycleCache.Shared.GetCycleLengthGpu(gpu, divisor),
|
|
ComputationDevice.Hybrid => divisor => DivisorCycleCache.Shared.GetCycleLengthHybrid(gpu, divisor),
|
|
_ => static (divisor) => DivisorCycleCache.Shared.GetCycleLengthCpu(divisor),
|
|
};
|
|
}
|
|
|
|
public bool CheckDivisor(
|
|
ulong divisor,
|
|
in MontgomeryDivisorData divisorData,
|
|
ulong divisorCycle,
|
|
in ReadOnlySpan<ulong> primes)
|
|
{
|
|
int length = primes.Length;
|
|
// EvenPerfectBitScanner always provides at least one exponent on this path.
|
|
// Keep the guard commented out for tests that might reuse the session differently.
|
|
// if (length == 0)
|
|
// {
|
|
// return false;
|
|
// }
|
|
|
|
// This never kicks off in production code
|
|
// if (divisorData.Modulus != divisor)
|
|
// {
|
|
// throw new InvalidOperationException("Divisor data is for a different modulus");
|
|
// // cachedData = MontgomeryDivisorData.FromModulus(divisor);
|
|
// }
|
|
|
|
if (divisorCycle == 0UL)
|
|
{
|
|
divisorCycle = _getCycleLength(divisor);
|
|
// This never kicks off in production code
|
|
// if (divisorCycle == 0UL)
|
|
// {
|
|
// // DivisorCycleCache guarantees a positive cycle for divisors greater than one.
|
|
// throw new InvalidOperationException($"Divisor cycle solver returned zero for divisor {divisor}.");
|
|
// }
|
|
}
|
|
|
|
// Keep these remainder steppers in place so future updates continue reusing the previously computed residues.
|
|
// They are critical for avoiding repeated full Montgomery exponentiation work when scanning divisors.
|
|
var exponentStepper = new ExponentRemainderStepperCpu(divisorData);
|
|
|
|
var cycleStepper = new CycleRemainderStepper(divisorCycle);
|
|
|
|
bool initialUnity = exponentStepper.InitializeCpuIsUnity(primes[0]);
|
|
ulong remainder = cycleStepper.Initialize(primes[0]);
|
|
if (remainder == 0UL && initialUnity)
|
|
{
|
|
return true;
|
|
}
|
|
|
|
for (int i = 1; i < length; i++)
|
|
{
|
|
remainder = cycleStepper.ComputeNext(primes[i]);
|
|
if (remainder != 0UL)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
if (exponentStepper.ComputeNextIsUnity(primes[i]))
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
public void Return()
|
|
{
|
|
ThreadStaticPools.ReturnMersenneCpuDivisorSession(this);
|
|
}
|
|
}
|