mirror of
https://github.com/xcp-ng/xenadmin.git
synced 2024-11-29 02:18:07 +01:00
343 lines
15 KiB
C#
343 lines
15 KiB
C#
|
/* Copyright (c) Citrix Systems, Inc.
|
|||
|
|
* All rights reserved.
|
|||
|
|
*
|
|||
|
|
* Redistribution and use in source and binary forms,
|
|||
|
|
* with or without modification, are permitted provided
|
|||
|
|
* that the following conditions are met:
|
|||
|
|
*
|
|||
|
|
* * Redistributions of source code must retain the above
|
|||
|
|
* copyright notice, this list of conditions and the
|
|||
|
|
* following disclaimer.
|
|||
|
|
* * Redistributions in binary form must reproduce the above
|
|||
|
|
* copyright notice, this list of conditions and the
|
|||
|
|
* following disclaimer in the documentation and/or other
|
|||
|
|
* materials provided with the distribution.
|
|||
|
|
*
|
|||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|||
|
|
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|||
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|||
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|||
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|||
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|||
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|||
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|||
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|||
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|||
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|||
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|||
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|||
|
|
* SUCH DAMAGE.
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
/*
|
|||
|
|
* Based upon code copyrighted as below.
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
/*MIT License
|
|||
|
|
|
|||
|
|
Copyright (c) 2018 differentrain
|
|||
|
|
|
|||
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|||
|
|
of this software and associated documentation files (the "Software"), to deal
|
|||
|
|
in the Software without restriction, including without limitation the rights
|
|||
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|||
|
|
copies of the Software, and to permit persons to whom the Software is
|
|||
|
|
furnished to do so, subject to the following conditions:
|
|||
|
|
|
|||
|
|
The above copyright notice and this permission notice shall be included in all
|
|||
|
|
copies or substantial portions of the Software.
|
|||
|
|
|
|||
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|||
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|||
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|||
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|||
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|||
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|||
|
|
SOFTWARE. */
|
|||
|
|
|
|||
|
|
/*
|
|||
|
|
* The minimum requirements for YYProject.XXHash are .NET Framework 3.5, and C# 7.0 ,
|
|||
|
|
* it means that these code also apply to .NET Core 1.0 or later, Mono 4.6 or later and so on.
|
|||
|
|
* If necessary, you can also rewrite these library to .NET Framework 2.0 with just a little work.
|
|||
|
|
* Since all code (XXHash32 and XXHash64) are inside these file independently,
|
|||
|
|
* I don't recommend using compiled library in your project.
|
|||
|
|
* Instead, you can just copy the useful parts to your code, this is the benefit of MIT License. P:)
|
|||
|
|
*
|
|||
|
|
* If you are using .NET4.5 (or higher) or sibling frameworks, you can add conditional compilation
|
|||
|
|
* symbol "HIGHER_VERSIONS" to optimize static-short-methods.
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
using System;
|
|||
|
|
using System.Security.Cryptography;
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
using System.Runtime.CompilerServices;
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
|
|||
|
|
namespace YYProject.XXHash
|
|||
|
|
{
|
|||
|
|
//see details: https://github.com/Cyan4973/xxHash/blob/dev/doc/xxhash_spec.md
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Represents the class which provides a implementation of the xxHash64 algorithm.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <threadsafety static="true" instance="false"/>
|
|||
|
|
public sealed class XXHash64 : HashAlgorithm
|
|||
|
|
{
|
|||
|
|
private const ulong PRIME64_1 = 11400714785074694791UL;
|
|||
|
|
private const ulong PRIME64_2 = 14029467366897019727UL;
|
|||
|
|
private const ulong PRIME64_3 = 1609587929392839161UL;
|
|||
|
|
private const ulong PRIME64_4 = 9650029242287828579UL;
|
|||
|
|
private const ulong PRIME64_5 = 2870177450012600261UL;
|
|||
|
|
|
|||
|
|
private static readonly Func<byte[], int, uint> FuncGetLittleEndianUInt32;
|
|||
|
|
private static readonly Func<byte[], int, ulong> FuncGetLittleEndianUInt64;
|
|||
|
|
private static readonly Func<ulong, ulong> FuncGetFinalHashUInt64;
|
|||
|
|
|
|||
|
|
private ulong _Seed64;
|
|||
|
|
|
|||
|
|
private ulong _ACC64_1;
|
|||
|
|
private ulong _ACC64_2;
|
|||
|
|
private ulong _ACC64_3;
|
|||
|
|
private ulong _ACC64_4;
|
|||
|
|
private ulong _Hash64;
|
|||
|
|
|
|||
|
|
private int _RemainingLength;
|
|||
|
|
private long _TotalLength;
|
|||
|
|
private int _CurrentIndex;
|
|||
|
|
private byte[] _CurrentArray;
|
|||
|
|
|
|||
|
|
static XXHash64()
|
|||
|
|
{
|
|||
|
|
if (BitConverter.IsLittleEndian)
|
|||
|
|
{
|
|||
|
|
FuncGetLittleEndianUInt32 = new Func<byte[], int, uint>((x, i) =>
|
|||
|
|
{
|
|||
|
|
return BitConverter.ToUInt32(x, i);
|
|||
|
|
});
|
|||
|
|
FuncGetLittleEndianUInt64 = new Func<byte[], int, ulong>((x, i) =>
|
|||
|
|
{
|
|||
|
|
return BitConverter.ToUInt64(x, i);
|
|||
|
|
});
|
|||
|
|
FuncGetFinalHashUInt64 = new Func<ulong, ulong>(i => (i & 0x00000000000000FFUL) << 56 | (i & 0x000000000000FF00UL) << 40 | (i & 0x0000000000FF0000UL) << 24 | (i & 0x00000000FF000000UL) << 8 | (i & 0x000000FF00000000UL) >> 8 | (i & 0x0000FF0000000000UL) >> 24 | (i & 0x00FF000000000000UL) >> 40 | (i & 0xFF00000000000000UL) >> 56);
|
|||
|
|
}
|
|||
|
|
else
|
|||
|
|
{
|
|||
|
|
FuncGetLittleEndianUInt32 = new Func<byte[], int, uint>((array, i) =>
|
|||
|
|
{
|
|||
|
|
return (uint)(array[i++] | (array[i++] << 8) | (array[i++] << 16) | (array[i] << 24));
|
|||
|
|
});
|
|||
|
|
FuncGetLittleEndianUInt64 = new Func<byte[], int, ulong>((array, i) =>
|
|||
|
|
{
|
|||
|
|
return array[i++] | ((ulong)array[i++] << 8) | ((ulong)array[i++] << 16) | ((ulong)array[i++] << 24) | ((ulong)array[i++] << 32) | ((ulong)array[i++] << 40) | ((ulong)array[i++] << 48) | ((ulong)array[i] << 56);
|
|||
|
|
});
|
|||
|
|
FuncGetFinalHashUInt64 = new Func<ulong, ulong>(i => i);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Creates an instance of <see cref="XXHash64"/> class by default seed(0).
|
|||
|
|
/// </summary>
|
|||
|
|
/// <returns></returns>
|
|||
|
|
public new static XXHash64 Create() => new XXHash64();
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Creates an instance of the specified implementation of XXHash64 algorithm.
|
|||
|
|
/// <para>This method always throws <see cref="NotSupportedException"/>. </para>
|
|||
|
|
/// </summary>
|
|||
|
|
/// <param name="algName">The hash algorithm implementation to use.</param>
|
|||
|
|
/// <returns>This method always throws <see cref="NotSupportedException"/>. </returns>
|
|||
|
|
/// <exception cref="NotSupportedException">This method is not be supported.</exception>
|
|||
|
|
public new static XXHash64 Create(string algName) => throw new NotSupportedException("This method is not be supported.");
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Initializes a new instance of the <see cref="XXHash64"/> class by default seed(0).
|
|||
|
|
/// </summary>
|
|||
|
|
public XXHash64() => Initialize(0);
|
|||
|
|
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Initializes a new instance of the <see cref="XXHash64"/> class, and sets the <see cref="Seed"/> to the specified value.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <param name="seed">Represent the seed to be used for xxHash64 computing.</param>
|
|||
|
|
public XXHash64(uint seed) => Initialize(seed);
|
|||
|
|
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Gets the <see cref="ulong"/> value of the computed hash code.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <exception cref="InvalidOperationException">Computation has not yet completed.</exception>
|
|||
|
|
public ulong HashUInt64 => State == 0 ? _Hash64 : throw new InvalidOperationException("Computation has not yet completed.");
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Gets or sets the value of seed used by xxHash64 algorithm.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <exception cref="InvalidOperationException">Computation has not yet completed.</exception>
|
|||
|
|
public ulong Seed
|
|||
|
|
{
|
|||
|
|
get => _Seed64;
|
|||
|
|
set
|
|||
|
|
{
|
|||
|
|
if (value != _Seed64)
|
|||
|
|
{
|
|||
|
|
if (State != 0) throw new InvalidOperationException("Computation has not yet completed.");
|
|||
|
|
_Seed64 = value;
|
|||
|
|
Initialize();
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Initializes this instance for new hash computing.
|
|||
|
|
/// </summary>
|
|||
|
|
public override void Initialize()
|
|||
|
|
{
|
|||
|
|
_ACC64_1 = _Seed64 + PRIME64_1 + PRIME64_2;
|
|||
|
|
_ACC64_2 = _Seed64 + PRIME64_2;
|
|||
|
|
_ACC64_3 = _Seed64 + 0;
|
|||
|
|
_ACC64_4 = _Seed64 - PRIME64_1;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Routes data written to the object into the hash algorithm for computing the hash.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <param name="array">The input to compute the hash code for.</param>
|
|||
|
|
/// <param name="ibStart">The offset into the byte array from which to begin using data.</param>
|
|||
|
|
/// <param name="cbSize">The number of bytes in the byte array to use as data.</param>
|
|||
|
|
protected override void HashCore(byte[] array, int ibStart, int cbSize)
|
|||
|
|
{
|
|||
|
|
if (State != 1) State = 1;
|
|||
|
|
var size = cbSize - ibStart;
|
|||
|
|
_RemainingLength = size & 31;
|
|||
|
|
if (cbSize >= 32)
|
|||
|
|
{
|
|||
|
|
var limit = size - _RemainingLength;
|
|||
|
|
do
|
|||
|
|
{
|
|||
|
|
_ACC64_1 = Round64(_ACC64_1, FuncGetLittleEndianUInt64(array, ibStart));
|
|||
|
|
ibStart += 8;
|
|||
|
|
_ACC64_2 = Round64(_ACC64_2, FuncGetLittleEndianUInt64(array, ibStart));
|
|||
|
|
ibStart += 8;
|
|||
|
|
_ACC64_3 = Round64(_ACC64_3, FuncGetLittleEndianUInt64(array, ibStart));
|
|||
|
|
ibStart += 8;
|
|||
|
|
_ACC64_4 = Round64(_ACC64_4, FuncGetLittleEndianUInt64(array, ibStart));
|
|||
|
|
ibStart += 8;
|
|||
|
|
} while (ibStart < limit);
|
|||
|
|
}
|
|||
|
|
_TotalLength += cbSize;
|
|||
|
|
if (_RemainingLength != 0)
|
|||
|
|
{
|
|||
|
|
_CurrentArray = array;
|
|||
|
|
_CurrentIndex = ibStart;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
/// <summary>
|
|||
|
|
/// Finalizes the hash computation after the last data is processed by the cryptographic stream object.
|
|||
|
|
/// </summary>
|
|||
|
|
/// <returns>The computed hash code.</returns>
|
|||
|
|
protected override byte[] HashFinal()
|
|||
|
|
{
|
|||
|
|
if (_TotalLength >= 32)
|
|||
|
|
{
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
_Hash64 = RotateLeft64_1(_ACC64_1) + RotateLeft64_7(_ACC64_2) + RotateLeft64_12(_ACC64_3) + RotateLeft64_18(_ACC64_4);
|
|||
|
|
#else
|
|||
|
|
|
|||
|
|
_Hash64 = RotateLeft64(_ACC64_1, 1) + RotateLeft64(_ACC64_2, 7) + RotateLeft64(_ACC64_3, 12) + RotateLeft64(_ACC64_4, 18);
|
|||
|
|
#endif
|
|||
|
|
_Hash64 = MergeRound64(_Hash64, _ACC64_1);
|
|||
|
|
_Hash64 = MergeRound64(_Hash64, _ACC64_2);
|
|||
|
|
_Hash64 = MergeRound64(_Hash64, _ACC64_3);
|
|||
|
|
_Hash64 = MergeRound64(_Hash64, _ACC64_4);
|
|||
|
|
}
|
|||
|
|
else
|
|||
|
|
{
|
|||
|
|
_Hash64 = _Seed64 + PRIME64_5;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
_Hash64 += (ulong)_TotalLength;
|
|||
|
|
|
|||
|
|
while (_RemainingLength >= 8)
|
|||
|
|
{
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
_Hash64 = RotateLeft64_27(_Hash64 ^ Round64(0, FuncGetLittleEndianUInt64(_CurrentArray, _CurrentIndex))) * PRIME64_1 + PRIME64_4;
|
|||
|
|
#else
|
|||
|
|
_Hash64 = RotateLeft64(_Hash64 ^ Round64(0, FuncGetLittleEndianUInt64(_CurrentArray, _CurrentIndex)), 27) * PRIME64_1 + PRIME64_4;
|
|||
|
|
#endif
|
|||
|
|
_CurrentIndex += 8;
|
|||
|
|
_RemainingLength -= 8;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
while (_RemainingLength >= 4)
|
|||
|
|
{
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
_Hash64 = RotateLeft64_23(_Hash64 ^ (FuncGetLittleEndianUInt32(_CurrentArray, _CurrentIndex) * PRIME64_1)) * PRIME64_2 + PRIME64_3;
|
|||
|
|
#else
|
|||
|
|
_Hash64 = RotateLeft64(_Hash64 ^ (FuncGetLittleEndianUInt32(_CurrentArray, _CurrentIndex) * PRIME64_1), 23) * PRIME64_2 + PRIME64_3;
|
|||
|
|
#endif
|
|||
|
|
_CurrentIndex += 4;
|
|||
|
|
_RemainingLength -= 4;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
while (_RemainingLength-- >= 1)
|
|||
|
|
{
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
_Hash64 = RotateLeft64_11(_Hash64 ^ (_CurrentArray[_CurrentIndex++] * PRIME64_5)) * PRIME64_1;
|
|||
|
|
#else
|
|||
|
|
_Hash64 = RotateLeft64(_Hash64 ^ (_CurrentArray[_CurrentIndex++] * PRIME64_5), 11) * PRIME64_1;
|
|||
|
|
#endif
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
_Hash64 = (_Hash64 ^ (_Hash64 >> 33)) * PRIME64_2;
|
|||
|
|
_Hash64 = (_Hash64 ^ (_Hash64 >> 29)) * PRIME64_3;
|
|||
|
|
_Hash64 ^= _Hash64 >> 32;
|
|||
|
|
|
|||
|
|
_TotalLength = State = 0;
|
|||
|
|
return BitConverter.GetBytes(FuncGetFinalHashUInt64(_Hash64));
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
#if HIGHER_VERSIONS
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong MergeRound64(ulong input, ulong value) => (input ^ Round64(0, value)) * PRIME64_1 + PRIME64_4;
|
|||
|
|
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong Round64(ulong input, ulong value) => RotateLeft64_31(input + (value * PRIME64_2)) * PRIME64_1;
|
|||
|
|
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_1(ulong value) => (value << 1) | (value >> 63); // _ACC64_1
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_7(ulong value) => (value << 7) | (value >> 57); // _ACC64_2
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_11(ulong value) => (value << 11) | (value >> 53);
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_12(ulong value) => (value << 12) | (value >> 52);// _ACC64_3
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_18(ulong value) => (value << 18) | (value >> 46); // _ACC64_4
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_23(ulong value) => (value << 23) | (value >> 41);
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_27(ulong value) => (value << 27) | (value >> 37);
|
|||
|
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|||
|
|
private static ulong RotateLeft64_31(ulong value) => (value << 31) | (value >> 33);
|
|||
|
|
#else
|
|||
|
|
private static ulong MergeRound64(ulong input, ulong value) => (input ^ Round64(0, value)) * PRIME64_1 + PRIME64_4;
|
|||
|
|
|
|||
|
|
private static ulong Round64(ulong input, ulong value) => RotateLeft64(input + (value * PRIME64_2), 31) * PRIME64_1;
|
|||
|
|
|
|||
|
|
private static ulong RotateLeft64(ulong value, int count) => (value << count) | (value >> (64 - count));
|
|||
|
|
#endif
|
|||
|
|
|
|||
|
|
|
|||
|
|
private void Initialize(ulong seed)
|
|||
|
|
{
|
|||
|
|
HashSizeValue = 64;
|
|||
|
|
_Seed64 = seed;
|
|||
|
|
Initialize();
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
}
|