aaru-dps/Aaru.Checksums
1
0
Fork 0
mirror of https://github.com/aaru-dps/Aaru.Checksums.git synced 2025-12-16 19:24:29 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove redundant parentheses.

Browse Source
This commit is contained in:
Natalia Portillo
2021-08-17 14:27:18 +01:00
parent 7606ab26dd
commit e28d38c8ae
2 changed files with 23 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
ReedSolomon.cs
View File

@@ -203,7 +203,7 @@ namespace Aaru.Checksums
_alphaTo = new int[n + 1]; _alphaTo = new int[n + 1];
_indexOf = new int[n + 1]; _indexOf = new int[n + 1];
_gg = new int[(_nn - _kk) + 1]; _gg = new int[_nn - _kk + 1];
generate_gf(); generate_gf();
gen_poly(); gen_poly();
@@ -349,12 +349,12 @@ namespace Aaru.Checksums
*/ */
for(int j = i - 1; j > 0; j--) for(int j = i - 1; j > 0; j--)
if(_gg[j] != 0) if(_gg[j] != 0)
_gg[j] = _gg[j - 1] ^ _alphaTo[Modnn((_indexOf[_gg[j]] + B0 + i) - 1)]; _gg[j] = _gg[j - 1] ^ _alphaTo[Modnn(_indexOf[_gg[j]] + B0 + i - 1)];
else else
_gg[j] = _gg[j - 1]; _gg[j] = _gg[j - 1];
/* Gg[0] can never be zero */ /* Gg[0] can never be zero */
_gg[0] = _alphaTo[Modnn((_indexOf[_gg[0]] + B0 + i) - 1)]; _gg[0] = _alphaTo[Modnn(_indexOf[_gg[0]] + B0 + i - 1)];
} }
/* convert Gg[] to index form for quicker encoding */ /* convert Gg[] to index form for quicker encoding */
@@ -444,14 +444,14 @@ namespace Aaru.Checksums
int i, j; int i, j;
int q, tmp; int q, tmp;
int[] recd = new int[_nn]; int[] recd = new int[_nn];
int[] lambda = new int[(_nn - _kk) + 1]; /* Err+Eras Locator poly */ int[] lambda = new int[_nn - _kk + 1]; /* Err+Eras Locator poly */
int[] s = new int[(_nn - _kk) + 1]; /* syndrome poly */ int[] s = new int[_nn - _kk + 1]; /* syndrome poly */
int[] b = new int[(_nn - _kk) + 1]; int[] b = new int[_nn - _kk + 1];
int[] t = new int[(_nn - _kk) + 1]; int[] t = new int[_nn - _kk + 1];
int[] omega = new int[(_nn - _kk) + 1]; int[] omega = new int[_nn - _kk + 1];
int[] root = new int[_nn - _kk]; int[] root = new int[_nn - _kk];
int[] reg = new int[(_nn - _kk) + 1]; int[] reg = new int[_nn - _kk + 1];
int[] loc = new int[_nn - _kk]; int[] loc = new int[_nn - _kk];
int count; int count;
/* data[] is in polynomial form, copy and convert to index form */ /* data[] is in polynomial form, copy and convert to index form */
@@ -475,7 +475,7 @@ namespace Aaru.Checksums
for(j = 0; j < _nn; j++) for(j = 0; j < _nn; j++)
if(recd[j] != _a0) /* recd[j] in index form */ if(recd[j] != _a0) /* recd[j] in index form */
tmp ^= _alphaTo[Modnn(recd[j] + (((B0 + i) - 1) * j))]; tmp ^= _alphaTo[Modnn(recd[j] + ((B0 + i - 1) * j))];
synError |= tmp; /* set flag if non-zero syndrome => synError |= tmp; /* set flag if non-zero syndrome =>
* error */ * error */
@@ -554,7 +554,7 @@ namespace Aaru.Checksums
#endif #endif
} }
for(i = 0; i < (_nn - _kk) + 1; i++) for(i = 0; i < _nn - _kk + 1; i++)
b[i] = _indexOf[lambda[i]]; b[i] = _indexOf[lambda[i]];
/* /*
@@ -594,16 +594,16 @@ namespace Aaru.Checksums
else else
t[i + 1] = lambda[i + 1]; t[i + 1] = lambda[i + 1];
if(2 * el <= (r + noEras) - 1) if(2 * el <= r + noEras - 1)
{ {
el = (r + noEras) - el; el = r + noEras - el;
/* /*
* 2 lines below: B(x) <-- inv(discr_r) * * 2 lines below: B(x) <-- inv(discr_r) *
* lambda(x) * lambda(x)
*/ */
for(i = 0; i <= _nn - _kk; i++) for(i = 0; i <= _nn - _kk; i++)
b[i] = lambda[i] == 0 ? _a0 : Modnn((_indexOf[lambda[i]] - discrR) + _nn); b[i] = lambda[i] == 0 ? _a0 : Modnn(_indexOf[lambda[i]] - discrR + _nn);
} }
else else
{ {
@@ -612,14 +612,14 @@ namespace Aaru.Checksums
b[0] = _a0; b[0] = _a0;
} }
Copy(ref lambda, ref t, (_nn - _kk) + 1); Copy(ref lambda, ref t, _nn - _kk + 1);
} }
} }
/* Convert lambda to index form and compute deg(lambda(x)) */ /* Convert lambda to index form and compute deg(lambda(x)) */
int degLambda = 0; int degLambda = 0;
for(i = 0; i < (_nn - _kk) + 1; i++) for(i = 0; i < _nn - _kk + 1; i++)
{ {
lambda[i] = _indexOf[lambda[i]]; lambda[i] = _indexOf[lambda[i]];
@@ -680,9 +680,9 @@ namespace Aaru.Checksums
j = degLambda < i ? degLambda : i; j = degLambda < i ? degLambda : i;
for(; j >= 0; j--) for(; j >= 0; j--)
if(s[(i + 1) - j] != _a0 && if(s[i + 1 - j] != _a0 &&
lambda[j] != _a0) lambda[j] != _a0)
tmp ^= _alphaTo[Modnn(s[(i + 1) - j] + lambda[j])]; tmp ^= _alphaTo[Modnn(s[i + 1 - j] + lambda[j])];
if(tmp != 0) if(tmp != 0)
degOmega = i; degOmega = i;
@@ -721,7 +721,7 @@ namespace Aaru.Checksums
/* Apply error to data */ /* Apply error to data */
if(num1 != 0) if(num1 != 0)
data[loc[j]] ^= _alphaTo[Modnn((_indexOf[num1] + _indexOf[num2] + _nn) - _indexOf[den])]; data[loc[j]] ^= _alphaTo[Modnn(_indexOf[num1] + _indexOf[num2] + _nn - _indexOf[den])];
} }
return count; return count;

2
SpamSumContext.cs
View File

@@ -275,7 +275,7 @@ namespace Aaru.Checksums
result = new byte[FUZZY_MAX_RESULT]; result = new byte[FUZZY_MAX_RESULT];
/* Verify that our elimination was not overeager. */ /* Verify that our elimination was not overeager. */
if(!(bi == 0 || ((ulong)SSDEEP_BS(bi) / 2) * SPAMSUM_LENGTH < _self.TotalSize)) if(!(bi == 0 || (ulong)SSDEEP_BS(bi) / 2 * SPAMSUM_LENGTH < _self.TotalSize))
throw new Exception("Assertion failed"); throw new Exception("Assertion failed");
int resultOff = 0; int resultOff = 0;