-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Updated certificate for Pc users Added SharpCompress library as that was missing from the source repo
- Loading branch information
1 parent
99277de
commit 54a6965
Showing
333 changed files
with
54,694 additions
and
20 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,280 @@ | ||
| // Copyright (c) Six Labors and contributors. | ||
| // Licensed under the GNU Affero General Public License, Version 3. | ||
|
|
||
| using System; | ||
| using System.Runtime.CompilerServices; | ||
| using System.Runtime.InteropServices; | ||
| #if !NETSTANDARD2_0 && !NETSTANDARD2_1 && !NETFRAMEWORK | ||
| using System.Runtime.Intrinsics; | ||
| using System.Runtime.Intrinsics.X86; | ||
| #endif | ||
|
|
||
| namespace SharpCompress.Algorithms | ||
| { | ||
| /// <summary> | ||
| /// Calculates the 32 bit Adler checksum of a given buffer according to | ||
| /// RFC 1950. ZLIB Compressed Data Format Specification version 3.3) | ||
| /// </summary> | ||
| internal static class Adler32 | ||
| { | ||
| /// <summary> | ||
| /// The default initial seed value of a Adler32 checksum calculation. | ||
| /// </summary> | ||
| public const uint SeedValue = 1U; | ||
|
|
||
| #if !NETSTANDARD2_0 && !NETSTANDARD2_1 && !NETFRAMEWORK | ||
| private const int MinBufferSize = 64; | ||
| #endif | ||
|
|
||
| // Largest prime smaller than 65536 | ||
| private const uint BASE = 65521; | ||
|
|
||
| // NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 | ||
| private const uint NMAX = 5552; | ||
|
|
||
| /// <summary> | ||
| /// Calculates the Adler32 checksum with the bytes taken from the span. | ||
| /// </summary> | ||
| /// <param name="buffer">The readonly span of bytes.</param> | ||
| /// <returns>The <see cref="uint"/>.</returns> | ||
| [MethodImpl(MethodImplOptions.AggressiveInlining)] | ||
| public static uint Calculate(ReadOnlySpan<byte> buffer) | ||
| { | ||
| return Calculate(SeedValue, buffer); | ||
| } | ||
|
|
||
| /// <summary> | ||
| /// Calculates the Adler32 checksum with the bytes taken from the span and seed. | ||
| /// </summary> | ||
| /// <param name="adler">The input Adler32 value.</param> | ||
| /// <param name="buffer">The readonly span of bytes.</param> | ||
| /// <returns>The <see cref="uint"/>.</returns> | ||
| public static uint Calculate(uint adler, ReadOnlySpan<byte> buffer) | ||
| { | ||
| #if !NETSTANDARD2_0 && !NETSTANDARD2_1 && !NETFRAMEWORK | ||
| if (Sse3.IsSupported && buffer.Length >= MinBufferSize) | ||
| { | ||
| return CalculateSse(adler, buffer); | ||
| } | ||
|
|
||
| return CalculateScalar(adler, buffer); | ||
| #else | ||
| return CalculateScalar(adler, buffer); | ||
| #endif | ||
| } | ||
|
|
||
| // Based on https://github.com/chromium/chromium/blob/master/third_party/zlib/adler32_simd.c | ||
| #if !NETSTANDARD2_0 && !NETSTANDARD2_1 && !NETFRAMEWORK | ||
| private static unsafe uint CalculateSse(uint adler, ReadOnlySpan<byte> buffer) | ||
| { | ||
| uint s1 = adler & 0xFFFF; | ||
| uint s2 = (adler >> 16) & 0xFFFF; | ||
|
|
||
| // Process the data in blocks. | ||
| const int BLOCK_SIZE = 1 << 5; | ||
|
|
||
| uint length = (uint)buffer.Length; | ||
| uint blocks = length / BLOCK_SIZE; | ||
| length -= blocks * BLOCK_SIZE; | ||
|
|
||
| int index = 0; | ||
| fixed (byte* bufferPtr = &buffer[0]) | ||
| { | ||
| index += (int)blocks * BLOCK_SIZE; | ||
| var localBufferPtr = bufferPtr; | ||
|
|
||
| // _mm_setr_epi8 on x86 | ||
| var tap1 = Vector128.Create(32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17); | ||
| var tap2 = Vector128.Create(16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1); | ||
| Vector128<byte> zero = Vector128<byte>.Zero; | ||
| var ones = Vector128.Create((short)1); | ||
|
|
||
| while (blocks > 0) | ||
| { | ||
| uint n = NMAX / BLOCK_SIZE; /* The NMAX constraint. */ | ||
| if (n > blocks) | ||
| { | ||
| n = blocks; | ||
| } | ||
|
|
||
| blocks -= n; | ||
|
|
||
| // Process n blocks of data. At most NMAX data bytes can be | ||
| // processed before s2 must be reduced modulo BASE. | ||
| Vector128<int> v_ps = Vector128.CreateScalar(s1 * n).AsInt32(); | ||
| Vector128<int> v_s2 = Vector128.CreateScalar(s2).AsInt32(); | ||
| Vector128<int> v_s1 = Vector128<int>.Zero; | ||
|
|
||
| do | ||
| { | ||
| // Load 32 input bytes. | ||
| Vector128<byte> bytes1 = Sse3.LoadDquVector128(localBufferPtr); | ||
| Vector128<byte> bytes2 = Sse3.LoadDquVector128(localBufferPtr + 16); | ||
|
|
||
| // Add previous block byte sum to v_ps. | ||
| v_ps = Sse2.Add(v_ps, v_s1); | ||
|
|
||
| // Horizontally add the bytes for s1, multiply-adds the | ||
| // bytes by [ 32, 31, 30, ... ] for s2. | ||
| v_s1 = Sse2.Add(v_s1, Sse2.SumAbsoluteDifferences(bytes1, zero).AsInt32()); | ||
| Vector128<short> mad1 = Ssse3.MultiplyAddAdjacent(bytes1, tap1); | ||
| v_s2 = Sse2.Add(v_s2, Sse2.MultiplyAddAdjacent(mad1, ones)); | ||
|
|
||
| v_s1 = Sse2.Add(v_s1, Sse2.SumAbsoluteDifferences(bytes2, zero).AsInt32()); | ||
| Vector128<short> mad2 = Ssse3.MultiplyAddAdjacent(bytes2, tap2); | ||
| v_s2 = Sse2.Add(v_s2, Sse2.MultiplyAddAdjacent(mad2, ones)); | ||
|
|
||
| localBufferPtr += BLOCK_SIZE; | ||
| } | ||
| while (--n > 0); | ||
|
|
||
| v_s2 = Sse2.Add(v_s2, Sse2.ShiftLeftLogical(v_ps, 5)); | ||
|
|
||
| // Sum epi32 ints v_s1(s2) and accumulate in s1(s2). | ||
| const byte S2301 = 0b1011_0001; // A B C D -> B A D C | ||
| const byte S1032 = 0b0100_1110; // A B C D -> C D A B | ||
|
|
||
| v_s1 = Sse2.Add(v_s1, Sse2.Shuffle(v_s1, S2301)); | ||
| v_s1 = Sse2.Add(v_s1, Sse2.Shuffle(v_s1, S1032)); | ||
|
|
||
| s1 += (uint)v_s1.ToScalar(); | ||
|
|
||
| v_s2 = Sse2.Add(v_s2, Sse2.Shuffle(v_s2, S2301)); | ||
| v_s2 = Sse2.Add(v_s2, Sse2.Shuffle(v_s2, S1032)); | ||
|
|
||
| s2 = (uint)v_s2.ToScalar(); | ||
|
|
||
| // Reduce. | ||
| s1 %= BASE; | ||
| s2 %= BASE; | ||
| } | ||
| } | ||
|
|
||
| ref byte bufferRef = ref MemoryMarshal.GetReference(buffer); | ||
|
|
||
| if (length > 0) | ||
| { | ||
| if (length >= 16) | ||
| { | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| length -= 16; | ||
| } | ||
|
|
||
| while (length-- > 0) | ||
| { | ||
| s2 += s1 += Unsafe.Add(ref bufferRef, index++); | ||
| } | ||
|
|
||
| if (s1 >= BASE) | ||
| { | ||
| s1 -= BASE; | ||
| } | ||
|
|
||
| s2 %= BASE; | ||
| } | ||
|
|
||
| return s1 | (s2 << 16); | ||
| } | ||
| #endif | ||
|
|
||
| private static uint CalculateScalar(uint adler, ReadOnlySpan<byte> buffer) | ||
| { | ||
| uint s1 = adler & 0xFFFF; | ||
| uint s2 = (adler >> 16) & 0xFFFF; | ||
| uint k; | ||
|
|
||
| ref byte bufferRef = ref MemoryMarshal.GetReference<byte>(buffer); | ||
| uint length = (uint)buffer.Length; | ||
| int index = 0; | ||
|
|
||
| while (length > 0) | ||
| { | ||
| k = length < NMAX ? length : NMAX; | ||
| length -= k; | ||
|
|
||
| while (k >= 16) | ||
| { | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| k -= 16; | ||
| } | ||
|
|
||
| if (k != 0) | ||
| { | ||
| do | ||
| { | ||
| s1 += Unsafe.Add(ref bufferRef, index++); | ||
| s2 += s1; | ||
| } | ||
| while (--k != 0); | ||
| } | ||
|
|
||
| s1 %= BASE; | ||
| s2 %= BASE; | ||
| } | ||
|
|
||
| return (s2 << 16) | s1; | ||
| } | ||
| } | ||
| } |
Oops, something went wrong.