X-Git-Url: https://git.novaco.in/?a=blobdiff_plain;f=Novacoin%2Fuint160.cs;h=e12f10b29330f75126f32c138ebd653ee5d0860c;hb=198c3037b62f2c6007dee4c0a8b0fa41e9225c24;hp=595aa1ae348c1f5ef2178feaa62e0ae1b82403f1;hpb=0beeb4bd4e68e4f0d81832370f2f0388d0d76c65;p=NovacoinLibrary.git diff --git a/Novacoin/uint160.cs b/Novacoin/uint160.cs index 595aa1a..e12f10b 100644 --- a/Novacoin/uint160.cs +++ b/Novacoin/uint160.cs @@ -1,14 +1,30 @@ -using System; -using System.Collections.Generic; +/** + * Novacoin classes library + * Copyright (C) 2015 Alex D. (balthazar.ad@gmail.com) + + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as + * published by the Free Software Foundation, either version 3 of the + * License, or (at your option) any later version. + + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see . + */ + +using System; using System.Diagnostics.Contracts; using System.Linq; -using System.Text; -using System.Threading.Tasks; namespace Novacoin { public class uint160 : base_uint { + #region Access to internal representation new protected int nWidth { get { return base.nWidth; } @@ -19,7 +35,9 @@ namespace Novacoin get { return base.pn; } private set { base.pn = value; } } + #endregion + #region Constructors public uint160() { nWidth = 5; @@ -57,7 +75,21 @@ namespace Novacoin var bytes = Interop.ReverseBytes(Interop.HexToArray(hex)); pn = Interop.ToUInt32Array(bytes); } + #endregion + + #region Cast operators + public static implicit operator uint160(byte[] bytes) + { + return new uint160(bytes); + } + + public static implicit operator uint160(ulong n) + { + return new uint160(n); + } + #endregion + #region Bitwise operations public static uint160 operator ~(uint160 a) { var ret = new uint160(); @@ -68,6 +100,69 @@ namespace Novacoin return ret; } + public static uint160 operator ^(uint160 a, uint160 b) + { + var result = new uint160(); + result.pn = new uint[a.nWidth]; + for (int i = 0; i < result.nWidth; i++) + { + result.pn[i] = a.pn[i] ^ b.pn[i]; + } + return result; + } + + public static uint160 operator &(uint160 a, uint160 b) + { + var result = new uint160(); + result.pn = new uint[a.nWidth]; + for (int i = 0; i < result.nWidth; i++) + { + result.pn[i] = a.pn[i] & b.pn[i]; + } + return result; + } + + public static uint160 operator |(uint160 a, uint160 b) + { + var result = new uint160(); + result.pn = new uint[a.nWidth]; + for (int i = 0; i < result.nWidth; i++) + { + result.pn[i] = a.pn[i] | b.pn[i]; + } + return result; + } + #endregion + + #region Basic arithmetics + public static uint160 operator +(uint160 a, uint160 b) + { + var result = new uint160(); + ulong carry = 0; + for (int i = 0; i < result.nWidth; i++) + { + ulong n = carry + a.pn[i] + b.pn[i]; + result.pn[i] = (uint)(n & 0xffffffff); + carry = n >> 32; + } + return result; + } + + public static uint160 operator +(uint160 a, ulong b) + { + return a + new uint160(b); + } + + public static uint160 operator -(uint160 a, uint160 b) + { + return a + (-b); + } + + public static uint160 operator -(uint160 a, ulong b) + { + return a - new uint160(b); + } + public static uint160 operator -(uint160 a) { var ret = new uint160(); @@ -100,67 +195,164 @@ namespace Novacoin return a; } - public static uint160 operator ^(uint160 a, uint160 b) + public static uint160 operator /(uint160 a, uint divisor) { var result = new uint160(); - result.pn = new uint[a.nWidth]; - for (int i = 0; i < result.nWidth; i++) + + ulong r = 0; + int i = a.nWidth; + + while (i-- > 0) { - result.pn[i] = a.pn[i] ^ b.pn[i]; + r <<= 32; + r |= a.pn[i]; + result.pn[i] = (uint)(r / divisor); + r %= divisor; } + return result; } - public static uint160 operator +(uint160 a, uint160 b) + public static uint160 operator *(uint160 a, ulong multiplier) { var result = new uint160(); - ulong carry = 0; - for (int i = 0; i < result.nWidth; i++) + + ulong c = 0; + uint i = 0; + + do { - ulong n = carry + a.pn[i] + b.pn[i]; - result.pn[i] = (uint)(n & 0xffffffff); - carry = n >> 32; - } + c += a.pn[i] * multiplier; + result.pn[i] = (uint)c; + c >>= 32; + } while (++i < result.nWidth); + return result; } - public static uint160 operator +(uint160 a, ulong b) + public static uint160 operator *(uint160 a, uint160 b) { - return a + new uint160(b); - } + if (!a || !b) + { + // Multiplication by zero results with zero. + return 0; + } + else if (b.bits <= 32) + { + if (b.pn[0] == 1) + { + // If right is 1 then return left operand value + return a; + } - public static uint160 operator -(uint160 a, uint160 b) - { - return a + (-b); + return a * b.pn[0]; + } + else if (a.bits <= 32) + { + if (a.pn[0] == 1) + { + // If left is 1 then return right operand value + return b; + } + + return a * b.pn[0]; + } + + int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0); + int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0); + + uint160 result = new uint160(); + + uint[] left = a.pn.Take(m).ToArray(); + uint[] right = b.pn.Take(n).ToArray(); + + for (int i = 0; i < m; ++i) + { + uint ai = left[i]; + int k = i; + + ulong temp = 0; + for (int j = 0; j < n; ++j) + { + temp = temp + ((ulong)ai) * right[j] + result.pn[k]; + result.pn[k++] = (uint)temp; + temp >>= 32; + } + + while (temp != 0) + { + temp += result.pn[k]; + result.pn[k++] = (uint)temp; + temp >>= 32; + } + } + + return result; } - public static uint160 operator -(uint160 a, ulong b) + public static uint operator %(uint160 a, uint divisor) { - return a - new uint160(b); + ulong r = 0; + int i = a.nWidth; + + while (i-- > 0) + { + r <<= 32; + r |= a.pn[i]; + r %= divisor; + } + + return (uint)r; } - public static uint160 operator &(uint160 a, uint160 b) + public static uint160 operator /(uint160 a, uint160 b) { - var result = new uint160(); - result.pn = new uint[a.nWidth]; - for (int i = 0; i < result.nWidth; i++) + if (b.bits <= 32) { - result.pn[i] = a.pn[i] & b.pn[i]; + return a / b.Low32; } + + uint160 result = new uint160(); + + uint[] quotient; + uint[] remainder_value; + + int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0); + int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0); + + BignumHelper.DivModUnsigned(a.pn.Take(m).ToArray(), b.pn.Take(n).ToArray(), out quotient, out remainder_value); + + quotient.CopyTo(result.pn, 0); + return result; } - public static uint160 operator |(uint160 a, uint160 b) + public static uint160 operator %(uint160 a, uint160 b) { - var result = new uint160(); - result.pn = new uint[a.nWidth]; - for (int i = 0; i < result.nWidth; i++) + if (b.bits <= 32) { - result.pn[i] = a.pn[i] | b.pn[i]; + return a % b.Low32; } + + uint160 result = new uint160(); + + uint[] quotient; + uint[] remainder_value; + + int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0); + int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0); + + BignumHelper.DivModUnsigned(a.pn.Take(m).ToArray(), b.pn.Take(n).ToArray(), out quotient, out remainder_value); + + remainder_value.CopyTo(result.pn, 0); + return result; + } + #endregion + + #region Shift public static uint160 operator <<(uint160 a, int shift) { var result = new uint160(); @@ -204,5 +396,6 @@ namespace Novacoin return result; } + #endregion } }