public void Mul(ref BigIntegerBuilder regMul)
{
if (regMul._iuLast == 0)
{
Mul(regMul._uSmall);
}
else if (_iuLast != 0)
{
var num = _iuLast + 1;
SetSizeKeep(num + regMul._iuLast, 1);
var num1 = num;
while (true)
{
var num2 = num1 - 1;
num1 = num2;
if (num2 < 0)
{
break;
}
var num3 = _bits[num1];
_bits[num1] = 0;
uint num4 = 0;
for (var i = 0; i <= regMul._iuLast; i++)
{
num4 = AddMulCarry(ref _bits[num1 + i], regMul._bits[i], num3, num4);
}
if (num4 != 0)
{
for (var j = num1 + regMul._iuLast + 1; num4 != 0 && j <= _iuLast; j++)
{
num4 = AddCarry(ref _bits[j], 0, num4);
}
if (num4 != 0)
{
SetSizeKeep(_iuLast + 2, 0);
_bits[_iuLast] = num4;
}
}
}
}
else
{
var num5 = _uSmall;
if (num5 == 1)
{
this = new BigIntegerBuilder(ref regMul);
}
else if (num5 != 0)
{
Load(ref regMul, 1);
Mul(num5);
}
}
}
public void ModDiv(ref BigIntegerBuilder regDen, ref BigIntegerBuilder regQuo)
{
if (regDen._iuLast == 0)
{
regQuo.Set(DivMod(regDen._uSmall));
NumericsHelpers.Swap(ref this, ref regQuo);
return;
}
if (_iuLast == 0)
{
return;
}
ModDivCore(ref this, ref regDen, true, ref regQuo);
}
public void Mod(ref BigIntegerBuilder regDen)
{
if (regDen._iuLast == 0)
{
Set(Mod(ref this, regDen._uSmall));
return;
}
if (_iuLast == 0)
{
return;
}
var bigIntegerBuilder = new BigIntegerBuilder();
ModDivCore(ref this, ref regDen, false, ref bigIntegerBuilder);
}
public BigIntegerBuilder(ref BigIntegerBuilder reg)
{
this = reg;
if (_fWritable)
{
_fWritable = false;
if (_iuLast != 0)
{
reg._fWritable = false;
}
else
{
_bits = null;
}
}
}
public BigIntegerBuilder(ref BigIntegerBuilder reg)
{
this = reg;
if (_fWritable)
{
_fWritable = false;
if (_iuLast != 0)
{
reg._fWritable = false;
}
else
{
_bits = null;
}
}
}
public void Div(ref BigIntegerBuilder regDen)
{
if (regDen._iuLast == 0)
{
DivMod(regDen._uSmall);
return;
}
if (_iuLast == 0)
{
_uSmall = 0;
return;
}
var bigIntegerBuilder = new BigIntegerBuilder();
ModDivCore(ref this, ref regDen, true, ref bigIntegerBuilder);
NumericsHelpers.Swap(ref this, ref bigIntegerBuilder);
}
public void Load(ref BigIntegerBuilder reg, int cuExtra)
{
if (reg._iuLast != 0)
{
if (!_fWritable || _bits.Length <= reg._iuLast)
{
_bits = new uint[reg._iuLast + 1 + cuExtra];
_fWritable = true;
}
_iuLast = reg._iuLast;
Array.Copy(reg._bits, _bits, _iuLast + 1);
}
else
{
_uSmall = reg._uSmall;
_iuLast = 0;
}
}
public static void Gcd(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
if ((reg1._iuLast <= 0 || reg1._bits[0] != 0) && (reg2._iuLast <= 0 || reg2._bits[0] != 0))
{
LehmerGcd(ref reg1, ref reg2);
}
else
{
var num = reg1.MakeOdd();
var num1 = reg2.MakeOdd();
LehmerGcd(ref reg1, ref reg2);
var num2 = Math.Min(num, num1);
if (num2 > 0)
{
reg1.ShiftLeft(num2);
}
}
}
public static uint Mod(ref BigIntegerBuilder regNum, uint num5)
{
if (num5 == 1)
{
return(0);
}
if (regNum._iuLast == 0)
{
return(regNum._uSmall % num5);
}
var num = (ulong)0;
for (var i = regNum._iuLast; i >= 0; i--)
{
num = NumericsHelpers.MakeUlong((uint)num, regNum._bits[i]);
num = num % num5;
}
return((uint)num);
}
public void Add(ref BigIntegerBuilder reg)
{
if (reg._iuLast == 0)
{
Add(reg._uSmall);
return;
}
if (_iuLast == 0)
{
var num = _uSmall;
if (num != 0)
{
Load(ref reg, 1);
Add(num);
}
else
{
this = new BigIntegerBuilder(ref reg);
}
return;
}
EnsureWritable(Math.Max(_iuLast, reg._iuLast) + 1, 1);
var num1 = reg._iuLast + 1;
if (_iuLast < reg._iuLast)
{
num1 = _iuLast + 1;
Array.Copy(reg._bits, _iuLast + 1, _bits, _iuLast + 1, reg._iuLast - _iuLast);
_iuLast = reg._iuLast;
}
uint num2 = 0;
for (var i = 0; i < num1; i++)
{
num2 = AddCarry(ref _bits[i], reg._bits[i], num2);
}
if (num2 != 0)
{
ApplyCarry(num1);
}
}
private void SubRev(ref BigIntegerBuilder reg)
{
EnsureWritable(reg._iuLast + 1, 0);
var num = _iuLast + 1;
if (_iuLast < reg._iuLast)
{
Array.Copy(reg._bits, _iuLast + 1, _bits, _iuLast + 1, reg._iuLast - _iuLast);
_iuLast = reg._iuLast;
}
uint num1 = 0;
for (var i = 0; i < num; i++)
{
num1 = SubRevBorrow(ref _bits[i], reg._bits[i], num1);
}
if (num1 != 0)
{
ApplyBorrow(num);
}
Trim();
}
private static void LehmerGcd(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
var num = 1;
while (true)
{
var num1 = reg1._iuLast + 1;
var num2 = reg2._iuLast + 1;
if (num1 < num2)
{
NumericsHelpers.Swap(ref reg1, ref reg2);
NumericsHelpers.Swap(ref num1, ref num2);
}
if (num2 == 1)
{
if (num1 == 1)
{
reg1._uSmall = NumericsHelpers.GCD(reg1._uSmall, reg2._uSmall);
}
else if (reg2._uSmall != 0)
{
reg1.Set(NumericsHelpers.GCD(Mod(ref reg1, reg2._uSmall), reg2._uSmall));
}
return;
}
if (num1 == 2)
{
break;
}
if (num2 > num1 - 2)
{
var high2 = reg1.GetHigh2(num1);
var high21 = reg2.GetHigh2(num1);
var num3 = NumericsHelpers.CbitHighZero(high2 | high21);
if (num3 > 0)
{
high2 = high2 << (num3 & 63) | reg1._bits[num1 - 3] >> (32 - num3 & 31);
high21 = high21 << (num3 & 63) | reg2._bits[num1 - 3] >> (32 - num3 & 31);
}
if (high2 < high21)
{
NumericsHelpers.Swap(ref high2, ref high21);
NumericsHelpers.Swap(ref reg1, ref reg2);
}
if (high2 == ulong.MaxValue || high21 == ulong.MaxValue)
{
high2 = high2 >> 1;
high21 = high21 >> 1;
}
if (high2 == high21)
{
reg1.Sub(ref num, ref reg2);
}
else if (NumericsHelpers.GetHi(high21) != 0)
{
uint num4 = 1;
uint num5 = 0;
uint num6 = 0;
uint num7 = 1;
while (true)
{
uint num8 = 1;
var num9 = high2 - high21;
while (num9 >= high21 && num8 < 32)
{
num9 = num9 - high21;
num8++;
}
if (num9 >= high21)
{
var num10 = high2 / high21;
if (num10 <= uint.MaxValue)
{
num8 = (uint)num10;
num9 = high2 - num8 * high21;
}
else
{
break;
}
}
var num11 = num4 + num8 * (ulong)num6;
var num12 = num5 + num8 * (ulong)num7;
if (num11 > 2147483647 || num12 > 2147483647)
{
break;
}
else if (num9 < num12 || num9 + num11 > high21 - num6)
{
break;
}
else
{
num4 = (uint)num11;
num5 = (uint)num12;
high2 = num9;
if (high2 > num5)
{
num8 = 1;
num9 = high21 - high2;
while (num9 >= high2 && num8 < 32)
{
num9 = num9 - high2;
num8++;
}
if (num9 >= high2)
{
var num13 = high21 / high2;
if (num13 <= uint.MaxValue)
{
num8 = (uint)num13;
num9 = high21 - num8 * high2;
}
else
{
break;
}
}
num11 = num7 + num8 * (ulong)num5;
num12 = num6 + num8 * (ulong)num4;
if (num11 > 2147483647 || num12 > 2147483647)
{
break;
}
if (num9 < num12 || num9 + num11 > high2 - num5)
{
break;
}
num7 = (uint)num11;
num6 = (uint)num12;
high21 = num9;
if (high21 <= num6)
{
break;
}
}
else
{
break;
}
}
}
if (num5 != 0)
{
reg1.SetSizeKeep(num2, 0);
reg2.SetSizeKeep(num2, 0);
var num14 = 0;
var num15 = 0;
for (var i = 0; i < num2; i++)
{
var num16 = reg1._bits[i];
var num17 = reg2._bits[i];
var num18 = (long)num16 * num4 - (long)num17 * num5 + num14;
var num19 = (long)num17 * num7 - (long)num16 * num6 + num15;
num14 = (int)(num18 >> 32);
num15 = (int)(num19 >> 32);
reg1._bits[i] = (uint)num18;
reg2._bits[i] = (uint)num19;
}
reg1.Trim();
reg2.Trim();
}
else if (high2 / 2 < high21)
{
reg1.Sub(ref num, ref reg2);
}
else
{
reg1.Mod(ref reg2);
}
}
else
{
reg1.Mod(ref reg2);
}
}
else
{
reg1.Mod(ref reg2);
}
}
reg1.Set(NumericsHelpers.GCD(reg1.GetHigh2(2), reg2.GetHigh2(2)));
}
public void Add(ref BigIntegerBuilder reg)
{
if (reg._iuLast == 0)
{
Add(reg._uSmall);
return;
}
if (_iuLast == 0)
{
var num = _uSmall;
if (num != 0)
{
Load(ref reg, 1);
Add(num);
}
else
{
this = new BigIntegerBuilder(ref reg);
}
return;
}
EnsureWritable(Math.Max(_iuLast, reg._iuLast) + 1, 1);
var num1 = reg._iuLast + 1;
if (_iuLast < reg._iuLast)
{
num1 = _iuLast + 1;
Array.Copy(reg._bits, _iuLast + 1, _bits, _iuLast + 1, reg._iuLast - _iuLast);
_iuLast = reg._iuLast;
}
uint num2 = 0;
for (var i = 0; i < num1; i++)
{
num2 = AddCarry(ref _bits[i], reg._bits[i], num2);
}
if (num2 != 0)
{
ApplyCarry(num1);
}
}
public void Div(ref BigIntegerBuilder regDen)
{
if (regDen._iuLast == 0)
{
DivMod(regDen._uSmall);
return;
}
if (_iuLast == 0)
{
_uSmall = 0;
return;
}
var bigIntegerBuilder = new BigIntegerBuilder();
ModDivCore(ref this, ref regDen, true, ref bigIntegerBuilder);
NumericsHelpers.Swap(ref this, ref bigIntegerBuilder);
}
public void Load(ref BigIntegerBuilder reg, int cuExtra)
{
if (reg._iuLast != 0)
{
if (!_fWritable || _bits.Length <= reg._iuLast)
{
_bits = new uint[reg._iuLast + 1 + cuExtra];
_fWritable = true;
}
_iuLast = reg._iuLast;
Array.Copy(reg._bits, _bits, _iuLast + 1);
}
else
{
_uSmall = reg._uSmall;
_iuLast = 0;
}
}
public static void Gcd(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
if ((reg1._iuLast <= 0 || reg1._bits[0] != 0) && (reg2._iuLast <= 0 || reg2._bits[0] != 0))
{
LehmerGcd(ref reg1, ref reg2);
}
else
{
var num = reg1.MakeOdd();
var num1 = reg2.MakeOdd();
LehmerGcd(ref reg1, ref reg2);
var num2 = Math.Min(num, num1);
if (num2 > 0)
{
reg1.ShiftLeft(num2);
}
}
}
private static void LehmerGcd(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
var num = 1;
while (true)
{
var num1 = reg1._iuLast + 1;
var num2 = reg2._iuLast + 1;
if (num1 < num2)
{
NumericsHelpers.Swap(ref reg1, ref reg2);
NumericsHelpers.Swap(ref num1, ref num2);
}
if (num2 == 1)
{
if (num1 == 1)
{
reg1._uSmall = NumericsHelpers.GCD(reg1._uSmall, reg2._uSmall);
}
else if (reg2._uSmall != 0)
{
reg1.Set(NumericsHelpers.GCD(Mod(ref reg1, reg2._uSmall), reg2._uSmall));
}
return;
}
if (num1 == 2)
{
break;
}
if (num2 > num1 - 2)
{
var high2 = reg1.GetHigh2(num1);
var high21 = reg2.GetHigh2(num1);
var num3 = NumericsHelpers.CbitHighZero(high2 | high21);
if (num3 > 0)
{
high2 = high2 << (num3 & 63) | reg1._bits[num1 - 3] >> (32 - num3 & 31);
high21 = high21 << (num3 & 63) | reg2._bits[num1 - 3] >> (32 - num3 & 31);
}
if (high2 < high21)
{
NumericsHelpers.Swap(ref high2, ref high21);
NumericsHelpers.Swap(ref reg1, ref reg2);
}
if (high2 == ulong.MaxValue || high21 == ulong.MaxValue)
{
high2 = high2 >> 1;
high21 = high21 >> 1;
}
if (high2 == high21)
{
reg1.Sub(ref num, ref reg2);
}
else if (NumericsHelpers.GetHi(high21) != 0)
{
uint num4 = 1;
uint num5 = 0;
uint num6 = 0;
uint num7 = 1;
while (true)
{
uint num8 = 1;
var num9 = high2 - high21;
while (num9 >= high21 && num8 < 32)
{
num9 = num9 - high21;
num8++;
}
if (num9 >= high21)
{
var num10 = high2 / high21;
if (num10 <= uint.MaxValue)
{
num8 = (uint)num10;
num9 = high2 - num8 * high21;
}
else
{
break;
}
}
var num11 = num4 + num8 * (ulong)num6;
var num12 = num5 + num8 * (ulong)num7;
if (num11 > 2147483647 || num12 > 2147483647)
{
break;
}
else if (num9 < num12 || num9 + num11 > high21 - num6)
{
break;
}
else
{
num4 = (uint)num11;
num5 = (uint)num12;
high2 = num9;
if (high2 > num5)
{
num8 = 1;
num9 = high21 - high2;
while (num9 >= high2 && num8 < 32)
{
num9 = num9 - high2;
num8++;
}
if (num9 >= high2)
{
var num13 = high21 / high2;
if (num13 <= uint.MaxValue)
{
num8 = (uint)num13;
num9 = high21 - num8 * high2;
}
else
{
break;
}
}
num11 = num7 + num8 * (ulong)num5;
num12 = num6 + num8 * (ulong)num4;
if (num11 > 2147483647 || num12 > 2147483647)
{
break;
}
if (num9 < num12 || num9 + num11 > high2 - num5)
{
break;
}
num7 = (uint)num11;
num6 = (uint)num12;
high21 = num9;
if (high21 <= num6)
{
break;
}
}
else
{
break;
}
}
}
if (num5 != 0)
{
reg1.SetSizeKeep(num2, 0);
reg2.SetSizeKeep(num2, 0);
var num14 = 0;
var num15 = 0;
for (var i = 0; i < num2; i++)
{
var num16 = reg1._bits[i];
var num17 = reg2._bits[i];
var num18 = (long)num16 * num4 - (long)num17 * num5 + num14;
var num19 = (long)num17 * num7 - (long)num16 * num6 + num15;
num14 = (int)(num18 >> 32);
num15 = (int)(num19 >> 32);
reg1._bits[i] = (uint)num18;
reg2._bits[i] = (uint)num19;
}
reg1.Trim();
reg2.Trim();
}
else if (high2 / 2 < high21)
{
reg1.Sub(ref num, ref reg2);
}
else
{
reg1.Mod(ref reg2);
}
}
else
{
reg1.Mod(ref reg2);
}
}
else
{
reg1.Mod(ref reg2);
}
}
reg1.Set(NumericsHelpers.GCD(reg1.GetHigh2(2), reg2.GetHigh2(2)));
}
public void ModDiv(ref BigIntegerBuilder regDen, ref BigIntegerBuilder regQuo)
{
if (regDen._iuLast == 0)
{
regQuo.Set(DivMod(regDen._uSmall));
NumericsHelpers.Swap(ref this, ref regQuo);
return;
}
if (_iuLast == 0)
{
return;
}
ModDivCore(ref this, ref regDen, true, ref regQuo);
}
public void Mod(ref BigIntegerBuilder regDen)
{
if (regDen._iuLast == 0)
{
Set(Mod(ref this, regDen._uSmall));
return;
}
if (_iuLast == 0)
{
return;
}
var bigIntegerBuilder = new BigIntegerBuilder();
ModDivCore(ref this, ref regDen, false, ref bigIntegerBuilder);
}
public static uint Mod(ref BigIntegerBuilder regNum, uint num5)
{
if (num5 == 1)
{
return 0;
}
if (regNum._iuLast == 0)
{
return regNum._uSmall % num5;
}
var num = (ulong)0;
for (var i = regNum._iuLast; i >= 0; i--)
{
num = NumericsHelpers.MakeUlong((uint)num, regNum._bits[i]);
num = num % num5;
}
return (uint)num;
}
public void Load(ref BigIntegerBuilder reg)
{
Load(ref reg, 0);
}
private void SubRev(ref BigIntegerBuilder reg)
{
EnsureWritable(reg._iuLast + 1, 0);
var num = _iuLast + 1;
if (_iuLast < reg._iuLast)
{
Array.Copy(reg._bits, _iuLast + 1, _bits, _iuLast + 1, reg._iuLast - _iuLast);
_iuLast = reg._iuLast;
}
uint num1 = 0;
for (var i = 0; i < num; i++)
{
num1 = SubRevBorrow(ref _bits[i], reg._bits[i], num1);
}
if (num1 != 0)
{
ApplyBorrow(num);
}
Trim();
}
private static void ModDivCore(ref BigIntegerBuilder regNum, ref BigIntegerBuilder regDen, bool fQuo, ref BigIntegerBuilder regQuo)
{
regQuo.Set(0);
if (regNum._iuLast < regDen._iuLast)
{
return;
}
var num1 = regDen._iuLast + 1;
var num2 = regNum._iuLast - regDen._iuLast;
var num3 = num2;
var num4 = regNum._iuLast;
while (true)
{
if (num4 < num2)
{
num3++;
break;
}
if (regDen._bits[num4 - num2] == regNum._bits[num4])
{
num4--;
}
else
{
if (regDen._bits[num4 - num2] < regNum._bits[num4])
{
num3++;
}
break;
}
}
if (num3 == 0)
{
return;
}
if (fQuo)
{
regQuo.SetSizeLazy(num3);
}
var num5 = regDen._bits[num1 - 1];
var num6 = regDen._bits[num1 - 2];
var num7 = NumericsHelpers.CbitHighZero(num5);
var num8 = 32 - num7;
if (num7 > 0)
{
num5 = num5 << (num7 & 31) | num6 >> (num8 & 31);
num6 = num6 << (num7 & 31);
if (num1 > 2)
{
num6 = num6 | regDen._bits[num1 - 3] >> (num8 & 31);
}
}
regNum.EnsureWritable();
var num9 = num3;
while (true)
{
var num10 = num9 - 1;
num9 = num10;
if (num10 < 0)
{
break;
}
var num = num9 + num1 > regNum._iuLast ? 0 : regNum._bits[num9 + num1];
var num11 = num;
var num12 = NumericsHelpers.MakeUlong(num11, regNum._bits[num9 + num1 - 1]);
var num13 = regNum._bits[num9 + num1 - 2];
if (num7 > 0)
{
num12 = num12 << (num7 & 63) | num13 >> (num8 & 31);
num13 = num13 << (num7 & 31);
if (num9 + num1 >= 3)
{
num13 = num13 | regNum._bits[num9 + num1 - 3] >> (num8 & 31);
}
}
var num14 = num12 / num5;
var num15 = (ulong)((uint)(num12 % num5));
if (num14 > uint.MaxValue)
{
num15 += num5 * (num14 - uint.MaxValue);
num14 = uint.MaxValue;
}
while (num15 <= uint.MaxValue && num14 * num6 > NumericsHelpers.MakeUlong((uint)num15, num13))
{
num14--;
num15 += num5;
}
if (num14 > 0)
{
var num16 = (ulong)0;
for (var i = 0; i < num1; i++)
{
num16 = num16 + regDen._bits[i] * num14;
var num17 = (uint)num16;
num16 = num16 >> 32;
if (regNum._bits[num9 + i] < num17)
{
num16 = num16 + 1;
}
regNum._bits[num9 + i] = regNum._bits[num9 + i] - num17;
}
if (num11 < num16)
{
uint num18 = 0;
for (var j = 0; j < num1; j++)
{
num18 = AddCarry(ref regNum._bits[num9 + j], regDen._bits[j], num18);
}
num14 = num14 - 1;
}
regNum._iuLast = num9 + num1 - 1;
}
if (fQuo)
{
if (num3 != 1)
{
regQuo._bits[num9] = (uint)num14;
}
else
{
regQuo._uSmall = (uint)num14;
}
}
}
regNum._iuLast = num1 - 1;
regNum.Trim();
}
public void Load(ref BigIntegerBuilder reg)
{
Load(ref reg, 0);
}
public void Mul(ref BigIntegerBuilder regMul)
{
if (regMul._iuLast == 0)
{
Mul(regMul._uSmall);
}
else if (_iuLast != 0)
{
var num = _iuLast + 1;
SetSizeKeep(num + regMul._iuLast, 1);
var num1 = num;
while (true)
{
var num2 = num1 - 1;
num1 = num2;
if (num2 < 0)
{
break;
}
var num3 = _bits[num1];
_bits[num1] = 0;
uint num4 = 0;
for (var i = 0; i <= regMul._iuLast; i++)
{
num4 = AddMulCarry(ref _bits[num1 + i], regMul._bits[i], num3, num4);
}
if (num4 != 0)
{
for (var j = num1 + regMul._iuLast + 1; num4 != 0 && j <= _iuLast; j++)
{
num4 = AddCarry(ref _bits[j], 0, num4);
}
if (num4 != 0)
{
SetSizeKeep(_iuLast + 2, 0);
_bits[_iuLast] = num4;
}
}
}
}
else
{
var num5 = _uSmall;
if (num5 == 1)
{
this = new BigIntegerBuilder(ref regMul);
}
else if (num5 != 0)
{
Load(ref regMul, 1);
Mul(num5);
}
}
}
public void Mul(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
if (reg1._iuLast == 0)
{
if (reg2._iuLast != 0)
{
Load(ref reg2, 1);
Mul(reg1._uSmall);
}
else
{
Set(reg1._uSmall * (ulong)reg2._uSmall);
}
}
else if (reg2._iuLast != 0)
{
SetSizeClear(reg1._iuLast + reg2._iuLast + 2);
uint[] numArray;
uint[] numArray1;
int num;
int num1;
if (reg1.CuNonZero > reg2.CuNonZero)
{
numArray = reg2._bits;
num = reg2._iuLast + 1;
numArray1 = reg1._bits;
num1 = reg1._iuLast + 1;
}
else
{
numArray = reg1._bits;
num = reg1._iuLast + 1;
numArray1 = reg2._bits;
num1 = reg2._iuLast + 1;
}
for (var i = 0; i < num; i++)
{
var num2 = numArray[i];
if (num2 != 0)
{
uint num3 = 0;
var num4 = i;
var num5 = 0;
while (num5 < num1)
{
num3 = AddMulCarry(ref _bits[num4], num2, numArray1[num5], num3);
num5++;
num4++;
}
while (num3 != 0)
{
var num6 = num4;
num4 = num6 + 1;
num3 = AddCarry(ref _bits[num6], 0, num3);
}
}
}
Trim();
}
else
{
Load(ref reg1, 1);
Mul(reg2._uSmall);
}
}
private static void ModDivCore(ref BigIntegerBuilder regNum, ref BigIntegerBuilder regDen, bool fQuo, ref BigIntegerBuilder regQuo)
{
regQuo.Set(0);
if (regNum._iuLast < regDen._iuLast)
{
return;
}
var num1 = regDen._iuLast + 1;
var num2 = regNum._iuLast - regDen._iuLast;
var num3 = num2;
var num4 = regNum._iuLast;
while (true)
{
if (num4 < num2)
{
num3++;
break;
}
if (regDen._bits[num4 - num2] == regNum._bits[num4])
{
num4--;
}
else
{
if (regDen._bits[num4 - num2] < regNum._bits[num4])
{
num3++;
}
break;
}
}
if (num3 == 0)
{
return;
}
if (fQuo)
{
regQuo.SetSizeLazy(num3);
}
var num5 = regDen._bits[num1 - 1];
var num6 = regDen._bits[num1 - 2];
var num7 = NumericsHelpers.CbitHighZero(num5);
var num8 = 32 - num7;
if (num7 > 0)
{
num5 = num5 << (num7 & 31) | num6 >> (num8 & 31);
num6 = num6 << (num7 & 31);
if (num1 > 2)
{
num6 = num6 | regDen._bits[num1 - 3] >> (num8 & 31);
}
}
regNum.EnsureWritable();
var num9 = num3;
while (true)
{
var num10 = num9 - 1;
num9 = num10;
if (num10 < 0)
{
break;
}
var num = num9 + num1 > regNum._iuLast ? 0 : regNum._bits[num9 + num1];
var num11 = num;
var num12 = NumericsHelpers.MakeUlong(num11, regNum._bits[num9 + num1 - 1]);
var num13 = regNum._bits[num9 + num1 - 2];
if (num7 > 0)
{
num12 = num12 << (num7 & 63) | num13 >> (num8 & 31);
num13 = num13 << (num7 & 31);
if (num9 + num1 >= 3)
{
num13 = num13 | regNum._bits[num9 + num1 - 3] >> (num8 & 31);
}
}
var num14 = num12 / num5;
var num15 = (ulong)((uint)(num12 % num5));
if (num14 > uint.MaxValue)
{
num15 += num5 * (num14 - uint.MaxValue);
num14 = uint.MaxValue;
}
while (num15 <= uint.MaxValue && num14 * num6 > NumericsHelpers.MakeUlong((uint)num15, num13))
{
num14--;
num15 += num5;
}
if (num14 > 0)
{
var num16 = (ulong)0;
for (var i = 0; i < num1; i++)
{
num16 = num16 + regDen._bits[i] * num14;
var num17 = (uint)num16;
num16 = num16 >> 32;
if (regNum._bits[num9 + i] < num17)
{
num16 = num16 + 1;
}
regNum._bits[num9 + i] = regNum._bits[num9 + i] - num17;
}
if (num11 < num16)
{
uint num18 = 0;
for (var j = 0; j < num1; j++)
{
num18 = AddCarry(ref regNum._bits[num9 + j], regDen._bits[j], num18);
}
num14 = num14 - 1;
}
regNum._iuLast = num9 + num1 - 1;
}
if (fQuo)
{
if (num3 != 1)
{
regQuo._bits[num9] = (uint)num14;
}
else
{
regQuo._uSmall = (uint)num14;
}
}
}
regNum._iuLast = num1 - 1;
regNum.Trim();
}
public void Sub(ref int sign, ref BigIntegerBuilder reg)
{
if (reg._iuLast == 0)
{
Sub(ref sign, reg._uSmall);
return;
}
if (_iuLast == 0)
{
var num = _uSmall;
if (num != 0)
{
Load(ref reg);
Sub(ref sign, num);
}
else
{
this = new BigIntegerBuilder(ref reg);
}
sign = -sign;
return;
}
if (_iuLast < reg._iuLast)
{
SubRev(ref reg);
sign = -sign;
return;
}
var num1 = reg._iuLast + 1;
if (_iuLast == reg._iuLast)
{
_iuLast = BigInteger.GetDiffLength(_bits, reg._bits, _iuLast + 1) - 1;
if (_iuLast < 0)
{
_iuLast = 0;
_uSmall = 0;
return;
}
var num2 = _bits[_iuLast];
var num3 = reg._bits[_iuLast];
if (_iuLast == 0)
{
if (num2 >= num3)
{
_uSmall = num2 - num3;
}
else
{
_uSmall = num3 - num2;
sign = -sign;
}
return;
}
if (num2 < num3)
{
reg._iuLast = _iuLast;
SubRev(ref reg);
reg._iuLast = num1 - 1;
sign = -sign;
return;
}
num1 = _iuLast + 1;
}
EnsureWritable();
uint num4 = 0;
for (var i = 0; i < num1; i++)
{
num4 = SubBorrow(ref _bits[i], reg._bits[i], num4);
}
if (num4 != 0)
{
ApplyBorrow(num1);
}
Trim();
}
public void Mul(ref BigIntegerBuilder reg1, ref BigIntegerBuilder reg2)
{
if (reg1._iuLast == 0)
{
if (reg2._iuLast != 0)
{
Load(ref reg2, 1);
Mul(reg1._uSmall);
}
else
{
Set(reg1._uSmall * (ulong)reg2._uSmall);
}
}
else if (reg2._iuLast != 0)
{
SetSizeClear(reg1._iuLast + reg2._iuLast + 2);
uint[] numArray;
uint[] numArray1;
int num;
int num1;
if (reg1.CuNonZero > reg2.CuNonZero)
{
numArray = reg2._bits;
num = reg2._iuLast + 1;
numArray1 = reg1._bits;
num1 = reg1._iuLast + 1;
}
else
{
numArray = reg1._bits;
num = reg1._iuLast + 1;
numArray1 = reg2._bits;
num1 = reg2._iuLast + 1;
}
for (var i = 0; i < num; i++)
{
var num2 = numArray[i];
if (num2 != 0)
{
uint num3 = 0;
var num4 = i;
var num5 = 0;
while (num5 < num1)
{
num3 = AddMulCarry(ref _bits[num4], num2, numArray1[num5], num3);
num5++;
num4++;
}
while (num3 != 0)
{
var num6 = num4;
num4 = num6 + 1;
num3 = AddCarry(ref _bits[num6], 0, num3);
}
}
}
Trim();
}
else
{
Load(ref reg1, 1);
Mul(reg2._uSmall);
}
}
public void Sub(ref int sign, ref BigIntegerBuilder reg)
{
if (reg._iuLast == 0)
{
Sub(ref sign, reg._uSmall);
return;
}
if (_iuLast == 0)
{
var num = _uSmall;
if (num != 0)
{
Load(ref reg);
Sub(ref sign, num);
}
else
{
this = new BigIntegerBuilder(ref reg);
}
sign = -sign;
return;
}
if (_iuLast < reg._iuLast)
{
SubRev(ref reg);
sign = -sign;
return;
}
var num1 = reg._iuLast + 1;
if (_iuLast == reg._iuLast)
{
_iuLast = BigInteger.GetDiffLength(_bits, reg._bits, _iuLast + 1) - 1;
if (_iuLast < 0)
{
_iuLast = 0;
_uSmall = 0;
return;
}
var num2 = _bits[_iuLast];
var num3 = reg._bits[_iuLast];
if (_iuLast == 0)
{
if (num2 >= num3)
{
_uSmall = num2 - num3;
}
else
{
_uSmall = num3 - num2;
sign = -sign;
}
return;
}
if (num2 < num3)
{
reg._iuLast = _iuLast;
SubRev(ref reg);
reg._iuLast = num1 - 1;
sign = -sign;
return;
}
num1 = _iuLast + 1;
}
EnsureWritable();
uint num4 = 0;
for (var i = 0; i < num1; i++)
{
num4 = SubBorrow(ref _bits[i], reg._bits[i], num4);
}
if (num4 != 0)
{
ApplyBorrow(num1);
}
Trim();
}
