mirror of
https://github.com/aaru-dps/Aaru.git
synced 2025-12-16 19:24:25 +00:00
[Aaru.Checksums] Reformat and cleanup.
This commit is contained in:
@@ -60,7 +60,7 @@ static class Neon
|
||||
uint s1 = preSum1;
|
||||
uint s2 = preSum2;
|
||||
|
||||
int bufPos = 0;
|
||||
var bufPos = 0;
|
||||
|
||||
/*
|
||||
* Process the data in blocks.
|
||||
@@ -81,8 +81,8 @@ static class Neon
|
||||
* Process n blocks of data. At most NMAX data bytes can be
|
||||
* processed before s2 must be reduced modulo FLETCHER_MODULE.
|
||||
*/
|
||||
Vector128<uint> v_s2 = Vector128.Create(s1 * n, 0, 0, 0);
|
||||
Vector128<uint> v_s1 = Vector128.Create(0u, 0, 0, 0);
|
||||
var v_s2 = Vector128.Create(s1 * n, 0, 0, 0);
|
||||
var v_s1 = Vector128.Create(0u, 0, 0, 0);
|
||||
Vector128<ushort> v_column_sum_1 = AdvSimd.DuplicateToVector128((ushort)0);
|
||||
Vector128<ushort> v_column_sum_2 = AdvSimd.DuplicateToVector128((ushort)0);
|
||||
Vector128<ushort> v_column_sum_3 = AdvSimd.DuplicateToVector128((ushort)0);
|
||||
@@ -93,21 +93,21 @@ static class Neon
|
||||
/*
|
||||
* Load 32 input bytes.
|
||||
*/
|
||||
Vector128<byte> bytes1 = Vector128.Create(buf[bufPos], buf[bufPos + 1], buf[bufPos + 2],
|
||||
buf[bufPos + 3], buf[bufPos + 4], buf[bufPos + 5],
|
||||
buf[bufPos + 6], buf[bufPos + 7], buf[bufPos + 8],
|
||||
buf[bufPos + 9], buf[bufPos + 10], buf[bufPos + 11],
|
||||
buf[bufPos + 12], buf[bufPos + 13], buf[bufPos + 14],
|
||||
buf[bufPos + 15]);
|
||||
var bytes1 = Vector128.Create(buf[bufPos], buf[bufPos + 1], buf[bufPos + 2],
|
||||
buf[bufPos + 3], buf[bufPos + 4], buf[bufPos + 5],
|
||||
buf[bufPos + 6], buf[bufPos + 7], buf[bufPos + 8],
|
||||
buf[bufPos + 9], buf[bufPos + 10], buf[bufPos + 11],
|
||||
buf[bufPos + 12], buf[bufPos + 13], buf[bufPos + 14],
|
||||
buf[bufPos + 15]);
|
||||
|
||||
bufPos += 16;
|
||||
|
||||
Vector128<byte> bytes2 = Vector128.Create(buf[bufPos], buf[bufPos + 1], buf[bufPos + 2],
|
||||
buf[bufPos + 3], buf[bufPos + 4], buf[bufPos + 5],
|
||||
buf[bufPos + 6], buf[bufPos + 7], buf[bufPos + 8],
|
||||
buf[bufPos + 9], buf[bufPos + 10], buf[bufPos + 11],
|
||||
buf[bufPos + 12], buf[bufPos + 13], buf[bufPos + 14],
|
||||
buf[bufPos + 15]);
|
||||
var bytes2 = Vector128.Create(buf[bufPos], buf[bufPos + 1], buf[bufPos + 2],
|
||||
buf[bufPos + 3], buf[bufPos + 4], buf[bufPos + 5],
|
||||
buf[bufPos + 6], buf[bufPos + 7], buf[bufPos + 8],
|
||||
buf[bufPos + 9], buf[bufPos + 10], buf[bufPos + 11],
|
||||
buf[bufPos + 12], buf[bufPos + 13], buf[bufPos + 14],
|
||||
buf[bufPos + 15]);
|
||||
|
||||
bufPos += 16;
|
||||
/*
|
||||
@@ -167,7 +167,7 @@ static class Neon
|
||||
*/
|
||||
Vector64<uint> sum1 = AdvSimd.AddPairwise(v_s1.GetLower(), v_s1.GetUpper());
|
||||
Vector64<uint> sum2 = AdvSimd.AddPairwise(v_s2.GetLower(), v_s2.GetUpper());
|
||||
Vector64<uint> s1s2 = AdvSimd.AddPairwise(sum1, sum2);
|
||||
Vector64<uint> s1s2 = AdvSimd.AddPairwise(sum1, sum2);
|
||||
s1 += AdvSimd.Extract(s1s2, 0);
|
||||
s2 += AdvSimd.Extract(s1s2, 1);
|
||||
/*
|
||||
@@ -204,9 +204,7 @@ static class Neon
|
||||
}
|
||||
|
||||
while(len-- != 0)
|
||||
{
|
||||
s2 += s1 += buf[bufPos++];
|
||||
}
|
||||
|
||||
if(s1 >= Fletcher32Context.FLETCHER_MODULE)
|
||||
s1 -= Fletcher32Context.FLETCHER_MODULE;
|
||||
|
||||
@@ -57,7 +57,7 @@ static class Ssse3
|
||||
{
|
||||
uint s1 = sum1;
|
||||
uint s2 = sum2;
|
||||
int bufPos = 0;
|
||||
var bufPos = 0;
|
||||
|
||||
/*
|
||||
* Process the data in blocks.
|
||||
@@ -78,33 +78,33 @@ static class Ssse3
|
||||
Vector128<byte> tap1 = Vector128.Create(32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17).
|
||||
AsByte();
|
||||
|
||||
Vector128<byte> tap2 = Vector128.Create(16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1).AsByte();
|
||||
Vector128<byte> zero = Vector128.Create(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0).AsByte();
|
||||
Vector128<short> ones = Vector128.Create(1, 1, 1, 1, 1, 1, 1, 1);
|
||||
Vector128<byte> tap2 = Vector128.Create(16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1).AsByte();
|
||||
Vector128<byte> zero = Vector128.Create(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0).AsByte();
|
||||
var ones = Vector128.Create(1, 1, 1, 1, 1, 1, 1, 1);
|
||||
/*
|
||||
* Process n blocks of data. At most NMAX data bytes can be
|
||||
* processed before s2 must be reduced modulo BASE.
|
||||
*/
|
||||
Vector128<uint> v_ps = Vector128.Create(s1 * n, 0, 0, 0);
|
||||
Vector128<uint> v_s2 = Vector128.Create(s2, 0, 0, 0);
|
||||
Vector128<uint> v_s1 = Vector128.Create(0u, 0, 0, 0);
|
||||
var v_ps = Vector128.Create(s1 * n, 0, 0, 0);
|
||||
var v_s2 = Vector128.Create(s2, 0, 0, 0);
|
||||
var v_s1 = Vector128.Create(0u, 0, 0, 0);
|
||||
|
||||
do
|
||||
{
|
||||
/*
|
||||
* Load 32 input bytes.
|
||||
*/
|
||||
Vector128<uint> bytes1 = Vector128.Create(BitConverter.ToUInt32(buf, bufPos),
|
||||
BitConverter.ToUInt32(buf, bufPos + 4),
|
||||
BitConverter.ToUInt32(buf, bufPos + 8),
|
||||
BitConverter.ToUInt32(buf, bufPos + 12));
|
||||
var bytes1 = Vector128.Create(BitConverter.ToUInt32(buf, bufPos),
|
||||
BitConverter.ToUInt32(buf, bufPos + 4),
|
||||
BitConverter.ToUInt32(buf, bufPos + 8),
|
||||
BitConverter.ToUInt32(buf, bufPos + 12));
|
||||
|
||||
bufPos += 16;
|
||||
|
||||
Vector128<uint> bytes2 = Vector128.Create(BitConverter.ToUInt32(buf, bufPos),
|
||||
BitConverter.ToUInt32(buf, bufPos + 4),
|
||||
BitConverter.ToUInt32(buf, bufPos + 8),
|
||||
BitConverter.ToUInt32(buf, bufPos + 12));
|
||||
var bytes2 = Vector128.Create(BitConverter.ToUInt32(buf, bufPos),
|
||||
BitConverter.ToUInt32(buf, bufPos + 4),
|
||||
BitConverter.ToUInt32(buf, bufPos + 8),
|
||||
BitConverter.ToUInt32(buf, bufPos + 12));
|
||||
|
||||
bufPos += 16;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user