diff --git a/crypto/src/util/bzip2/BZip2Constants.cs b/crypto/src/util/bzip2/BZip2Constants.cs
new file mode 100644
index 000000000..6fc15e55f
--- /dev/null
+++ b/crypto/src/util/bzip2/BZip2Constants.cs
@@ -0,0 +1,47 @@
+/*
+ * 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 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;
+ }
+}
diff --git a/crypto/src/util/bzip2/CBZip2InputStream.cs b/crypto/src/util/bzip2/CBZip2InputStream.cs
new file mode 100644
index 000000000..7879f28af
--- /dev/null
+++ b/crypto/src/util/bzip2/CBZip2InputStream.cs
@@ -0,0 +1,809 @@
+/*
+ * 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 Org.BouncyCastle.Utilities.IO;
+
+namespace 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)
+ {
+ Platform.Dispose(this.bsStream);
+ 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;
+ }
+ }
+}
diff --git a/crypto/src/util/bzip2/CBZip2OutputStream.cs b/crypto/src/util/bzip2/CBZip2OutputStream.cs
new file mode 100644
index 000000000..b896f36c6
--- /dev/null
+++ b/crypto/src/util/bzip2/CBZip2OutputStream.cs
@@ -0,0 +1,1619 @@
+/*
+ * 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.Collections.Generic;
+using System.Diagnostics;
+using System.IO;
+
+using Org.BouncyCastle.Utilities.IO;
+
+namespace Org.BouncyCastle.Utilities.Bzip2
+{
+ /**
+ * An output stream that compresses into the BZip2 format (with the file
+ * header chars) into another stream.
+ *
+ * @author <a href="mailto:keiron@aftexsw.com">Keiron Liddle</a>
+ *
+ * TODO: Update to BZip2 1.0.1
+ * <b>NB:</b> note this class has been modified to add a leading BZ to the
+ * start of the BZIP2 stream to make it compatible with other PGP programs.
+ */
+ public class CBZip2OutputStream
+ : BaseOutputStream
+ {
+ protected const int SETMASK = 1 << 21;
+ protected const int CLEARMASK = ~SETMASK;
+ protected const int GREATER_ICOST = 15;
+ protected const int LESSER_ICOST = 0;
+ protected const int SMALL_THRESH = 20;
+ protected const int DEPTH_THRESH = 10;
+
+ internal static readonly ushort[] RNums = {
+ 619, 720, 127, 481, 931, 816, 813, 233, 566, 247, 985, 724, 205, 454, 863, 491, 741, 242, 949, 214, 733,
+ 859, 335, 708, 621, 574, 73, 654, 730, 472, 419, 436, 278, 496, 867, 210, 399, 680, 480, 51, 878, 465, 811,
+ 169, 869, 675, 611, 697, 867, 561, 862, 687, 507, 283, 482, 129, 807, 591, 733, 623, 150, 238, 59, 379, 684,
+ 877, 625, 169, 643, 105, 170, 607, 520, 932, 727, 476, 693, 425, 174, 647, 73, 122, 335, 530, 442, 853, 695,
+ 249, 445, 515, 909, 545, 703, 919, 874, 474, 882, 500, 594, 612, 641, 801, 220, 162, 819, 984, 589, 513,
+ 495, 799, 161, 604, 958, 533, 221, 400, 386, 867, 600, 782, 382, 596, 414, 171, 516, 375, 682, 485, 911,
+ 276, 98, 553, 163, 354, 666, 933, 424, 341, 533, 870, 227, 730, 475, 186, 263, 647, 537, 686, 600, 224, 469,
+ 68, 770, 919, 190, 373, 294, 822, 808, 206, 184, 943, 795, 384, 383, 461, 404, 758, 839, 887, 715, 67, 618,
+ 276, 204, 918, 873, 777, 604, 560, 951, 160, 578, 722, 79, 804, 96, 409, 713, 940, 652, 934, 970, 447, 318,
+ 353, 859, 672, 112, 785, 645, 863, 803, 350, 139, 93, 354, 99, 820, 908, 609, 772, 154, 274, 580, 184, 79,
+ 626, 630, 742, 653, 282, 762, 623, 680, 81, 927, 626, 789, 125, 411, 521, 938, 300, 821, 78, 343, 175, 128,
+ 250, 170, 774, 972, 275, 999, 639, 495, 78, 352, 126, 857, 956, 358, 619, 580, 124, 737, 594, 701, 612, 669,
+ 112, 134, 694, 363, 992, 809, 743, 168, 974, 944, 375, 748, 52, 600, 747, 642, 182, 862, 81, 344, 805, 988,
+ 739, 511, 655, 814, 334, 249, 515, 897, 955, 664, 981, 649, 113, 974, 459, 893, 228, 433, 837, 553, 268,
+ 926, 240, 102, 654, 459, 51, 686, 754, 806, 760, 493, 403, 415, 394, 687, 700, 946, 670, 656, 610, 738, 392,
+ 760, 799, 887, 653, 978, 321, 576, 617, 626, 502, 894, 679, 243, 440, 680, 879, 194, 572, 640, 724, 926, 56,
+ 204, 700, 707, 151, 457, 449, 797, 195, 791, 558, 945, 679, 297, 59, 87, 824, 713, 663, 412, 693, 342, 606,
+ 134, 108, 571, 364, 631, 212, 174, 643, 304, 329, 343, 97, 430, 751, 497, 314, 983, 374, 822, 928, 140, 206,
+ 73, 263, 980, 736, 876, 478, 430, 305, 170, 514, 364, 692, 829, 82, 855, 953, 676, 246, 369, 970, 294, 750,
+ 807, 827, 150, 790, 288, 923, 804, 378, 215, 828, 592, 281, 565, 555, 710, 82, 896, 831, 547, 261, 524, 462,
+ 293, 465, 502, 56, 661, 821, 976, 991, 658, 869, 905, 758, 745, 193, 768, 550, 608, 933, 378, 286, 215, 979,
+ 792, 961, 61, 688, 793, 644, 986, 403, 106, 366, 905, 644, 372, 567, 466, 434, 645, 210, 389, 550, 919, 135,
+ 780, 773, 635, 389, 707, 100, 626, 958, 165, 504, 920, 176, 193, 713, 857, 265, 203, 50, 668, 108, 645, 990,
+ 626, 197, 510, 357, 358, 850, 858, 364, 936, 638 };
+
+ /*
+ * Knuth's increments seem to work better than Incerpi-Sedgewick here, possibly because the number of elements
+ * to sort is usually small, typically <= 20.
+ */
+ private static readonly int[] Incs = { 1, 4, 13, 40, 121, 364, 1093, 3280, 9841, 29524, 88573, 265720, 797161,
+ 2391484 };
+
+ private bool finished;
+
+ protected static void HbMakeCodeLengths(byte[] len, int[] freq, int alphaSize, int maxLen)
+ {
+ /*
+ Nodes and heap entries run from 1. Entry 0
+ for both the heap and nodes is a sentinel.
+ */
+ int[] heap = new int[BZip2Constants.MAX_ALPHA_SIZE + 2];
+ int[] weight = new int[BZip2Constants.MAX_ALPHA_SIZE * 2];
+ int[] parent = new int[BZip2Constants.MAX_ALPHA_SIZE * 2];
+
+ for (int i = 0; i < alphaSize; i++)
+ {
+ weight[i + 1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
+ }
+
+ while (true)
+ {
+ int nNodes = alphaSize;
+ int nHeap = 0;
+
+ heap[0] = 0;
+ weight[0] = 0;
+ parent[0] = -2;
+
+ for (int i = 1; i <= alphaSize; i++)
+ {
+ parent[i] = -1;
+ heap[++nHeap] = i;
+ {
+ int zz = nHeap;
+ int tmp = heap[zz];
+ while (weight[tmp] < weight[heap[zz >> 1]])
+ {
+ heap[zz] = heap[zz >> 1];
+ zz >>= 1;
+ }
+ heap[zz] = tmp;
+ }
+ }
+ if (!(nHeap < (BZip2Constants.MAX_ALPHA_SIZE + 2)))
+ throw new InvalidOperationException();
+
+ while (nHeap > 1)
+ {
+ int n1 = heap[1];
+ heap[1] = heap[nHeap--];
+ {
+ int zz = 1;
+ int tmp = heap[zz];
+ while (true)
+ {
+ int yy = zz << 1;
+ if (yy > nHeap)
+ break;
+
+ if (yy < nHeap
+ && weight[heap[yy + 1]] < weight[heap[yy]])
+ {
+ yy++;
+ }
+
+ if (weight[tmp] < weight[heap[yy]])
+ break;
+
+ heap[zz] = heap[yy];
+ zz = yy;
+ }
+ heap[zz] = tmp;
+ }
+ int n2 = heap[1];
+ heap[1] = heap[nHeap--];
+ {
+ int zz = 1;
+ int tmp = heap[zz];
+ while (true)
+ {
+ int yy = zz << 1;
+ if (yy > nHeap)
+ break;
+
+ if (yy < nHeap
+ && weight[heap[yy + 1]] < weight[heap[yy]])
+ {
+ yy++;
+ }
+
+ if (weight[tmp] < weight[heap[yy]])
+ break;
+
+ heap[zz] = heap[yy];
+ zz = yy;
+ }
+ heap[zz] = tmp;
+ }
+ nNodes++;
+ parent[n1] = parent[n2] = nNodes;
+
+ weight[nNodes] = (int)((uint)((weight[n1] & 0xffffff00)
+ + (weight[n2] & 0xffffff00))
+ | (uint)(1 + (((weight[n1] & 0x000000ff) >
+ (weight[n2] & 0x000000ff)) ?
+ (weight[n1] & 0x000000ff) :
+ (weight[n2] & 0x000000ff))));
+
+ parent[nNodes] = -1;
+ heap[++nHeap] = nNodes;
+ {
+ int zz = nHeap;
+ int tmp = heap[zz];
+ while (weight[tmp] < weight[heap[zz >> 1]])
+ {
+ heap[zz] = heap[zz >> 1];
+ zz >>= 1;
+ }
+ heap[zz] = tmp;
+ }
+ }
+ if (!(nNodes < (BZip2Constants.MAX_ALPHA_SIZE * 2)))
+ throw new InvalidOperationException();
+
+ //bool tooLong = false;
+ int tooLongBits = 0;
+ for (int i = 1; i <= alphaSize; i++)
+ {
+ int j = 0;
+ int k = i;
+ while (parent[k] >= 0)
+ {
+ k = parent[k];
+ j++;
+ }
+ len[i - 1] = (byte)j;
+ //tooLong |= j > maxLen;
+ tooLongBits |= maxLen - j;
+ }
+
+ //if (!tooLong)
+ if (tooLongBits >= 0)
+ break;
+
+ for (int i = 1; i <= alphaSize; i++)
+ {
+ int j = weight[i] >> 8;
+ j = 1 + (j / 2);
+ weight[i] = j << 8;
+ }
+ }
+ }
+
+ /*
+ * number of characters in the block
+ */
+ int count;
+
+ /*
+ index in zptr[] of original string after sorting.
+ */
+ int origPtr;
+
+ /*
+ always: in the range 0 .. 9.
+ The current block size is 100000 * this number.
+ */
+ private readonly int blockSize100k;
+ private readonly int allowableBlockSize;
+
+ bool blockRandomised;
+ private readonly IList<StackElem> blocksortStack = new List<StackElem>();
+
+ int bsBuff;
+ int bsLivePos;
+ private readonly CRC m_blockCrc = new CRC();
+
+ private bool[] inUse = new bool[256];
+ private int nInUse;
+
+ private byte[] m_selectors = new byte[BZip2Constants.MAX_SELECTORS];
+
+ private byte[] blockBytes;
+ private ushort[] quadrantShorts;
+ private int[] zptr;
+ private int[] szptr;
+ private int[] ftab;
+
+ private int nMTF;
+
+ private int[] mtfFreq = new int[BZip2Constants.MAX_ALPHA_SIZE];
+
+ /*
+ * Used when sorting. If too many long comparisons
+ * happen, we stop sorting, randomise the block
+ * slightly, and try again.
+ */
+ private int workFactor;
+ private int workDone;
+ private int workLimit;
+ private bool firstAttempt;
+
+ private int currentByte = -1;
+ private int runLength = 0;
+ private int m_streamCrc;
+
+ public CBZip2OutputStream(Stream outStream)
+ : this(outStream, 9)
+ {
+ }
+
+ public CBZip2OutputStream(Stream outStream, int blockSize)
+ {
+ blockBytes = null;
+ quadrantShorts = null;
+ zptr = null;
+ ftab = null;
+
+ outStream.WriteByte((byte)'B');
+ outStream.WriteByte((byte)'Z');
+
+ bsStream = outStream;
+ bsBuff = 0;
+ bsLivePos = 32;
+
+ workFactor = 50;
+ if (blockSize > 9)
+ {
+ blockSize = 9;
+ }
+ else if (blockSize < 1)
+ {
+ blockSize = 1;
+ }
+ blockSize100k = blockSize;
+
+ /* 20 is just a paranoia constant */
+ allowableBlockSize = BZip2Constants.baseBlockSize * blockSize100k - 20;
+
+ int n = BZip2Constants.baseBlockSize * blockSize100k;
+ blockBytes = new byte[(n + 1 + BZip2Constants.NUM_OVERSHOOT_BYTES)];
+ quadrantShorts = new ushort[(n + 1 + BZip2Constants.NUM_OVERSHOOT_BYTES)];
+ zptr = new int[n];
+ ftab = new int[65537];
+
+ /*
+ The back end needs a place to store the MTF values
+ whilst it calculates the coding tables. We could
+ put them in the zptr array. However, these values
+ will fit in a short, so we overlay szptr at the
+ start of zptr, in the hope of reducing the number
+ of cache misses induced by the multiple traversals
+ of the MTF values when calculating coding tables.
+ Seems to improve compression speed by about 1%.
+ */
+ // NOTE: We can't "overlay" in C#, so we just share zptr
+ szptr = zptr;
+
+ // Write `magic' bytes h indicating file-format == huffmanised, followed by a digit indicating blockSize100k
+ outStream.WriteByte((byte)'h');
+ outStream.WriteByte((byte)('0' + blockSize100k));
+
+ m_streamCrc = 0;
+
+ InitBlock();
+ }
+
+ /**
+ *
+ * modified by Oliver Merkel, 010128
+ *
+ */
+ public override void WriteByte(byte value)
+ {
+ if (currentByte == value)
+ {
+ if (++runLength > 254)
+ {
+ WriteRun();
+ currentByte = -1;
+ runLength = 0;
+ }
+ return;
+ }
+
+ if (currentByte >= 0)
+ {
+ WriteRun();
+ }
+
+ currentByte = value;
+ runLength = 1;
+ }
+
+ private void WriteRun()
+ {
+ if (count > allowableBlockSize)
+ {
+ EndBlock();
+ InitBlock();
+ }
+
+ inUse[currentByte] = true;
+
+ switch (runLength)
+ {
+ case 1:
+ blockBytes[++count] = (byte)currentByte;
+ m_blockCrc.Update((byte)currentByte);
+ break;
+ case 2:
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ m_blockCrc.Update((byte)currentByte);
+ m_blockCrc.Update((byte)currentByte);
+ break;
+ case 3:
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ m_blockCrc.Update((byte)currentByte);
+ m_blockCrc.Update((byte)currentByte);
+ m_blockCrc.Update((byte)currentByte);
+ break;
+ default:
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)currentByte;
+ blockBytes[++count] = (byte)(runLength - 4);
+ inUse[runLength - 4] = true;
+ m_blockCrc.UpdateRun((byte)currentByte, runLength);
+ break;
+ }
+ }
+
+ bool closed = false;
+
+ protected void Detach(bool disposing)
+ {
+ if (disposing)
+ {
+ if (!closed)
+ {
+ Finish();
+ closed = true;
+ }
+ }
+ base.Dispose(disposing);
+ }
+
+ protected override void Dispose(bool disposing)
+ {
+ if (disposing)
+ {
+ if (!closed)
+ {
+ Finish();
+ closed = true;
+ Platform.Dispose(this.bsStream);
+ }
+ }
+ base.Dispose(disposing);
+ }
+
+ public void Finish()
+ {
+ if (finished)
+ return;
+
+ if (runLength > 0)
+ {
+ WriteRun();
+ }
+ currentByte = -1;
+ if (count > 0)
+ {
+ EndBlock();
+ }
+ EndCompression();
+ finished = true;
+ Flush();
+ }
+
+ public override void Flush()
+ {
+ bsStream.Flush();
+ }
+
+ private void InitBlock()
+ {
+ m_blockCrc.Initialise();
+ count = 0;
+
+ for (int i = 0; i < 256; i++)
+ {
+ inUse[i] = false;
+ }
+ }
+
+ private void EndBlock()
+ {
+ int blockFinalCrc = m_blockCrc.GetFinal();
+ m_streamCrc = Integers.RotateLeft(m_streamCrc, 1) ^ blockFinalCrc;
+
+ /* sort the block and establish posn of original string */
+ DoReversibleTransformation();
+
+ /*
+ A 6-byte block header, the value chosen arbitrarily
+ as 0x314159265359 :-). A 32 bit value does not really
+ give a strong enough guarantee that the value will not
+ appear by chance in the compressed datastream. Worst-case
+ probability of this event, for a 900k block, is about
+ 2.0e-3 for 32 bits, 1.0e-5 for 40 bits and 4.0e-8 for 48 bits.
+ For a compressed file of size 100Gb -- about 100000 blocks --
+ only a 48-bit marker will do. NB: normal compression/
+ decompression do *not* rely on these statistical properties.
+ They are only important when trying to recover blocks from
+ damaged files.
+ */
+ BsPutLong48(0x314159265359L);
+
+ /* Now the block's CRC, so it is in a known place. */
+ BsPutInt32(blockFinalCrc);
+
+ /* Now a single bit indicating randomisation. */
+ BsPutBit(blockRandomised ? 1 : 0);
+
+ /* Finally, block's contents proper. */
+ MoveToFrontCodeAndSend();
+ }
+
+ private void EndCompression()
+ {
+ /*
+ Now another magic 48-bit number, 0x177245385090, to
+ indicate the end of the last block. (Sqrt(pi), if
+ you want to know. I did want to use e, but it contains
+ too much repetition -- 27 18 28 18 28 46 -- for me
+ to feel statistically comfortable. Call me paranoid.)
+ */
+ BsPutLong48(0x177245385090L);
+
+ BsPutInt32(m_streamCrc);
+
+ BsFinishedWithStream();
+ }
+
+ private void HbAssignCodes(int[] code, byte[] length, int minLen, int maxLen, int alphaSize)
+ {
+ int vec = 0;
+ for (int n = minLen; n <= maxLen; n++)
+ {
+ for (int i = 0; i < alphaSize; i++)
+ {
+ if (length[i] == n)
+ {
+ code[i] = vec++;
+ }
+ }
+ vec <<= 1;
+ }
+ }
+
+ private void BsFinishedWithStream()
+ {
+ if (bsLivePos < 32)
+ {
+ bsStream.WriteByte((byte)(bsBuff >> 24));
+ bsBuff = 0;
+ bsLivePos = 32;
+ }
+ }
+
+ private void BsPutBit(int v)
+ {
+ --bsLivePos;
+ bsBuff |= v << bsLivePos;
+
+ if (bsLivePos <= 24)
+ {
+ bsStream.WriteByte((byte)(bsBuff >> 24));
+ bsBuff <<= 8;
+ bsLivePos += 8;
+ }
+ }
+
+ private void BsPutBits(int n, int v)
+ {
+ Debug.Assert(1 <= n && n <= 24);
+
+ bsLivePos -= n;
+ bsBuff |= v << bsLivePos;
+
+ while (bsLivePos <= 24)
+ {
+ bsStream.WriteByte((byte)(bsBuff >> 24));
+ bsBuff <<= 8;
+ bsLivePos += 8;
+ }
+ }
+
+ private void BsPutBitsSmall(int n, int v)
+ {
+ Debug.Assert(1 <= n && n <= 8);
+
+ bsLivePos -= n;
+ bsBuff |= v << bsLivePos;
+
+ if (bsLivePos <= 24)
+ {
+ bsStream.WriteByte((byte)(bsBuff >> 24));
+ bsBuff <<= 8;
+ bsLivePos += 8;
+ }
+ }
+
+ private void BsPutInt32(int u)
+ {
+ BsPutBits(16, (u >> 16) & 0xFFFF);
+ BsPutBits(16, u & 0xFFFF);
+ }
+
+ private void BsPutLong48(long u)
+ {
+ BsPutBits(24, (int)(u >> 24) & 0xFFFFFF);
+ BsPutBits(24, (int)u & 0xFFFFFF);
+ }
+
+ private void SendMtfValues()
+ {
+
+ int v, t, i, j, bt, bc, iter;
+
+ int alphaSize = nInUse + 2;
+
+ /* Decide how many coding tables to use */
+ if (nMTF <= 0)
+ throw new InvalidOperationException();
+
+ int nGroups;
+ if (nMTF < 200)
+ {
+ nGroups = 2;
+ }
+ else if (nMTF < 600)
+ {
+ nGroups = 3;
+ }
+ else if (nMTF < 1200)
+ {
+ nGroups = 4;
+ }
+ else if (nMTF < 2400)
+ {
+ nGroups = 5;
+ }
+ else
+ {
+ nGroups = 6;
+ }
+
+ byte[][] len = CreateByteArray(nGroups, alphaSize);
+ for (t = 0; t < nGroups; t++)
+ {
+ Arrays.Fill(len[t], GREATER_ICOST);
+ }
+
+ /* Generate an initial set of coding tables */
+ {
+ int nPart = nGroups;
+ int remF = nMTF;
+ int ge = -1;
+ while (nPart > 0)
+ {
+ int gs = ge + 1;
+ int aFreq = 0, tFreq = remF / nPart;
+ while (aFreq < tFreq && ge < alphaSize - 1)
+ {
+ aFreq += mtfFreq[++ge];
+ }
+
+ if (ge > gs && nPart != nGroups && nPart != 1
+ && ((nGroups - nPart) % 2 == 1))
+ {
+ aFreq -= mtfFreq[ge--];
+ }
+
+ byte[] len_np = len[nPart - 1];
+ for (v = 0; v < alphaSize; v++)
+ {
+ if (v >= gs && v <= ge)
+ {
+ len_np[v] = LESSER_ICOST;
+ }
+ else
+ {
+ len_np[v] = GREATER_ICOST;
+ }
+ }
+
+ nPart--;
+ remF -= aFreq;
+ }
+ }
+
+ int[][] rfreq = CBZip2InputStream.CreateIntArray(BZip2Constants.N_GROUPS, BZip2Constants.MAX_ALPHA_SIZE);
+ int[] fave = new int[BZip2Constants.N_GROUPS];
+ short[] cost = new short[BZip2Constants.N_GROUPS];
+
+ // Iterate up to N_ITERS times to improve the tables.
+ int nSelectors = 0;
+ for (iter = 0; iter < BZip2Constants.N_ITERS; iter++)
+ {
+ for (t = 0; t < nGroups; t++)
+ {
+ fave[t] = 0;
+
+ int[] rfreq_t = rfreq[t];
+ for (v = 0; v < alphaSize; v++)
+ {
+ rfreq_t[v] = 0;
+ }
+ }
+
+ nSelectors = 0;
+ int gs = 0;
+ while (gs < nMTF)
+ {
+ /* Set group start & end marks. */
+
+ /*
+ * Calculate the cost of this group as coded by each of the coding tables.
+ */
+
+ int ge = System.Math.Min(gs + BZip2Constants.G_SIZE - 1, nMTF - 1);
+
+ if (nGroups == 6)
+ {
+ byte[] len_0 = len[0], len_1 = len[1], len_2 = len[2], len_3 = len[3], len_4 = len[4], len_5 = len[5];
+ short cost0 = 0, cost1 = 0, cost2 = 0, cost3 = 0, cost4 = 0, cost5 = 0;
+
+ for (i = gs; i <= ge; i++)
+ {
+ int icv = szptr[i];
+ cost0 += len_0[icv];
+ cost1 += len_1[icv];
+ cost2 += len_2[icv];
+ cost3 += len_3[icv];
+ cost4 += len_4[icv];
+ cost5 += len_5[icv];
+ }
+
+ cost[0] = cost0;
+ cost[1] = cost1;
+ cost[2] = cost2;
+ cost[3] = cost3;
+ cost[4] = cost4;
+ cost[5] = cost5;
+ }
+ else
+ {
+ for (t = 0; t < nGroups; t++)
+ {
+ cost[t] = 0;
+ }
+
+ for (i = gs; i <= ge; i++)
+ {
+ int icv = szptr[i];
+ for (t = 0; t < nGroups; t++)
+ {
+ cost[t] += len[t][icv];
+ }
+ }
+ }
+
+ /*
+ Find the coding table which is best for this group,
+ and record its identity in the selector table.
+ */
+ bc = cost[0];
+ bt = 0;
+ for (t = 1; t < nGroups; t++)
+ {
+ short cost_t = cost[t];
+ if (cost_t < bc)
+ {
+ bc = cost_t;
+ bt = t;
+ }
+ }
+ fave[bt]++;
+ m_selectors[nSelectors] = (byte)bt;
+ nSelectors++;
+
+ /*
+ Increment the symbol frequencies for the selected table.
+ */
+ int[] rfreq_bt = rfreq[bt];
+ for (i = gs; i <= ge; i++)
+ {
+ rfreq_bt[szptr[i]]++;
+ }
+
+ gs = ge + 1;
+ }
+
+ /*
+ Recompute the tables based on the accumulated frequencies.
+ */
+ for (t = 0; t < nGroups; t++)
+ {
+ HbMakeCodeLengths(len[t], rfreq[t], alphaSize, BZip2Constants.MAX_CODE_LEN_GEN);
+ }
+ }
+
+ if (nGroups >= 8 || nGroups > BZip2Constants.N_GROUPS)
+ throw new InvalidOperationException();
+ if (nSelectors >= 32768 || nSelectors > BZip2Constants.MAX_SELECTORS)
+ throw new InvalidOperationException();
+
+ int[][] code = CBZip2InputStream.CreateIntArray(BZip2Constants.N_GROUPS, BZip2Constants.MAX_ALPHA_SIZE);
+
+ /* Assign actual codes for the tables. */
+ for (t = 0; t < nGroups; t++)
+ {
+ int maxLen = 0, minLen = 32;
+ byte[] len_t = len[t];
+ for (i = 0; i < alphaSize; i++)
+ {
+ int lti = len_t[i];
+ maxLen = System.Math.Max(maxLen, lti);
+ minLen = System.Math.Min(minLen, lti);
+ }
+ if (minLen < 1 | maxLen > BZip2Constants.MAX_CODE_LEN_GEN)
+ throw new InvalidOperationException();
+
+ HbAssignCodes(code[t], len_t, minLen, maxLen, alphaSize);
+ }
+
+ /* Transmit the mapping table. */
+ {
+ bool[] inUse16 = new bool[16];
+ for (i = 0; i < 16; i++)
+ {
+ inUse16[i] = false;
+ int i16 = i * 16;
+ for (j = 0; j < 16; j++)
+ {
+ if (inUse[i16 + j])
+ {
+ inUse16[i] = true;
+ break;
+ }
+ }
+ }
+
+ for (i = 0; i < 16; i++)
+ {
+ BsPutBit(inUse16[i] ? 1 : 0);
+ }
+
+ for (i = 0; i < 16; i++)
+ {
+ if (inUse16[i])
+ {
+ int i16 = i * 16;
+ for (j = 0; j < 16; j++)
+ {
+ BsPutBit(inUse[i16 + j] ? 1 : 0);
+ }
+ }
+ }
+ }
+
+ /* Now the selectors. */
+ BsPutBitsSmall(3, nGroups);
+ BsPutBits(15, nSelectors);
+ {
+ int mtfSelectors = 0x00654321;
+
+ for (i = 0; i < nSelectors; i++)
+ {
+ // Compute MTF value for the selector.
+ int ll_i = m_selectors[i];
+ int bitPos = ll_i << 2;
+ int mtfSelector = (mtfSelectors >> bitPos) & 0xF;
+
+ if (mtfSelector != 1)
+ {
+ int mtfIncMask = (0x00888888 - mtfSelectors + 0x00111111 * mtfSelector) & 0x00888888;
+ mtfSelectors = mtfSelectors - (mtfSelector << bitPos) + (mtfIncMask >> 3);
+ }
+
+ BsPutBitsSmall(mtfSelector, (1 << mtfSelector) - 2);
+ }
+ }
+
+ /* Now the coding tables. */
+ for (t = 0; t < nGroups; t++)
+ {
+ byte[] len_t = len[t];
+ int curr = len_t[0];
+ BsPutBitsSmall(6, curr << 1);
+ for (i = 1; i < alphaSize; i++)
+ {
+ int lti = len_t[i];
+ while (curr < lti)
+ {
+ BsPutBitsSmall(2, 2);
+ curr++; /* 10 */
+ }
+ while (curr > lti)
+ {
+ BsPutBitsSmall(2, 3);
+ curr--; /* 11 */
+ }
+ BsPutBit(0);
+ }
+ }
+
+ /* And finally, the block data proper */
+ {
+ int selCtr = 0;
+ int gs = 0;
+ while (gs < nMTF)
+ {
+ int ge = System.Math.Min(gs + BZip2Constants.G_SIZE - 1, nMTF - 1);
+
+ int selector_selCtr = m_selectors[selCtr];
+ byte[] len_selCtr = len[selector_selCtr];
+ int[] code_selCtr = code[selector_selCtr];
+
+ for (i = gs; i <= ge; i++)
+ {
+ int sfmap_i = szptr[i];
+ BsPutBits(len_selCtr[sfmap_i], code_selCtr[sfmap_i]);
+ }
+
+ gs = ge + 1;
+ selCtr++;
+ }
+ if (selCtr != nSelectors)
+ throw new InvalidOperationException();
+ }
+ }
+
+ private void MoveToFrontCodeAndSend()
+ {
+ BsPutBits(24, origPtr);
+ GenerateMtfValues();
+ SendMtfValues();
+ }
+
+ private Stream bsStream;
+
+ private void SimpleSort(int lo, int hi, int d)
+ {
+ int i, j, h, v;
+
+ int bigN = hi - lo + 1;
+ if (bigN < 2)
+ return;
+
+ int hp = 0;
+ while (Incs[hp] < bigN)
+ {
+ hp++;
+ }
+ hp--;
+
+ for (; hp >= 0; hp--)
+ {
+ h = Incs[hp];
+
+ i = lo + h;
+ while (i <= hi)
+ {
+ /* copy 1 */
+ v = zptr[i];
+ j = i;
+ while (FullGtU(zptr[j - h] + d, v + d))
+ {
+ zptr[j] = zptr[j - h];
+ j = j - h;
+ if (j <= (lo + h - 1))
+ break;
+ }
+ zptr[j] = v;
+
+ /* copy 2 */
+ if (++i > hi)
+ break;
+
+ v = zptr[i];
+ j = i;
+ while (FullGtU(zptr[j - h] + d, v + d))
+ {
+ zptr[j] = zptr[j - h];
+ j = j - h;
+ if (j <= (lo + h - 1))
+ break;
+ }
+ zptr[j] = v;
+
+ /* copy 3 */
+ if (++i > hi)
+ break;
+
+ v = zptr[i];
+ j = i;
+ while (FullGtU(zptr[j - h] + d, v + d))
+ {
+ zptr[j] = zptr[j - h];
+ j = j - h;
+ if (j <= (lo + h - 1))
+ break;
+ }
+ zptr[j] = v;
+ i++;
+
+ if (workDone > workLimit && firstAttempt)
+ return;
+ }
+ }
+ }
+
+ private void Vswap(int p1, int p2, int n)
+ {
+ while (--n >= 0)
+ {
+ int t1 = zptr[p1], t2 = zptr[p2];
+ zptr[p1++] = t2;
+ zptr[p2++] = t1;
+ }
+ }
+
+ private int Med3(int a, int b, int c)
+ {
+ return a > b
+ ? (c < b ? b : c > a ? a : c)
+ : (c < a ? a : c > b ? b : c);
+ }
+
+ internal class StackElem
+ {
+ internal int ll;
+ internal int hh;
+ internal int dd;
+ }
+
+ private static void PushStackElem(IList<StackElem> stack, int stackCount, int ll, int hh, int dd)
+ {
+ StackElem stackElem;
+ if (stackCount < stack.Count)
+ {
+ stackElem = stack[stackCount];
+ }
+ else
+ {
+ stackElem = new StackElem();
+ stack.Add(stackElem);
+ }
+
+ stackElem.ll = ll;
+ stackElem.hh = hh;
+ stackElem.dd = dd;
+ }
+
+ private void QSort3(int loSt, int hiSt, int dSt)
+ {
+ int unLo, unHi, ltLo, gtHi, n, m;
+
+ var stack = blocksortStack;
+ int stackCount = 0;
+ StackElem stackElem;
+
+ int lo = loSt;
+ int hi = hiSt;
+ int d = dSt;
+
+ for (;;)
+ {
+ if (hi - lo < SMALL_THRESH || d > DEPTH_THRESH)
+ {
+ SimpleSort(lo, hi, d);
+ if (stackCount < 1 || (workDone > workLimit && firstAttempt))
+ return;
+
+ stackElem = stack[--stackCount];
+ lo = stackElem.ll;
+ hi = stackElem.hh;
+ d = stackElem.dd;
+ continue;
+ }
+
+ int d1 = d + 1;
+ int med = Med3(
+ blockBytes[zptr[lo] + d1],
+ blockBytes[zptr[hi] + d1],
+ blockBytes[zptr[(lo + hi) >> 1] + d1]);
+
+ unLo = ltLo = lo;
+ unHi = gtHi = hi;
+
+ while (true)
+ {
+ while (unLo <= unHi)
+ {
+ int zUnLo = zptr[unLo];
+ n = blockBytes[zUnLo + d1] - med;
+ if (n > 0)
+ break;
+
+ if (n == 0)
+ {
+ zptr[unLo] = zptr[ltLo];
+ zptr[ltLo++] = zUnLo;
+ }
+ unLo++;
+ }
+ while (unLo <= unHi)
+ {
+ int zUnHi = zptr[unHi];
+ n = blockBytes[zUnHi + d1] - med;
+ if (n < 0)
+ break;
+
+ if (n == 0)
+ {
+ zptr[unHi] = zptr[gtHi];
+ zptr[gtHi--] = zUnHi;
+ }
+ unHi--;
+ }
+ if (unLo > unHi)
+ break;
+
+ int temp = zptr[unLo];
+ zptr[unLo++] = zptr[unHi];
+ zptr[unHi--] = temp;
+ }
+
+ if (gtHi < ltLo)
+ {
+ d = d1;
+ continue;
+ }
+
+ n = System.Math.Min(ltLo - lo, unLo - ltLo);
+ Vswap(lo, unLo - n, n);
+
+ m = System.Math.Min(hi - gtHi, gtHi - unHi);
+ Vswap(unLo, hi - m + 1, m);
+
+ n = lo + (unLo - ltLo);
+ m = hi - (gtHi - unHi);
+
+ PushStackElem(stack, stackCount++, lo, n - 1, d);
+ PushStackElem(stack, stackCount++, n, m, d1);
+
+ lo = m + 1;
+ }
+ }
+
+ private void MainSort()
+ {
+ int i, j, ss, sb;
+ int[] runningOrder = new int[256];
+ int[] copy = new int[256];
+ bool[] bigDone = new bool[256];
+ int c1, c2;
+
+ /*
+ In the various block-sized structures, live data runs
+ from 0 to last+NUM_OVERSHOOT_BYTES inclusive. First,
+ set up the overshoot area for block.
+ */
+ for (i = 0; i < BZip2Constants.NUM_OVERSHOOT_BYTES; i++)
+ {
+ blockBytes[count + i + 1] = blockBytes[(i % count) + 1];
+ }
+ for (i = 0; i <= count + BZip2Constants.NUM_OVERSHOOT_BYTES; i++)
+ {
+ quadrantShorts[i] = 0;
+ }
+
+ blockBytes[0] = blockBytes[count];
+
+ if (count <= 4000)
+ {
+ /*
+ Use SimpleSort(), since the full sorting mechanism
+ has quite a large constant overhead.
+ */
+ for (i = 0; i < count; i++)
+ {
+ zptr[i] = i;
+ }
+ firstAttempt = false;
+ workDone = workLimit = 0;
+ SimpleSort(0, count - 1, 0);
+ }
+ else
+ {
+ for (i = 0; i <= 255; i++)
+ {
+ bigDone[i] = false;
+ }
+
+ for (i = 0; i <= 65536; i++)
+ {
+ ftab[i] = 0;
+ }
+
+ c1 = blockBytes[0];
+ for (i = 1; i <= count; i++)
+ {
+ c2 = blockBytes[i];
+ ftab[(c1 << 8) + c2]++;
+ c1 = c2;
+ }
+
+ for (i = 0; i < 65536; i++)
+ {
+ ftab[i + 1] += ftab[i];
+ }
+
+ c1 = blockBytes[1];
+ for (i = 0; i < (count - 1); i++)
+ {
+ c2 = blockBytes[i + 2];
+ j = (c1 << 8) + c2;
+ c1 = c2;
+ ftab[j]--;
+ zptr[ftab[j]] = i;
+ }
+
+ j = ((int)blockBytes[count] << 8) + blockBytes[1];
+ ftab[j]--;
+ zptr[ftab[j]] = count - 1;
+
+ /*
+ Now ftab contains the first loc of every small bucket.
+ Calculate the running order, from smallest to largest
+ big bucket.
+ */
+
+ for (i = 0; i <= 255; i++)
+ {
+ runningOrder[i] = i;
+ }
+
+ {
+ int h = 1;
+ do
+ {
+ h = 3 * h + 1;
+ }
+ while (h <= 256);
+ do
+ {
+ h = h / 3;
+ for (i = h; i <= 255; i++)
+ {
+ int vv = runningOrder[i];
+ j = i;
+ while ((ftab[(runningOrder[j - h] + 1) << 8] - ftab[runningOrder[j - h] << 8])
+ > (ftab[(vv + 1) << 8] - ftab[vv << 8]))
+ {
+ runningOrder[j] = runningOrder[j - h];
+ j = j - h;
+ if (j < h)
+ break;
+ }
+ runningOrder[j] = vv;
+ }
+ }
+ while (h != 1);
+ }
+
+ /*
+ The main sorting loop.
+ */
+ for (i = 0; i <= 255; i++)
+ {
+ /*
+ Process big buckets, starting with the least full.
+ */
+ ss = runningOrder[i];
+
+ /*
+ Complete the big bucket [ss] by quicksorting
+ any unsorted small buckets [ss, j]. Hopefully
+ previous pointer-scanning phases have already
+ completed many of the small buckets [ss, j], so
+ we don't have to sort them at all.
+ */
+ for (j = 0; j <= 255; j++)
+ {
+ sb = (ss << 8) + j;
+ if ((ftab[sb] & SETMASK) != SETMASK)
+ {
+ int lo = ftab[sb] & CLEARMASK;
+ int hi = (ftab[sb + 1] & CLEARMASK) - 1;
+ if (hi > lo)
+ {
+ QSort3(lo, hi, 2);
+ if (workDone > workLimit && firstAttempt)
+ return;
+ }
+ ftab[sb] |= SETMASK;
+ }
+ }
+
+ /*
+ The ss big bucket is now done. Record this fact,
+ and update the quadrant descriptors. Remember to
+ update quadrants in the overshoot area too, if
+ necessary. The "if (i < 255)" test merely skips
+ this updating for the last bucket processed, since
+ updating for the last bucket is pointless.
+ */
+ bigDone[ss] = true;
+
+ if (i < 255)
+ {
+ int bbStart = ftab[ss << 8] & CLEARMASK;
+ int bbSize = (ftab[(ss + 1) << 8] & CLEARMASK) - bbStart;
+
+ int shifts = 0;
+ while ((bbSize >> shifts) > 65534)
+ {
+ shifts++;
+ }
+
+ for (j = 0; j < bbSize; j++)
+ {
+ int a2update = zptr[bbStart + j] + 1;
+ ushort qVal = (ushort)(j >> shifts);
+ quadrantShorts[a2update] = qVal;
+ if (a2update <= BZip2Constants.NUM_OVERSHOOT_BYTES)
+ {
+ quadrantShorts[a2update + count] = qVal;
+ }
+ }
+
+ if (!(((bbSize - 1) >> shifts) <= 65535))
+ throw new InvalidOperationException();
+ }
+
+ /*
+ Now scan this big bucket so as to synthesise the
+ sorted order for small buckets [t, ss] for all t != ss.
+ */
+ for (j = 0; j <= 255; j++)
+ {
+ copy[j] = ftab[(j << 8) + ss] & CLEARMASK;
+ }
+
+ for (j = ftab[ss << 8] & CLEARMASK;
+ j < (ftab[(ss + 1) << 8] & CLEARMASK); j++)
+ {
+ int zptr_j = zptr[j];
+ c1 = blockBytes[zptr_j];
+ if (!bigDone[c1])
+ {
+ zptr[copy[c1]] = (zptr_j == 0 ? count : zptr_j) - 1;
+ copy[c1]++;
+ }
+ }
+
+ for (j = 0; j <= 255; j++)
+ {
+ ftab[(j << 8) + ss] |= SETMASK;
+ }
+ }
+ }
+ }
+
+ private void RandomiseBlock()
+ {
+ for (int i = 0; i < 256; i++)
+ {
+ inUse[i] = false;
+ }
+
+ int rNToGo = 0, rTPos = 0;
+
+ for (int i = 1; i <= count; i++)
+ {
+ if (rNToGo == 0)
+ {
+ rNToGo = RNums[rTPos++];
+ rTPos &= 0x1FF;
+ }
+ rNToGo--;
+ blockBytes[i] ^= (byte)(rNToGo == 1 ? 1 : 0);
+
+ inUse[blockBytes[i]] = true;
+ }
+ }
+
+ private void DoReversibleTransformation()
+ {
+ workLimit = workFactor * (count - 1);
+ workDone = 0;
+ blockRandomised = false;
+ firstAttempt = true;
+
+ MainSort();
+
+ if (workDone > workLimit && firstAttempt)
+ {
+ RandomiseBlock();
+ workLimit = workDone = 0;
+ blockRandomised = true;
+ firstAttempt = false;
+ MainSort();
+ }
+
+ origPtr = -1;
+ for (int i = 0; i < count; i++)
+ {
+ if (zptr[i] == 0)
+ {
+ origPtr = i;
+ break;
+ }
+ }
+
+ if (origPtr == -1)
+ throw new InvalidOperationException();
+ }
+
+ private bool FullGtU(int i1, int i2)
+ {
+ int c1, c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ int k = count;
+ int s1, s2;
+
+ do
+ {
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ s1 = quadrantShorts[i1];
+ s2 = quadrantShorts[i2];
+ if (s1 != s2)
+ return s1 > s2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ s1 = quadrantShorts[i1];
+ s2 = quadrantShorts[i2];
+ if (s1 != s2)
+ return s1 > s2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ s1 = quadrantShorts[i1];
+ s2 = quadrantShorts[i2];
+ if (s1 != s2)
+ return s1 > s2;
+
+ c1 = blockBytes[++i1];
+ c2 = blockBytes[++i2];
+ if (c1 != c2)
+ return c1 > c2;
+
+ s1 = quadrantShorts[i1];
+ s2 = quadrantShorts[i2];
+ if (s1 != s2)
+ return s1 > s2;
+
+ if (i1 >= count)
+ {
+ i1 -= count;
+ }
+ if (i2 >= count)
+ {
+ i2 -= count;
+ }
+
+ k -= 4;
+ workDone++;
+ }
+ while (k >= 0);
+
+ return false;
+ }
+
+ private void GenerateMtfValues()
+ {
+ int i;
+
+ nInUse = 0;
+
+ byte[] yy = new byte[256];
+ for (i = 0; i < 256; i++)
+ {
+ if (inUse[i])
+ {
+ yy[nInUse++] = (byte)i;
+ }
+ }
+
+ int EOB = nInUse + 1;
+
+ for (i = 0; i <= EOB; i++)
+ {
+ mtfFreq[i] = 0;
+ }
+
+ int wr = 0, zPend = 0;
+ for (i = 0; i < count; i++)
+ {
+ byte blockByte = blockBytes[zptr[i]];
+
+ byte tmp = yy[0];
+ if (blockByte == tmp)
+ {
+ zPend++;
+ continue;
+ }
+
+ int sym = 1;
+ do
+ {
+ byte tmp2 = tmp;
+ tmp = yy[sym];
+ yy[sym++] = tmp2;
+ }
+ while (blockByte != tmp);
+ yy[0] = tmp;
+
+ while (zPend > 0)
+ {
+ // RUNA or RUNB
+ int run = --zPend & 1;
+ szptr[wr++] = run;
+ mtfFreq[run]++;
+ zPend >>= 1;
+ }
+
+ szptr[wr++] = sym;
+ mtfFreq[sym]++;
+ }
+
+ while (zPend > 0)
+ {
+ // RUNA or RUNB
+ int run = --zPend & 1;
+ szptr[wr++] = run;
+ mtfFreq[run]++;
+ zPend >>= 1;
+ }
+
+ szptr[wr++] = EOB;
+ mtfFreq[EOB]++;
+
+ nMTF = wr;
+ }
+
+ internal static byte[][] CreateByteArray(int n1, int n2)
+ {
+ byte[][] a = new byte[n1][];
+ for (int k = 0; k < n1; ++k)
+ {
+ a[k] = new byte[n2];
+ }
+ return a;
+ }
+ }
+
+ public class CBZip2OutputStreamLeaveOpen
+ : CBZip2OutputStream
+ {
+ public CBZip2OutputStreamLeaveOpen(Stream outStream)
+ : base(outStream)
+ {
+ }
+
+ public CBZip2OutputStreamLeaveOpen(Stream outStream, int blockSize)
+ : base(outStream, blockSize)
+ {
+ }
+
+ protected override void Dispose(bool disposing)
+ {
+ Detach(disposing);
+ }
+ }
+}
diff --git a/crypto/src/util/bzip2/CRC.cs b/crypto/src/util/bzip2/CRC.cs
new file mode 100644
index 000000000..30c7e9c7d
--- /dev/null
+++ b/crypto/src/util/bzip2/CRC.cs
@@ -0,0 +1,158 @@
+/*
+ * 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 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;
+ }
+ }
+ }
+}
diff --git a/crypto/src/util/io/compression/Bzip2.cs b/crypto/src/util/io/compression/Bzip2.cs
new file mode 100644
index 000000000..72b006dc9
--- /dev/null
+++ b/crypto/src/util/io/compression/Bzip2.cs
@@ -0,0 +1,21 @@
+using System.IO;
+
+namespace Org.BouncyCastle.Utilities.IO.Compression
+{
+ using Impl = Utilities.Bzip2;
+
+ internal static class Bzip2
+ {
+ internal static Stream CompressOutput(Stream stream, bool leaveOpen = false)
+ {
+ return leaveOpen
+ ? new Impl.CBZip2OutputStreamLeaveOpen(stream)
+ : new Impl.CBZip2OutputStream(stream);
+ }
+
+ internal static Stream DecompressInput(Stream stream)
+ {
+ return new Impl.CBZip2InputStream(stream);
+ }
+ }
+}
diff --git a/crypto/src/util/io/compression/ZLib.cs b/crypto/src/util/io/compression/ZLib.cs
new file mode 100644
index 000000000..1254da012
--- /dev/null
+++ b/crypto/src/util/io/compression/ZLib.cs
@@ -0,0 +1,46 @@
+using System.IO;
+
+#if NET6_0_OR_GREATER
+using System.IO.Compression;
+#else
+using Org.BouncyCastle.Utilities.Zlib;
+#endif
+
+namespace Org.BouncyCastle.Utilities.IO.Compression
+{
+ internal static class ZLib
+ {
+ internal static Stream CompressOutput(Stream stream, int zlibCompressionLevel, bool leaveOpen = false)
+ {
+#if NET6_0_OR_GREATER
+ return new ZLibStream(stream, GetCompressionLevel(zlibCompressionLevel), leaveOpen);
+#else
+ return leaveOpen
+ ? new ZOutputStreamLeaveOpen(stream, zlibCompressionLevel, false)
+ : new ZOutputStream(stream, zlibCompressionLevel, false);
+#endif
+ }
+
+ internal static Stream DecompressInput(Stream stream)
+ {
+#if NET6_0_OR_GREATER
+ return new ZLibStream(stream, CompressionMode.Decompress, leaveOpen: false);
+#else
+ return new ZInputStream(stream);
+#endif
+ }
+
+#if NET6_0_OR_GREATER
+ internal static CompressionLevel GetCompressionLevel(int zlibCompressionLevel)
+ {
+ return zlibCompressionLevel switch
+ {
+ 0 => CompressionLevel.NoCompression,
+ 1 or 2 or 3 => CompressionLevel.Fastest,
+ 7 or 8 or 9 => CompressionLevel.SmallestSize,
+ _ => CompressionLevel.Optimal,
+ };
+ }
+#endif
+ }
+}
diff --git a/crypto/src/util/io/compression/Zip.cs b/crypto/src/util/io/compression/Zip.cs
new file mode 100644
index 000000000..f2773d63b
--- /dev/null
+++ b/crypto/src/util/io/compression/Zip.cs
@@ -0,0 +1,33 @@
+using System.IO;
+
+#if NET6_0_OR_GREATER
+using System.IO.Compression;
+#else
+using Org.BouncyCastle.Utilities.Zlib;
+#endif
+
+namespace Org.BouncyCastle.Utilities.IO.Compression
+{
+ internal static class Zip
+ {
+ internal static Stream CompressOutput(Stream stream, int zlibCompressionLevel, bool leaveOpen = false)
+ {
+#if NET6_0_OR_GREATER
+ return new DeflateStream(stream, ZLib.GetCompressionLevel(zlibCompressionLevel), leaveOpen);
+#else
+ return leaveOpen
+ ? new ZOutputStreamLeaveOpen(stream, zlibCompressionLevel, true)
+ : new ZOutputStream(stream, zlibCompressionLevel, true);
+#endif
+ }
+
+ internal static Stream DecompressInput(Stream stream)
+ {
+#if NET6_0_OR_GREATER
+ return new DeflateStream(stream, CompressionMode.Decompress, leaveOpen: false);
+#else
+ return new ZInputStream(stream, true);
+#endif
+ }
+ }
+}
diff --git a/crypto/src/util/zlib/ZOutputStream.cs b/crypto/src/util/zlib/ZOutputStream.cs
index 301516e57..51a5050dd 100644
--- a/crypto/src/util/zlib/ZOutputStream.cs
+++ b/crypto/src/util/zlib/ZOutputStream.cs
@@ -264,4 +264,38 @@ namespace Org.BouncyCastle.Utilities.Zlib
Write(buf1, 0, 1);
}
}
+
+ public class ZOutputStreamLeaveOpen
+ : ZOutputStream
+ {
+ public ZOutputStreamLeaveOpen(Stream output)
+ : base(output)
+ {
+ }
+
+ public ZOutputStreamLeaveOpen(Stream output, bool nowrap)
+ : base(output, nowrap)
+ {
+ }
+
+ public ZOutputStreamLeaveOpen(Stream output, ZStream z)
+ : base(output, z)
+ {
+ }
+
+ public ZOutputStreamLeaveOpen(Stream output, int level)
+ : base(output, level)
+ {
+ }
+
+ public ZOutputStreamLeaveOpen(Stream output, int level, bool nowrap)
+ : base(output, level, nowrap)
+ {
+ }
+
+ protected override void Dispose(bool disposing)
+ {
+ Detach(disposing);
+ }
+ }
}
|
