2017-05-19 20:28:49 +01:00
|
|
|
// /***************************************************************************
|
2020-02-27 12:31:22 +00:00
|
|
|
// Aaru Data Preservation Suite
|
2016-07-28 18:13:49 +01:00
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// Filename : FletcherContext.cs
|
|
|
|
|
// Author(s) : Natalia Portillo <claunia@claunia.com>
|
|
|
|
|
//
|
|
|
|
|
// Component : Checksums.
|
|
|
|
|
//
|
|
|
|
|
// --[ Description ] ----------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// Implements Fletcher-32 and Fletcher-16 algorithms.
|
|
|
|
|
//
|
|
|
|
|
// --[ License ] --------------------------------------------------------------
|
|
|
|
|
//
|
|
|
|
|
// This library is free software; you can redistribute it and/or modify
|
|
|
|
|
// it under the terms of the GNU Lesser General Public License as
|
|
|
|
|
// published by the Free Software Foundation; either version 2.1 of the
|
|
|
|
|
// License, or (at your option) any later version.
|
|
|
|
|
//
|
|
|
|
|
// This library 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
|
|
|
|
|
// Lesser General Public License for more details.
|
|
|
|
|
//
|
|
|
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
|
|
|
// License along with this library; if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
//
|
|
|
|
|
// ----------------------------------------------------------------------------
|
2022-02-18 10:02:36 +00:00
|
|
|
// Copyright © 2011-2022 Natalia Portillo
|
2016-07-28 18:13:49 +01:00
|
|
|
// ****************************************************************************/
|
2015-11-30 23:00:47 +00:00
|
|
|
|
|
|
|
|
// Disabled because the speed is abnormally slow
|
2018-02-03 17:01:17 +00:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
namespace Aaru.Checksums;
|
|
|
|
|
|
2021-10-14 01:38:59 +01:00
|
|
|
using System;
|
2015-10-05 18:58:13 +01:00
|
|
|
using System.IO;
|
2021-10-14 01:38:59 +01:00
|
|
|
using System.Runtime.InteropServices;
|
2017-12-19 19:33:46 +00:00
|
|
|
using System.Text;
|
2020-02-27 00:33:23 +00:00
|
|
|
using Aaru.CommonTypes.Interfaces;
|
2020-07-20 15:43:51 +01:00
|
|
|
using Aaru.Helpers;
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-17 00:21:26 +00:00
|
|
|
/// <inheritdoc />
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Implements the Fletcher-32 algorithm</summary>
|
|
|
|
|
public sealed class Fletcher32Context : IChecksum
|
2015-10-05 18:58:13 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
const ushort FLETCHER_MODULE = 0xFFFF;
|
|
|
|
|
const uint NMAX = 5552;
|
|
|
|
|
readonly IntPtr _nativeContext;
|
|
|
|
|
readonly bool _useNative;
|
|
|
|
|
ushort _sum1, _sum2;
|
|
|
|
|
|
|
|
|
|
/// <summary>Initializes the Fletcher-32 sums</summary>
|
|
|
|
|
public Fletcher32Context()
|
2015-10-05 18:58:13 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
_sum1 = 0xFFFF;
|
|
|
|
|
_sum2 = 0xFFFF;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(!Native.IsSupported)
|
|
|
|
|
return;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
_nativeContext = fletcher32_init();
|
|
|
|
|
_useNative = _nativeContext != IntPtr.Zero;
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Updates the hash with data.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="len">Length of buffer to hash.</param>
|
|
|
|
|
public void Update(byte[] data, uint len) => Step(ref _sum1, ref _sum2, data, len, _useNative, _nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Updates the hash with data.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
public void Update(byte[] data) => Update(data, (uint)data.Length);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Returns a byte array of the hash value.</summary>
|
|
|
|
|
public byte[] Final()
|
|
|
|
|
{
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (uint)((_sum2 << 16) | _sum1);
|
2022-03-06 13:29:37 +00:00
|
|
|
|
|
|
|
|
if(!_useNative)
|
|
|
|
|
return BigEndianBitConverter.GetBytes(finalSum);
|
|
|
|
|
|
|
|
|
|
fletcher32_final(_nativeContext, ref finalSum);
|
|
|
|
|
fletcher32_free(_nativeContext);
|
|
|
|
|
|
|
|
|
|
return BigEndianBitConverter.GetBytes(finalSum);
|
|
|
|
|
}
|
2020-02-29 18:03:33 +00:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Returns a hexadecimal representation of the hash value.</summary>
|
|
|
|
|
public string End()
|
|
|
|
|
{
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (uint)((_sum2 << 16) | _sum1);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(_useNative)
|
|
|
|
|
{
|
2021-10-14 01:38:59 +01:00
|
|
|
fletcher32_final(_nativeContext, ref finalSum);
|
|
|
|
|
fletcher32_free(_nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fletcherOutput = new StringBuilder();
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
for(var i = 0; i < BigEndianBitConverter.GetBytes(finalSum).Length; i++)
|
2022-03-06 13:29:37 +00:00
|
|
|
fletcherOutput.Append(BigEndianBitConverter.GetBytes(finalSum)[i].ToString("x2"));
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return fletcherOutput.ToString();
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern IntPtr fletcher32_init();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern int fletcher32_update(IntPtr ctx, byte[] data, uint len);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern int fletcher32_final(IntPtr ctx, ref uint crc);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern void fletcher32_free(IntPtr ctx);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
static void Step(ref ushort previousSum1, ref ushort previousSum2, byte[] data, uint len, bool useNative,
|
|
|
|
|
IntPtr nativeContext)
|
|
|
|
|
{
|
|
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher32_update(nativeContext, data, len);
|
|
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
}
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:16:13 +00:00
|
|
|
uint sum1 = previousSum1;
|
|
|
|
|
uint sum2 = previousSum2;
|
2022-03-07 07:36:42 +00:00
|
|
|
var dataOff = 0;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
switch(len)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-11-13 19:38:02 +00:00
|
|
|
/* in case user likes doing a byte at a time, keep it fast */
|
|
|
|
|
case 1:
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff];
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum1 >= FLETCHER_MODULE)
|
|
|
|
|
sum1 -= FLETCHER_MODULE;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum2 >= FLETCHER_MODULE)
|
|
|
|
|
sum2 -= FLETCHER_MODULE;
|
2022-03-06 13:29:37 +00:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
previousSum1 = (ushort)(sum1 & 0xFFFF);
|
|
|
|
|
previousSum2 = (ushort)(sum2 & 0xFFFF);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
return;
|
2022-03-06 13:29:37 +00:00
|
|
|
}
|
2022-11-13 19:38:02 +00:00
|
|
|
/* in case short lengths are provided, keep it somewhat fast */
|
|
|
|
|
case < 16:
|
|
|
|
|
{
|
|
|
|
|
while(len-- > 0)
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff++];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum1 >= FLETCHER_MODULE)
|
|
|
|
|
sum1 -= FLETCHER_MODULE;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
sum2 %= FLETCHER_MODULE; /* only added so many FLETCHER_MODULE's */
|
|
|
|
|
previousSum1 = (ushort)(sum1 & 0xFFFF);
|
|
|
|
|
previousSum2 = (ushort)(sum2 & 0xFFFF);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
return;
|
|
|
|
|
}
|
2022-03-06 13:29:37 +00:00
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* do length NMAX blocks -- requires just one modulo operation */
|
|
|
|
|
while(len >= NMAX)
|
|
|
|
|
{
|
|
|
|
|
len -= NMAX;
|
2022-11-13 19:16:13 +00:00
|
|
|
uint n = NMAX / 16;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* 16 sums unrolled */
|
|
|
|
|
dataOff += 16;
|
|
|
|
|
} while(--n != 0);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 %= FLETCHER_MODULE;
|
|
|
|
|
sum2 %= FLETCHER_MODULE;
|
|
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* do remaining bytes (less than NMAX, still just one modulo) */
|
|
|
|
|
if(len != 0)
|
|
|
|
|
{
|
|
|
|
|
/* avoid modulos if none remaining */
|
|
|
|
|
while(len >= 16)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
len -= 16;
|
|
|
|
|
sum1 += data[dataOff];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
|
|
|
|
|
dataOff += 16;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
while(len-- != 0)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 += data[dataOff++];
|
|
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 %= FLETCHER_MODULE;
|
|
|
|
|
sum2 %= FLETCHER_MODULE;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
previousSum1 = (ushort)(sum1 & 0xFFFF);
|
|
|
|
|
previousSum2 = (ushort)(sum2 & 0xFFFF);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// <summary>Gets the hash of a file</summary>
|
|
|
|
|
/// <param name="filename">File path.</param>
|
|
|
|
|
public static byte[] File(string filename)
|
|
|
|
|
{
|
|
|
|
|
File(filename, out byte[] hash);
|
|
|
|
|
|
|
|
|
|
return hash;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// <summary>Gets the hash of a file in hexadecimal and as a byte array.</summary>
|
|
|
|
|
/// <param name="filename">File path.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string File(string filename, out byte[] hash)
|
|
|
|
|
{
|
|
|
|
|
bool useNative = Native.IsSupported;
|
|
|
|
|
IntPtr nativeContext = IntPtr.Zero;
|
|
|
|
|
|
|
|
|
|
if(useNative)
|
2015-10-05 18:58:13 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
nativeContext = fletcher32_init();
|
2020-02-29 18:03:33 +00:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(nativeContext == IntPtr.Zero)
|
|
|
|
|
useNative = false;
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fileStream = new FileStream(filename, FileMode.Open);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
ushort localSum1 = 0xFFFF;
|
|
|
|
|
ushort localSum2 = 0xFFFF;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var buffer = new byte[65536];
|
|
|
|
|
int read = fileStream.Read(buffer, 0, 65536);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
while(read > 0)
|
|
|
|
|
{
|
|
|
|
|
Step(ref localSum1, ref localSum2, buffer, (uint)read, useNative, nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
read = fileStream.Read(buffer, 0, 65536);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (uint)((localSum2 << 16) | localSum1);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher32_final(nativeContext, ref finalSum);
|
|
|
|
|
fletcher32_free(nativeContext);
|
|
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
hash = BigEndianBitConverter.GetBytes(finalSum);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fletcherOutput = new StringBuilder();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
foreach(byte h in hash)
|
|
|
|
|
fletcherOutput.Append(h.ToString("x2"));
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
fileStream.Close();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return fletcherOutput.ToString();
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Gets the hash of the specified data buffer.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="len">Length of the data buffer to hash.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string Data(byte[] data, uint len, out byte[] hash)
|
|
|
|
|
{
|
|
|
|
|
bool useNative = Native.IsSupported;
|
|
|
|
|
IntPtr nativeContext = IntPtr.Zero;
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
nativeContext = fletcher32_init();
|
2018-02-03 21:25:37 +00:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(nativeContext == IntPtr.Zero)
|
|
|
|
|
useNative = false;
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
ushort localSum1 = 0xFFFF;
|
|
|
|
|
ushort localSum2 = 0xFFFF;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
Step(ref localSum1, ref localSum2, data, len, useNative, nativeContext);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (uint)((localSum2 << 16) | localSum1);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher32_final(nativeContext, ref finalSum);
|
|
|
|
|
fletcher32_free(nativeContext);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
hash = BigEndianBitConverter.GetBytes(finalSum);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var adlerOutput = new StringBuilder();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
foreach(byte h in hash)
|
|
|
|
|
adlerOutput.Append(h.ToString("x2"));
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return adlerOutput.ToString();
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Gets the hash of the specified data buffer.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string Data(byte[] data, out byte[] hash) => Data(data, (uint)data.Length, out hash);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Implements the Fletcher-16 algorithm</summary>
|
|
|
|
|
public sealed class Fletcher16Context : IChecksum
|
|
|
|
|
{
|
|
|
|
|
const byte FLETCHER_MODULE = 0xFF;
|
|
|
|
|
const byte NMAX = 22;
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
readonly IntPtr _nativeContext;
|
|
|
|
|
readonly bool _useNative;
|
|
|
|
|
byte _sum1, _sum2;
|
|
|
|
|
|
|
|
|
|
/// <summary>Initializes the Fletcher-16 sums</summary>
|
|
|
|
|
public Fletcher16Context()
|
|
|
|
|
{
|
|
|
|
|
_sum1 = 0xFF;
|
|
|
|
|
_sum2 = 0xFF;
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(!Native.IsSupported)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
_nativeContext = fletcher16_init();
|
|
|
|
|
_useNative = _nativeContext != IntPtr.Zero;
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
|
|
|
|
|
2021-08-17 21:23:22 +01:00
|
|
|
/// <inheritdoc />
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Updates the hash with data.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="len">Length of buffer to hash.</param>
|
|
|
|
|
public void Update(byte[] data, uint len) => Step(ref _sum1, ref _sum2, data, len, _useNative, _nativeContext);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Updates the hash with data.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
public void Update(byte[] data) => Update(data, (uint)data.Length);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Returns a byte array of the hash value.</summary>
|
|
|
|
|
public byte[] Final()
|
|
|
|
|
{
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (ushort)((_sum2 << 8) | _sum1);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(!_useNative)
|
|
|
|
|
return BigEndianBitConverter.GetBytes(finalSum);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
fletcher16_final(_nativeContext, ref finalSum);
|
|
|
|
|
fletcher16_free(_nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return BigEndianBitConverter.GetBytes(finalSum);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <inheritdoc />
|
|
|
|
|
/// <summary>Returns a hexadecimal representation of the hash value.</summary>
|
|
|
|
|
public string End()
|
|
|
|
|
{
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (ushort)((_sum2 << 8) | _sum1);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(_useNative)
|
2015-10-05 18:58:13 +01:00
|
|
|
{
|
2021-10-14 01:38:59 +01:00
|
|
|
fletcher16_final(_nativeContext, ref finalSum);
|
|
|
|
|
fletcher16_free(_nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fletcherOutput = new StringBuilder();
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
for(var i = 0; i < BigEndianBitConverter.GetBytes(finalSum).Length; i++)
|
2022-03-06 13:29:37 +00:00
|
|
|
fletcherOutput.Append(BigEndianBitConverter.GetBytes(finalSum)[i].ToString("x2"));
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return fletcherOutput.ToString();
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern IntPtr fletcher16_init();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern int fletcher16_update(IntPtr ctx, byte[] data, uint len);
|
|
|
|
|
|
|
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern int fletcher16_final(IntPtr ctx, ref ushort checksum);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
[DllImport("libAaru.Checksums.Native", SetLastError = true)]
|
|
|
|
|
static extern void fletcher16_free(IntPtr ctx);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
static void Step(ref byte previousSum1, ref byte previousSum2, byte[] data, uint len, bool useNative,
|
|
|
|
|
IntPtr nativeContext)
|
|
|
|
|
{
|
|
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher16_update(nativeContext, data, len);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return;
|
|
|
|
|
}
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:16:13 +00:00
|
|
|
uint sum1 = previousSum1;
|
|
|
|
|
uint sum2 = previousSum2;
|
2022-03-07 07:36:42 +00:00
|
|
|
var dataOff = 0;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
switch(len)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-11-13 19:38:02 +00:00
|
|
|
/* in case user likes doing a byte at a time, keep it fast */
|
|
|
|
|
case 1:
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff];
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum1 >= FLETCHER_MODULE)
|
|
|
|
|
sum1 -= FLETCHER_MODULE;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum2 >= FLETCHER_MODULE)
|
|
|
|
|
sum2 -= FLETCHER_MODULE;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
previousSum1 = (byte)(sum1 & 0xFF);
|
|
|
|
|
previousSum2 = (byte)(sum2 & 0xFF);
|
2022-03-06 13:29:37 +00:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
return;
|
2022-03-06 13:29:37 +00:00
|
|
|
}
|
2022-11-13 19:38:02 +00:00
|
|
|
/* in case short lengths are provided, keep it somewhat fast */
|
|
|
|
|
case < 11:
|
|
|
|
|
{
|
|
|
|
|
while(len-- > 0)
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff++];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
if(sum1 >= FLETCHER_MODULE)
|
|
|
|
|
sum1 -= FLETCHER_MODULE;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
sum2 %= FLETCHER_MODULE; /* only added so many FLETCHER_MODULE's */
|
|
|
|
|
previousSum1 = (byte)(sum1 & 0xFF);
|
|
|
|
|
previousSum2 = (byte)(sum2 & 0xFF);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-11-13 19:38:02 +00:00
|
|
|
return;
|
|
|
|
|
}
|
2022-03-06 13:29:37 +00:00
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* do length NMAX blocks -- requires just one modulo operation */
|
|
|
|
|
while(len >= NMAX)
|
|
|
|
|
{
|
|
|
|
|
len -= NMAX;
|
2022-11-13 19:16:13 +00:00
|
|
|
uint n = NMAX / 11;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
sum1 += data[dataOff];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2];
|
|
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* 11 sums unrolled */
|
|
|
|
|
dataOff += 11;
|
|
|
|
|
} while(--n != 0);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 %= FLETCHER_MODULE;
|
|
|
|
|
sum2 %= FLETCHER_MODULE;
|
|
|
|
|
}
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/* do remaining bytes (less than NMAX, still just one modulo) */
|
|
|
|
|
if(len != 0)
|
|
|
|
|
{
|
|
|
|
|
/* avoid modulos if none remaining */
|
|
|
|
|
while(len >= 11)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
len -= 11;
|
|
|
|
|
sum1 += data[dataOff];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 4 + 2 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 1];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
sum1 += data[dataOff + 8 + 2];
|
|
|
|
|
sum2 += sum1;
|
|
|
|
|
|
|
|
|
|
dataOff += 11;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
while(len-- != 0)
|
2021-09-23 00:53:20 +01:00
|
|
|
{
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 += data[dataOff++];
|
|
|
|
|
sum2 += sum1;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
sum1 %= FLETCHER_MODULE;
|
|
|
|
|
sum2 %= FLETCHER_MODULE;
|
2021-09-23 00:53:20 +01:00
|
|
|
}
|
|
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
previousSum1 = (byte)(sum1 & 0xFF);
|
|
|
|
|
previousSum2 = (byte)(sum2 & 0xFF);
|
|
|
|
|
}
|
2020-02-29 18:03:33 +00:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Gets the hash of a file</summary>
|
|
|
|
|
/// <param name="filename">File path.</param>
|
|
|
|
|
public static byte[] File(string filename)
|
|
|
|
|
{
|
|
|
|
|
File(filename, out byte[] hash);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return hash;
|
|
|
|
|
}
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Gets the hash of a file in hexadecimal and as a byte array.</summary>
|
|
|
|
|
/// <param name="filename">File path.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string File(string filename, out byte[] hash)
|
|
|
|
|
{
|
|
|
|
|
bool useNative = Native.IsSupported;
|
|
|
|
|
IntPtr nativeContext = IntPtr.Zero;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
nativeContext = fletcher16_init();
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(nativeContext == IntPtr.Zero)
|
|
|
|
|
useNative = false;
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fileStream = new FileStream(filename, FileMode.Open);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
byte localSum1 = 0xFF;
|
|
|
|
|
byte localSum2 = 0xFF;
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var buffer = new byte[65536];
|
|
|
|
|
int read = fileStream.Read(buffer, 0, 65536);
|
2021-09-23 00:53:20 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
while(read > 0)
|
|
|
|
|
{
|
|
|
|
|
Step(ref localSum1, ref localSum2, buffer, (uint)read, useNative, nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
read = fileStream.Read(buffer, 0, 65536);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (ushort)((localSum2 << 8) | localSum1);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher16_final(nativeContext, ref finalSum);
|
|
|
|
|
fletcher16_free(nativeContext);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
hash = BigEndianBitConverter.GetBytes(finalSum);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var fletcherOutput = new StringBuilder();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
foreach(byte h in hash)
|
|
|
|
|
fletcherOutput.Append(h.ToString("x2"));
|
2018-02-03 21:25:37 +00:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
fileStream.Close();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return fletcherOutput.ToString();
|
|
|
|
|
}
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
/// <summary>Gets the hash of the specified data buffer.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="len">Length of the data buffer to hash.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string Data(byte[] data, uint len, out byte[] hash)
|
|
|
|
|
{
|
|
|
|
|
bool useNative = Native.IsSupported;
|
|
|
|
|
IntPtr nativeContext = IntPtr.Zero;
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
nativeContext = fletcher16_init();
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(nativeContext == IntPtr.Zero)
|
|
|
|
|
useNative = false;
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
byte localSum1 = 0xFF;
|
|
|
|
|
byte localSum2 = 0xFF;
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
Step(ref localSum1, ref localSum2, data, len, useNative, nativeContext);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-07 07:36:42 +00:00
|
|
|
var finalSum = (ushort)((localSum2 << 8) | localSum1);
|
2021-10-14 01:38:59 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
if(useNative)
|
|
|
|
|
{
|
|
|
|
|
fletcher16_final(nativeContext, ref finalSum);
|
|
|
|
|
fletcher16_free(nativeContext);
|
|
|
|
|
}
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
hash = BigEndianBitConverter.GetBytes(finalSum);
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
var adlerOutput = new StringBuilder();
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
foreach(byte h in hash)
|
|
|
|
|
adlerOutput.Append(h.ToString("x2"));
|
2015-10-05 18:58:13 +01:00
|
|
|
|
2022-03-06 13:29:37 +00:00
|
|
|
return adlerOutput.ToString();
|
2015-10-05 18:58:13 +01:00
|
|
|
}
|
2022-03-06 13:29:37 +00:00
|
|
|
|
|
|
|
|
/// <summary>Gets the hash of the specified data buffer.</summary>
|
|
|
|
|
/// <param name="data">Data buffer.</param>
|
|
|
|
|
/// <param name="hash">Byte array of the hash value.</param>
|
|
|
|
|
public static string Data(byte[] data, out byte[] hash) => Data(data, (uint)data.Length, out hash);
|
2018-02-03 17:01:17 +00:00
|
|
|
}
|