mirror of
https://github.com/ShareX/ShareX.git
synced 2024-08-19 12:11:52 +12:00
152 lines
No EOL
4.4 KiB
C#
152 lines
No EOL
4.4 KiB
C#
#region License Information (GPL v3)
|
|
|
|
/*
|
|
ShareX - A program that allows you to take screenshots and share any file type
|
|
Copyright (c) 2007-2018 ShareX Team
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
Optionally you can also view the license at <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#endregion License Information (GPL v3)
|
|
|
|
using System.Security.Cryptography;
|
|
|
|
namespace ShareX.HelpersLib
|
|
{
|
|
// http://damieng.com/blog/2006/08/08/calculating_crc32_in_c_and_net
|
|
public class Crc32 : HashAlgorithm
|
|
{
|
|
public const uint DefaultPolynomial = 0xedb88320;
|
|
public const uint DefaultSeed = 0xffffffff;
|
|
|
|
private uint hash;
|
|
private uint seed;
|
|
private uint[] table;
|
|
private static uint[] defaultTable;
|
|
|
|
public Crc32()
|
|
{
|
|
table = InitializeTable(DefaultPolynomial);
|
|
seed = DefaultSeed;
|
|
Initialize();
|
|
}
|
|
|
|
public Crc32(uint polynomial, uint seed)
|
|
{
|
|
table = InitializeTable(polynomial);
|
|
this.seed = seed;
|
|
Initialize();
|
|
}
|
|
|
|
public override void Initialize()
|
|
{
|
|
hash = seed;
|
|
}
|
|
|
|
protected override void HashCore(byte[] buffer, int start, int length)
|
|
{
|
|
hash = CalculateHash(table, hash, buffer, start, length);
|
|
}
|
|
|
|
protected override byte[] HashFinal()
|
|
{
|
|
byte[] hashBuffer = uintToBigEndianBytes(~hash);
|
|
HashValue = hashBuffer;
|
|
return hashBuffer;
|
|
}
|
|
|
|
public override int HashSize
|
|
{
|
|
get
|
|
{
|
|
return 32;
|
|
}
|
|
}
|
|
|
|
public static uint Compute(byte[] buffer)
|
|
{
|
|
return ~CalculateHash(InitializeTable(DefaultPolynomial), DefaultSeed, buffer, 0, buffer.Length);
|
|
}
|
|
|
|
public static uint Compute(uint seed, byte[] buffer)
|
|
{
|
|
return ~CalculateHash(InitializeTable(DefaultPolynomial), seed, buffer, 0, buffer.Length);
|
|
}
|
|
|
|
public static uint Compute(uint polynomial, uint seed, byte[] buffer)
|
|
{
|
|
return ~CalculateHash(InitializeTable(polynomial), seed, buffer, 0, buffer.Length);
|
|
}
|
|
|
|
private static uint[] InitializeTable(uint polynomial)
|
|
{
|
|
if (polynomial == DefaultPolynomial && defaultTable != null)
|
|
{
|
|
return defaultTable;
|
|
}
|
|
|
|
uint[] createTable = new uint[256];
|
|
for (int i = 0; i < 256; i++)
|
|
{
|
|
uint entry = (uint)i;
|
|
for (int j = 0; j < 8; j++)
|
|
{
|
|
if ((entry & 1) == 1)
|
|
{
|
|
entry = (entry >> 1) ^ polynomial;
|
|
}
|
|
else
|
|
{
|
|
entry = entry >> 1;
|
|
}
|
|
}
|
|
createTable[i] = entry;
|
|
}
|
|
|
|
if (polynomial == DefaultPolynomial)
|
|
{
|
|
defaultTable = createTable;
|
|
}
|
|
|
|
return createTable;
|
|
}
|
|
|
|
private static uint CalculateHash(uint[] table, uint seed, byte[] buffer, int start, int size)
|
|
{
|
|
uint crc = seed;
|
|
for (int i = start; i < size; i++)
|
|
{
|
|
unchecked
|
|
{
|
|
crc = (crc >> 8) ^ table[buffer[i] ^ crc & 0xff];
|
|
}
|
|
}
|
|
return crc;
|
|
}
|
|
|
|
private byte[] uintToBigEndianBytes(uint x)
|
|
{
|
|
return new byte[]
|
|
{
|
|
(byte)((x >> 24) & 0xff),
|
|
(byte)((x >> 16) & 0xff),
|
|
(byte)((x >> 8) & 0xff),
|
|
(byte)(x & 0xff)
|
|
};
|
|
}
|
|
}
|
|
} |