Soullies/ichni_Official
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add all

Browse Source
This commit is contained in:
stevesensei
2026-06-15 18:18:16 +08:00
parent 97c9fba14e
commit 2b9f134e5f
4164 changed files with 386922 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/BZip2Constants.cs vendored Normal file
View File

@@ -0,0 +1,51 @@
#if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
#pragma warning disable
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
/*
* This package is based on the work done by Keiron Liddle, Aftex Software
* <keiron@aftexsw.com> to whom the Ant project is very grateful for his
* great code.
*/
namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Utilities.Bzip2
{
/**
* Base class for both the compress and decompress classes.
* Holds common arrays, and static data.
*
* @author <a href="mailto:keiron@aftexsw.com">Keiron Liddle</a>
*/
public class BZip2Constants
{
public const int baseBlockSize = 100000;
public const int MAX_ALPHA_SIZE = 258;
public const int MAX_CODE_LEN = 20;
public const int MAX_CODE_LEN_GEN = 17;
public const int RUNA = 0;
public const int RUNB = 1;
public const int N_GROUPS = 6;
public const int G_SIZE = 50;
public const int N_ITERS = 4;
public const int MAX_SELECTORS = 2 + (900000 / G_SIZE);
public const int NUM_OVERSHOOT_BYTES = 20;
}
}
#pragma warning restore
#endif

11
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/BZip2Constants.cs.meta vendored Normal file
View File

@@ -0,0 +1,11 @@
fileFormatVersion: 2
guid: 6136f863c56a5974d91f7bfd70bd79f3
MonoImporter:
externalObjects: {}
serializedVersion: 2
defaultReferences: []
executionOrder: 0
icon: {instanceID: 0}
userData:
assetBundleName:
assetBundleVariant:

813
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CBZip2InputStream.cs vendored Normal file
View File

@@ -0,0 +1,813 @@
#if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
#pragma warning disable
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
/*
* This package is based on the work done by Keiron Liddle, Aftex Software
* <keiron@aftexsw.com> to whom the Ant project is very grateful for his
* great code.
*/
using System;
using System.Diagnostics;
using System.IO;
using Best.HTTP.SecureProtocol.Org.BouncyCastle.Utilities.IO;
namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Utilities.Bzip2
{
/**
* An input stream that decompresses from the BZip2 format (with the file
* header chars) to be read as any other stream.
*
* @author <a href="mailto:keiron@aftexsw.com">Keiron Liddle</a>
*
* <b>NB:</b> note this class has been modified to read the leading BZ from the
* start of the BZIP2 stream to make it compatible with other PGP programs.
*/
public class CBZip2InputStream
: BaseInputStream
{
/*
index of the last char in the block, so
the block size == last + 1.
*/
private int last;
/*
index in zptr[] of original string after sorting.
*/
private int origPtr;
/*
always: in the range 0 .. 9.
The current block size is 100000 * this number.
*/
private int blockSize100k;
private int bsBuff;
private int bsLive;
private readonly CRC m_blockCrc = new CRC();
private int nInUse;
private byte[] seqToUnseq = new byte[256];
private byte[] m_selectors = new byte[BZip2Constants.MAX_SELECTORS];
private int[] tt;
private byte[] ll8;
/*
freq table collected to save a pass over the data
during decompression.
*/
private int[] unzftab = new int[256];
private int[][] limit = CreateIntArray(BZip2Constants.N_GROUPS, BZip2Constants.MAX_CODE_LEN + 1);
private int[][] basev = CreateIntArray(BZip2Constants.N_GROUPS, BZip2Constants.MAX_CODE_LEN + 1);
private int[][] perm = CreateIntArray(BZip2Constants.N_GROUPS, BZip2Constants.MAX_ALPHA_SIZE);
private int[] minLens = new int[BZip2Constants.N_GROUPS];
private Stream bsStream;
private bool streamEnd = false;
private int currentByte = -1;
private const int RAND_PART_B_STATE = 1;
private const int RAND_PART_C_STATE = 2;
private const int NO_RAND_PART_B_STATE = 3;
private const int NO_RAND_PART_C_STATE = 4;
private int currentState = 0;
private int m_expectedBlockCrc, m_expectedStreamCrc, m_streamCrc;
int i2, count, chPrev, ch2;
int i, tPos;
int rNToGo = 0;
int rTPos = 0;
int j2;
int z;
public CBZip2InputStream(Stream zStream)
{
ll8 = null;
tt = null;
bsStream = zStream;
bsLive = 0;
bsBuff = 0;
int magic1 = bsStream.ReadByte();
int magic2 = bsStream.ReadByte();
int version = bsStream.ReadByte();
int level = bsStream.ReadByte();
if (level < 0)
throw new EndOfStreamException();
if (magic1 != 'B' | magic2 != 'Z' | version != 'h' | level < '1' | level > '9')
throw new IOException("Invalid stream header");
blockSize100k = level - '0';
int n = BZip2Constants.baseBlockSize * blockSize100k;
ll8 = new byte[n];
tt = new int[n];
m_streamCrc = 0;
BeginBlock();
}
public override int Read(byte[] buffer, int offset, int count)
{
Streams.ValidateBufferArguments(buffer, offset, count);
/*
* TODO The base class implementation allows to return partial data if/when ReadByte throws. That would be
* be preferable here too (so don't override), but it would require that exceptions cause this instance to
* permanently fail, and that needs review.
*/
int pos = 0;
while (pos < count)
{
int b = ReadByte();
if (b < 0)
break;
buffer[offset + pos++] = (byte)b;
}
return pos;
}
public override int ReadByte()
{
if (streamEnd)
return -1;
int result = currentByte;
switch (currentState)
{
case RAND_PART_B_STATE:
SetupRandPartB();
break;
case RAND_PART_C_STATE:
SetupRandPartC();
break;
case NO_RAND_PART_B_STATE:
SetupNoRandPartB();
break;
case NO_RAND_PART_C_STATE:
SetupNoRandPartC();
break;
default:
throw new InvalidOperationException();
}
return result;
}
private void BeginBlock()
{
long magic48 = BsGetLong48();
if (magic48 != 0x314159265359L)
{
if (magic48 != 0x177245385090L)
throw new IOException("Block header error");
m_expectedStreamCrc = BsGetInt32();
if (m_expectedStreamCrc != m_streamCrc)
throw new IOException("Stream CRC error");
BsFinishedWithStream();
streamEnd = true;
return;
}
m_expectedBlockCrc = BsGetInt32();
bool blockRandomised = BsGetBit() == 1;
GetAndMoveToFrontDecode();
m_blockCrc.Initialise();
int[] cftab = new int[257];
{
int accum = 0;
cftab[0] = 0;
for (i = 0; i < 256; ++i)
{
accum += unzftab[i];
cftab[i + 1] = accum;
}
if (accum != (last + 1))
throw new InvalidOperationException();
}
for (i = 0; i <= last; i++)
{
byte ch = ll8[i];
tt[cftab[ch]++] = i;
}
tPos = tt[origPtr];
count = 0;
i2 = 0;
ch2 = 256; /* not a char and not EOF */
if (blockRandomised)
{
rNToGo = 0;
rTPos = 0;
SetupRandPartA();
}
else
{
SetupNoRandPartA();
}
}
private void EndBlock()
{
int blockFinalCrc = m_blockCrc.GetFinal();
if (m_expectedBlockCrc != blockFinalCrc)
throw new IOException("Block CRC error");
m_streamCrc = Integers.RotateLeft(m_streamCrc, 1) ^ blockFinalCrc;
}
private void BsFinishedWithStream()
{
try
{
if (this.bsStream != null)
{
this.bsStream.Dispose();
this.bsStream = null;
}
}
catch
{
//ignore
}
}
private int BsGetBit()
{
if (bsLive == 0)
{
bsBuff = RequireByte();
bsLive = 7;
return (int)((uint)bsBuff >> 7);
}
--bsLive;
return (bsBuff >> bsLive) & 1;
}
private int BsGetBits(int n)
{
Debug.Assert(1 <= n && n <= 24);
while (bsLive < n)
{
bsBuff = (bsBuff << 8) | RequireByte();
bsLive += 8;
}
bsLive -= n;
return (bsBuff >> bsLive) & ((1 << n) - 1);
}
private int BsGetBitsSmall(int n)
{
Debug.Assert(1 <= n && n <= 8);
if (bsLive < n)
{
bsBuff = (bsBuff << 8) | RequireByte();
bsLive += 8;
}
bsLive -= n;
return (bsBuff >> bsLive) & ((1 << n) - 1);
}
private int BsGetInt32()
{
int u = BsGetBits(16) << 16;
return u | BsGetBits(16);
}
private long BsGetLong48()
{
long u = (long)BsGetBits(24) << 24;
return u | (long)BsGetBits(24);
}
private void HbCreateDecodeTables(int[] limit, int[] basev, int[] perm, byte[] length, int minLen, int maxLen,
int alphaSize)
{
Array.Clear(basev, 0, basev.Length);
Array.Clear(limit, 0, limit.Length);
int pp = 0, baseVal = 0;
for (int i = minLen; i <= maxLen; i++)
{
for (int j = 0; j < alphaSize; j++)
{
if (length[j] == i)
{
perm[pp++] = j;
}
}
basev[i] = baseVal;
limit[i] = baseVal + pp;
baseVal += baseVal + pp;
}
}
private int RecvDecodingTables()
{
int i, j;
nInUse = 0;
/* Receive the mapping table */
int inUse16 = BsGetBits(16);
for (i = 0; i < 16; ++i)
{
if ((inUse16 & (0x8000 >> i)) != 0)
{
int inUse = BsGetBits(16);
int i16 = i * 16;
for (j = 0; j < 16; ++j)
{
if ((inUse & (0x8000 >> j)) != 0)
{
seqToUnseq[nInUse++] = (byte)(i16 + j);
}
}
}
}
if (nInUse < 1)
throw new InvalidOperationException();
int alphaSize = nInUse + 2;
/* Now the selectors */
int nGroups = BsGetBitsSmall(3);
if (nGroups < 2 || nGroups > BZip2Constants.N_GROUPS)
throw new InvalidOperationException();
int nSelectors = BsGetBits(15);
if (nSelectors < 1)
throw new InvalidOperationException();
uint mtfGroups = 0x00543210U;
for (i = 0; i < nSelectors; i++)
{
int mtfSelector = 0;
while (BsGetBit() == 1)
{
if (++mtfSelector >= nGroups)
throw new InvalidOperationException();
}
// Ignore declared selectors in excess of the maximum usable number
if (i >= BZip2Constants.MAX_SELECTORS)
continue;
// Undo the MTF value for the selector.
switch (mtfSelector)
{
case 0:
break;
case 1:
mtfGroups = (mtfGroups >> 4) & 0x00000FU | (mtfGroups << 4) & 0x0000F0U | mtfGroups & 0xFFFF00U;
break;
case 2:
mtfGroups = (mtfGroups >> 8) & 0x00000FU | (mtfGroups << 4) & 0x000FF0U | mtfGroups & 0xFFF000U;
break;
case 3:
mtfGroups = (mtfGroups >> 12) & 0x00000FU | (mtfGroups << 4) & 0x00FFF0U | mtfGroups & 0xFF0000U;
break;
case 4:
mtfGroups = (mtfGroups >> 16) & 0x00000FU | (mtfGroups << 4) & 0x0FFFF0U | mtfGroups & 0xF00000U;
break;
case 5:
mtfGroups = (mtfGroups >> 20) & 0x00000FU | (mtfGroups << 4) & 0xFFFFF0U;
break;
default:
throw new InvalidOperationException();
}
m_selectors[i] = (byte)(mtfGroups & 0xF);
}
byte[] len_t = new byte[alphaSize];
/* Now the coding tables */
for (int t = 0; t < nGroups; t++)
{
int maxLen = 0, minLen = 32;
int curr = BsGetBitsSmall(5);
if ((curr < 1) | (curr > BZip2Constants.MAX_CODE_LEN))
throw new InvalidOperationException();
for (i = 0; i < alphaSize; i++)
{
int markerBit = BsGetBit();
while (markerBit != 0)
{
int nextTwoBits = BsGetBitsSmall(2);
curr += 1 - (nextTwoBits & 2);
if ((curr < 1) | (curr > BZip2Constants.MAX_CODE_LEN))
throw new InvalidOperationException();
markerBit = nextTwoBits & 1;
}
len_t[i] = (byte)curr;
maxLen = System.Math.Max(maxLen, curr);
minLen = System.Math.Min(minLen, curr);
}
/* Create the Huffman decoding tables */
HbCreateDecodeTables(limit[t], basev[t], perm[t], len_t, minLen, maxLen, alphaSize);
minLens[t] = minLen;
}
return nSelectors;
}
private void GetAndMoveToFrontDecode()
{
int i, j, nextSym;
int limitLast = BZip2Constants.baseBlockSize * blockSize100k;
origPtr = BsGetBits(24);
if (origPtr > 10 + limitLast)
throw new InvalidOperationException();
int nSelectors = RecvDecodingTables();
int alphaSize = nInUse + 2;
int EOB = nInUse + 1;
/*
Setting up the unzftab entries here is not strictly
necessary, but it does save having to do it later
in a separate pass, and so saves a block's worth of
cache misses.
*/
Array.Clear(unzftab, 0, unzftab.Length);
byte[] yy = new byte[nInUse];
for (i = 0; i < nInUse; ++i)
{
yy[i] = seqToUnseq[i];
}
last = -1;
int groupNo = 0;
int groupPos = BZip2Constants.G_SIZE - 1;
int groupSel = m_selectors[groupNo];
int groupMinLen = minLens[groupSel];
int[] groupLimits = limit[groupSel];
int[] groupPerm = perm[groupSel];
int[] groupBase = basev[groupSel];
{
int zn = groupMinLen;
int zvec = BsGetBits(groupMinLen);
while (zvec >= groupLimits[zn])
{
if (++zn > BZip2Constants.MAX_CODE_LEN)
throw new InvalidOperationException();
zvec = (zvec << 1) | BsGetBit();
}
int permIndex = zvec - groupBase[zn];
if (permIndex >= alphaSize)
throw new InvalidOperationException();
nextSym = groupPerm[permIndex];
}
while (nextSym != EOB)
{
//if (nextSym == BZip2Constants.RUNA || nextSym == BZip2Constants.RUNB)
if (nextSym <= BZip2Constants.RUNB)
{
int n = 1, s = 0;
do
{
if (n > 1024 * 1024)
throw new InvalidOperationException();
s += n << nextSym;
n <<= 1;
{
if (groupPos == 0)
{
if (++groupNo >= nSelectors)
throw new InvalidOperationException();
groupPos = BZip2Constants.G_SIZE;
groupSel = m_selectors[groupNo];
groupMinLen = minLens[groupSel];
groupLimits = limit[groupSel];
groupPerm = perm[groupSel];
groupBase = basev[groupSel];
}
groupPos--;
int zn = groupMinLen;
int zvec = BsGetBits(groupMinLen);
while (zvec >= groupLimits[zn])
{
if (++zn > BZip2Constants.MAX_CODE_LEN)
throw new InvalidOperationException();
zvec = (zvec << 1) | BsGetBit();
}
int permIndex = zvec - groupBase[zn];
if (permIndex >= alphaSize)
throw new InvalidOperationException();
nextSym = groupPerm[permIndex];
}
}
//while (nextSym == BZip2Constants.RUNA || nextSym == BZip2Constants.RUNB);
while (nextSym <= BZip2Constants.RUNB);
byte ch = yy[0];
unzftab[ch] += s;
if (last >= limitLast - s)
throw new InvalidOperationException("Block overrun");
while (--s >= 0)
{
ll8[++last] = ch;
}
continue;
}
else
{
if (++last >= limitLast)
throw new InvalidOperationException("Block overrun");
byte tmp = yy[nextSym - 1];
unzftab[tmp]++;
ll8[last] = tmp;
/*
* This loop is hammered during decompression, hence avoid
* native method call overhead of Array.Copy for very
* small ranges to copy.
*/
if (nextSym <= 16)
{
for (j = nextSym - 1; j > 0; --j)
{
yy[j] = yy[j - 1];
}
}
else
{
Array.Copy(yy, 0, yy, 1, nextSym - 1);
}
yy[0] = tmp;
{
if (groupPos == 0)
{
if (++groupNo >= nSelectors)
throw new InvalidOperationException();
groupPos = BZip2Constants.G_SIZE;
groupSel = m_selectors[groupNo];
groupMinLen = minLens[groupSel];
groupLimits = limit[groupSel];
groupPerm = perm[groupSel];
groupBase = basev[groupSel];
}
groupPos--;
int zn = groupMinLen;
int zvec = BsGetBits(groupMinLen);
while (zvec >= groupLimits[zn])
{
if (++zn > BZip2Constants.MAX_CODE_LEN)
throw new InvalidOperationException();
zvec = (zvec << 1) | BsGetBit();
}
int permIndex = zvec - groupBase[zn];
if (permIndex >= alphaSize)
throw new InvalidOperationException();
nextSym = groupPerm[permIndex];
}
continue;
}
}
if (origPtr > last)
throw new InvalidOperationException();
// Check unzftab entries are in range.
{
int nblock = last + 1;
int check = 0;
for (i = 0; i <= 255; i++)
{
int t = unzftab[i];
check |= t;
check |= nblock - t;
}
if (check < 0)
throw new InvalidOperationException();
}
}
private int RequireByte()
{
int b = bsStream.ReadByte();
if (b < 0)
throw new EndOfStreamException();
return b & 0xFF;
}
private void SetupRandPartA()
{
if (i2 <= last)
{
chPrev = ch2;
ch2 = ll8[tPos];
tPos = tt[tPos];
if (rNToGo == 0)
{
rNToGo = CBZip2OutputStream.RNums[rTPos++];
rTPos &= 0x1FF;
}
rNToGo--;
ch2 ^= rNToGo == 1 ? 1 : 0;
i2++;
currentByte = ch2;
currentState = RAND_PART_B_STATE;
m_blockCrc.Update((byte)ch2);
}
else
{
EndBlock();
BeginBlock();
}
}
private void SetupNoRandPartA()
{
if (i2 <= last)
{
chPrev = ch2;
ch2 = ll8[tPos];
tPos = tt[tPos];
i2++;
currentByte = ch2;
currentState = NO_RAND_PART_B_STATE;
m_blockCrc.Update((byte)ch2);
}
else
{
EndBlock();
BeginBlock();
}
}
private void SetupRandPartB()
{
if (ch2 != chPrev)
{
count = 1;
SetupRandPartA();
}
else if (++count < 4)
{
SetupRandPartA();
}
else
{
z = ll8[tPos];
tPos = tt[tPos];
if (rNToGo == 0)
{
rNToGo = CBZip2OutputStream.RNums[rTPos++];
rTPos &= 0x1FF;
}
rNToGo--;
z ^= rNToGo == 1 ? 1 : 0;
j2 = 0;
currentState = RAND_PART_C_STATE;
SetupRandPartC();
}
}
private void SetupNoRandPartB()
{
if (ch2 != chPrev)
{
count = 1;
SetupNoRandPartA();
}
else if (++count < 4)
{
SetupNoRandPartA();
}
else
{
z = ll8[tPos];
tPos = tt[tPos];
currentState = NO_RAND_PART_C_STATE;
j2 = 0;
SetupNoRandPartC();
}
}
private void SetupRandPartC()
{
if (j2 < z)
{
currentByte = ch2;
m_blockCrc.Update((byte)ch2);
j2++;
}
else
{
i2++;
count = 0;
SetupRandPartA();
}
}
private void SetupNoRandPartC()
{
if (j2 < z)
{
currentByte = ch2;
m_blockCrc.Update((byte)ch2);
j2++;
}
else
{
i2++;
count = 0;
SetupNoRandPartA();
}
}
internal static int[][] CreateIntArray(int n1, int n2)
{
int[][] a = new int[n1][];
for (int k = 0; k < n1; ++k)
{
a[k] = new int[n2];
}
return a;
}
}
}
#pragma warning restore
#endif

11
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CBZip2InputStream.cs.meta vendored Normal file
View File

@@ -0,0 +1,11 @@
fileFormatVersion: 2
guid: f8aab073bc541d945bb0f604da6a2e7e
MonoImporter:
externalObjects: {}
serializedVersion: 2
defaultReferences: []
executionOrder: 0
icon: {instanceID: 0}
userData:
assetBundleName:
assetBundleVariant:

1623
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CBZip2OutputStream.cs vendored Normal file
View File

File diff suppressed because it is too large Load Diff

11
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CBZip2OutputStream.cs.meta vendored Normal file
View File

@@ -0,0 +1,11 @@
fileFormatVersion: 2
guid: f52b7adccce60e2458fcffa02a148187
MonoImporter:
externalObjects: {}
serializedVersion: 2
defaultReferences: []
executionOrder: 0
icon: {instanceID: 0}
userData:
assetBundleName:
assetBundleVariant:

162
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CRC.cs vendored Normal file
View File

@@ -0,0 +1,162 @@
#if !BESTHTTP_DISABLE_ALTERNATE_SSL && (!UNITY_WEBGL || UNITY_EDITOR)
#pragma warning disable
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
/*
* This package is based on the work done by Keiron Liddle), Aftex Software
* <keiron@aftexsw.com> to whom the Ant project is very grateful for his
* great code.
*/
using System.Diagnostics;
namespace Best.HTTP.SecureProtocol.Org.BouncyCastle.Utilities.Bzip2
{
/**
* A simple class the hold and calculate the CRC for sanity checking
* of the data.
*
* @author <a href="mailto:keiron@aftexsw.com">Keiron Liddle</a>
*/
internal class CRC
{
// Values are byte-reversed
private static readonly uint[] Crc32Table = {
0x00000000, 0xB71DC104, 0x6E3B8209, 0xD926430D,
0xDC760413, 0x6B6BC517, 0xB24D861A, 0x0550471E,
0xB8ED0826, 0x0FF0C922, 0xD6D68A2F, 0x61CB4B2B,
0x649B0C35, 0xD386CD31, 0x0AA08E3C, 0xBDBD4F38,
0x70DB114C, 0xC7C6D048, 0x1EE09345, 0xA9FD5241,
0xACAD155F, 0x1BB0D45B, 0xC2969756, 0x758B5652,
0xC836196A, 0x7F2BD86E, 0xA60D9B63, 0x11105A67,
0x14401D79, 0xA35DDC7D, 0x7A7B9F70, 0xCD665E74,
0xE0B62398, 0x57ABE29C, 0x8E8DA191, 0x39906095,
0x3CC0278B, 0x8BDDE68F, 0x52FBA582, 0xE5E66486,
0x585B2BBE, 0xEF46EABA, 0x3660A9B7, 0x817D68B3,
0x842D2FAD, 0x3330EEA9, 0xEA16ADA4, 0x5D0B6CA0,
0x906D32D4, 0x2770F3D0, 0xFE56B0DD, 0x494B71D9,
0x4C1B36C7, 0xFB06F7C3, 0x2220B4CE, 0x953D75CA,
0x28803AF2, 0x9F9DFBF6, 0x46BBB8FB, 0xF1A679FF,
0xF4F63EE1, 0x43EBFFE5, 0x9ACDBCE8, 0x2DD07DEC,
0x77708634, 0xC06D4730, 0x194B043D, 0xAE56C539,
0xAB068227, 0x1C1B4323, 0xC53D002E, 0x7220C12A,
0xCF9D8E12, 0x78804F16, 0xA1A60C1B, 0x16BBCD1F,
0x13EB8A01, 0xA4F64B05, 0x7DD00808, 0xCACDC90C,
0x07AB9778, 0xB0B6567C, 0x69901571, 0xDE8DD475,
0xDBDD936B, 0x6CC0526F, 0xB5E61162, 0x02FBD066,
0xBF469F5E, 0x085B5E5A, 0xD17D1D57, 0x6660DC53,
0x63309B4D, 0xD42D5A49, 0x0D0B1944, 0xBA16D840,
0x97C6A5AC, 0x20DB64A8, 0xF9FD27A5, 0x4EE0E6A1,
0x4BB0A1BF, 0xFCAD60BB, 0x258B23B6, 0x9296E2B2,
0x2F2BAD8A, 0x98366C8E, 0x41102F83, 0xF60DEE87,
0xF35DA999, 0x4440689D, 0x9D662B90, 0x2A7BEA94,
0xE71DB4E0, 0x500075E4, 0x892636E9, 0x3E3BF7ED,
0x3B6BB0F3, 0x8C7671F7, 0x555032FA, 0xE24DF3FE,
0x5FF0BCC6, 0xE8ED7DC2, 0x31CB3ECF, 0x86D6FFCB,
0x8386B8D5, 0x349B79D1, 0xEDBD3ADC, 0x5AA0FBD8,
0xEEE00C69, 0x59FDCD6D, 0x80DB8E60, 0x37C64F64,
0x3296087A, 0x858BC97E, 0x5CAD8A73, 0xEBB04B77,
0x560D044F, 0xE110C54B, 0x38368646, 0x8F2B4742,
0x8A7B005C, 0x3D66C158, 0xE4408255, 0x535D4351,
0x9E3B1D25, 0x2926DC21, 0xF0009F2C, 0x471D5E28,
0x424D1936, 0xF550D832, 0x2C769B3F, 0x9B6B5A3B,
0x26D61503, 0x91CBD407, 0x48ED970A, 0xFFF0560E,
0xFAA01110, 0x4DBDD014, 0x949B9319, 0x2386521D,
0x0E562FF1, 0xB94BEEF5, 0x606DADF8, 0xD7706CFC,
0xD2202BE2, 0x653DEAE6, 0xBC1BA9EB, 0x0B0668EF,
0xB6BB27D7, 0x01A6E6D3, 0xD880A5DE, 0x6F9D64DA,
0x6ACD23C4, 0xDDD0E2C0, 0x04F6A1CD, 0xB3EB60C9,
0x7E8D3EBD, 0xC990FFB9, 0x10B6BCB4, 0xA7AB7DB0,
0xA2FB3AAE, 0x15E6FBAA, 0xCCC0B8A7, 0x7BDD79A3,
0xC660369B, 0x717DF79F, 0xA85BB492, 0x1F467596,
0x1A163288, 0xAD0BF38C, 0x742DB081, 0xC3307185,
0x99908A5D, 0x2E8D4B59, 0xF7AB0854, 0x40B6C950,
0x45E68E4E, 0xF2FB4F4A, 0x2BDD0C47, 0x9CC0CD43,
0x217D827B, 0x9660437F, 0x4F460072, 0xF85BC176,
0xFD0B8668, 0x4A16476C, 0x93300461, 0x242DC565,
0xE94B9B11, 0x5E565A15, 0x87701918, 0x306DD81C,
0x353D9F02, 0x82205E06, 0x5B061D0B, 0xEC1BDC0F,
0x51A69337, 0xE6BB5233, 0x3F9D113E, 0x8880D03A,
0x8DD09724, 0x3ACD5620, 0xE3EB152D, 0x54F6D429,
0x7926A9C5, 0xCE3B68C1, 0x171D2BCC, 0xA000EAC8,
0xA550ADD6, 0x124D6CD2, 0xCB6B2FDF, 0x7C76EEDB,
0xC1CBA1E3, 0x76D660E7, 0xAFF023EA, 0x18EDE2EE,
0x1DBDA5F0, 0xAAA064F4, 0x738627F9, 0xC49BE6FD,
0x09FDB889, 0xBEE0798D, 0x67C63A80, 0xD0DBFB84,
0xD58BBC9A, 0x62967D9E, 0xBBB03E93, 0x0CADFF97,
0xB110B0AF, 0x060D71AB, 0xDF2B32A6, 0x6836F3A2,
0x6D66B4BC, 0xDA7B75B8, 0x035D36B5, 0xB440F7B1,
};
private uint m_value = 0U;
internal void Initialise()
{
m_value = 0xFFFFFFFF;
}
internal int GetFinal()
{
return (int)~Integers.ReverseBytes(m_value);
}
internal void Update(byte inCh)
{
m_value = (m_value >> 8) ^ Crc32Table[(byte)(m_value ^ inCh)];
}
internal void UpdateRun(byte inCh, int runLength)
{
Debug.Assert(runLength >= 4);
uint inCh2 = (uint)inCh << 8 | inCh;
uint inCh4 = inCh2 << 16 | inCh2;
do
{
m_value ^= inCh4;
m_value = (m_value >> 8) ^ Crc32Table[(byte)m_value];
m_value = (m_value >> 8) ^ Crc32Table[(byte)m_value];
m_value = (m_value >> 8) ^ Crc32Table[(byte)m_value];
m_value = (m_value >> 8) ^ Crc32Table[(byte)m_value];
}
while ((runLength -= 4) >= 4);
switch (runLength & 3)
{
case 0:
break;
case 1:
Update(inCh);
break;
case 2:
Update(inCh);
Update(inCh);
break;
case 3:
Update(inCh);
Update(inCh);
Update(inCh);
break;
}
}
}
}
#pragma warning restore
#endif

11
Packages/com.tivadar.best.http/Runtime/3rdParty/BouncyCastle/util/bzip2/CRC.cs.meta vendored Normal file
View File

@@ -0,0 +1,11 @@
fileFormatVersion: 2
guid: 16e988d7db3476c45a8d1d6e679162ce
MonoImporter:
externalObjects: {}
serializedVersion: 2
defaultReferences: []
executionOrder: 0
icon: {instanceID: 0}
userData:
assetBundleName:
assetBundleVariant: