using System;

namespace Org.BouncyCastle.Utilities.Zlib;

internal sealed class InfTree
{
	private const int MANY = 1440;

	private const int Z_OK = 0;

	private const int Z_STREAM_END = 1;

	private const int Z_NEED_DICT = 2;

	private const int Z_ERRNO = -1;

	private const int Z_STREAM_ERROR = -2;

	private const int Z_DATA_ERROR = -3;

	private const int Z_MEM_ERROR = -4;

	private const int Z_BUF_ERROR = -5;

	private const int Z_VERSION_ERROR = -6;

	private const int fixed_bl = 9;

	private const int fixed_bd = 5;

	private const int BMAX = 15;

	private static readonly int[] fixed_tl = new int[1536]
	{
		96, 7, 256, 0, 8, 80, 0, 8, 16, 84,
		8, 115, 82, 7, 31, 0, 8, 112, 0, 8,
		48, 0, 9, 192, 80, 7, 10, 0, 8, 96,
		0, 8, 32, 0, 9, 160, 0, 8, 0, 0,
		8, 128, 0, 8, 64, 0, 9, 224, 80, 7,
		6, 0, 8, 88, 0, 8, 24, 0, 9, 144,
		83, 7, 59, 0, 8, 120, 0, 8, 56, 0,
		9, 208, 81, 7, 17, 0, 8, 104, 0, 8,
		40, 0, 9, 176, 0, 8, 8, 0, 8, 136,
		0, 8, 72, 0, 9, 240, 80, 7, 4, 0,
		8, 84, 0, 8, 20, 85, 8, 227, 83, 7,
		43, 0, 8, 116, 0, 8, 52, 0, 9, 200,
		81, 7, 13, 0, 8, 100, 0, 8, 36, 0,
		9, 168, 0, 8, 4, 0, 8, 132, 0, 8,
		68, 0, 9, 232, 80, 7, 8, 0, 8, 92,
		0, 8, 28, 0, 9, 152, 84, 7, 83, 0,
		8, 124, 0, 8, 60, 0, 9, 216, 82, 7,
		23, 0, 8, 108, 0, 8, 44, 0, 9, 184,
		0, 8, 12, 0, 8, 140, 0, 8, 76, 0,
		9, 248, 80, 7, 3, 0, 8, 82, 0, 8,
		18, 85, 8, 163, 83, 7, 35, 0, 8, 114,
		0, 8, 50, 0, 9, 196, 81, 7, 11, 0,
		8, 98, 0, 8, 34, 0, 9, 164, 0, 8,
		2, 0, 8, 130, 0, 8, 66, 0, 9, 228,
		80, 7, 7, 0, 8, 90, 0, 8, 26, 0,
		9, 148, 84, 7, 67, 0, 8, 122, 0, 8,
		58, 0, 9, 212, 82, 7, 19, 0, 8, 106,
		0, 8, 42, 0, 9, 180, 0, 8, 10, 0,
		8, 138, 0, 8, 74, 0, 9, 244, 80, 7,
		5, 0, 8, 86, 0, 8, 22, 192, 8, 0,
		83, 7, 51, 0, 8, 118, 0, 8, 54, 0,
		9, 204, 81, 7, 15, 0, 8, 102, 0, 8,
		38, 0, 9, 172, 0, 8, 6, 0, 8, 134,
		0, 8, 70, 0, 9, 236, 80, 7, 9, 0,
		8, 94, 0, 8, 30, 0, 9, 156, 84, 7,
		99, 0, 8, 126, 0, 8, 62, 0, 9, 220,
		82, 7, 27, 0, 8, 110, 0, 8, 46, 0,
		9, 188, 0, 8, 14, 0, 8, 142, 0, 8,
		78, 0, 9, 252, 96, 7, 256, 0, 8, 81,
		0, 8, 17, 85, 8, 131, 82, 7, 31, 0,
		8, 113, 0, 8, 49, 0, 9, 194, 80, 7,
		10, 0, 8, 97, 0, 8, 33, 0, 9, 162,
		0, 8, 1, 0, 8, 129, 0, 8, 65, 0,
		9, 226, 80, 7, 6, 0, 8, 89, 0, 8,
		25, 0, 9, 146, 83, 7, 59, 0, 8, 121,
		0, 8, 57, 0, 9, 210, 81, 7, 17, 0,
		8, 105, 0, 8, 41, 0, 9, 178, 0, 8,
		9, 0, 8, 137, 0, 8, 73, 0, 9, 242,
		80, 7, 4, 0, 8, 85, 0, 8, 21, 80,
		8, 258, 83, 7, 43, 0, 8, 117, 0, 8,
		53, 0, 9, 202, 81, 7, 13, 0, 8, 101,
		0, 8, 37, 0, 9, 170, 0, 8, 5, 0,
		8, 133, 0, 8, 69, 0, 9, 234, 80, 7,
		8, 0, 8, 93, 0, 8, 29, 0, 9, 154,
		84, 7, 83, 0, 8, 125, 0, 8, 61, 0,
		9, 218, 82, 7, 23, 0, 8, 109, 0, 8,
		45, 0, 9, 186, 0, 8, 13, 0, 8, 141,
		0, 8, 77, 0, 9, 250, 80, 7, 3, 0,
		8, 83, 0, 8, 19, 85, 8, 195, 83, 7,
		35, 0, 8, 115, 0, 8, 51, 0, 9, 198,
		81, 7, 11, 0, 8, 99, 0, 8, 35, 0,
		9, 166, 0, 8, 3, 0, 8, 131, 0, 8,
		67, 0, 9, 230, 80, 7, 7, 0, 8, 91,
		0, 8, 27, 0, 9, 150, 84, 7, 67, 0,
		8, 123, 0, 8, 59, 0, 9, 214, 82, 7,
		19, 0, 8, 107, 0, 8, 43, 0, 9, 182,
		0, 8, 11, 0, 8, 139, 0, 8, 75, 0,
		9, 246, 80, 7, 5, 0, 8, 87, 0, 8,
		23, 192, 8, 0, 83, 7, 51, 0, 8, 119,
		0, 8, 55, 0, 9, 206, 81, 7, 15, 0,
		8, 103, 0, 8, 39, 0, 9, 174, 0, 8,
		7, 0, 8, 135, 0, 8, 71, 0, 9, 238,
		80, 7, 9, 0, 8, 95, 0, 8, 31, 0,
		9, 158, 84, 7, 99, 0, 8, 127, 0, 8,
		63, 0, 9, 222, 82, 7, 27, 0, 8, 111,
		0, 8, 47, 0, 9, 190, 0, 8, 15, 0,
		8, 143, 0, 8, 79, 0, 9, 254, 96, 7,
		256, 0, 8, 80, 0, 8, 16, 84, 8, 115,
		82, 7, 31, 0, 8, 112, 0, 8, 48, 0,
		9, 193, 80, 7, 10, 0, 8, 96, 0, 8,
		32, 0, 9, 161, 0, 8, 0, 0, 8, 128,
		0, 8, 64, 0, 9, 225, 80, 7, 6, 0,
		8, 88, 0, 8, 24, 0, 9, 145, 83, 7,
		59, 0, 8, 120, 0, 8, 56, 0, 9, 209,
		81, 7, 17, 0, 8, 104, 0, 8, 40, 0,
		9, 177, 0, 8, 8, 0, 8, 136, 0, 8,
		72, 0, 9, 241, 80, 7, 4, 0, 8, 84,
		0, 8, 20, 85, 8, 227, 83, 7, 43, 0,
		8, 116, 0, 8, 52, 0, 9, 201, 81, 7,
		13, 0, 8, 100, 0, 8, 36, 0, 9, 169,
		0, 8, 4, 0, 8, 132, 0, 8, 68, 0,
		9, 233, 80, 7, 8, 0, 8, 92, 0, 8,
		28, 0, 9, 153, 84, 7, 83, 0, 8, 124,
		0, 8, 60, 0, 9, 217, 82, 7, 23, 0,
		8, 108, 0, 8, 44, 0, 9, 185, 0, 8,
		12, 0, 8, 140, 0, 8, 76, 0, 9, 249,
		80, 7, 3, 0, 8, 82, 0, 8, 18, 85,
		8, 163, 83, 7, 35, 0, 8, 114, 0, 8,
		50, 0, 9, 197, 81, 7, 11, 0, 8, 98,
		0, 8, 34, 0, 9, 165, 0, 8, 2, 0,
		8, 130, 0, 8, 66, 0, 9, 229, 80, 7,
		7, 0, 8, 90, 0, 8, 26, 0, 9, 149,
		84, 7, 67, 0, 8, 122, 0, 8, 58, 0,
		9, 213, 82, 7, 19, 0, 8, 106, 0, 8,
		42, 0, 9, 181, 0, 8, 10, 0, 8, 138,
		0, 8, 74, 0, 9, 245, 80, 7, 5, 0,
		8, 86, 0, 8, 22, 192, 8, 0, 83, 7,
		51, 0, 8, 118, 0, 8, 54, 0, 9, 205,
		81, 7, 15, 0, 8, 102, 0, 8, 38, 0,
		9, 173, 0, 8, 6, 0, 8, 134, 0, 8,
		70, 0, 9, 237, 80, 7, 9, 0, 8, 94,
		0, 8, 30, 0, 9, 157, 84, 7, 99, 0,
		8, 126, 0, 8, 62, 0, 9, 221, 82, 7,
		27, 0, 8, 110, 0, 8, 46, 0, 9, 189,
		0, 8, 14, 0, 8, 142, 0, 8, 78, 0,
		9, 253, 96, 7, 256, 0, 8, 81, 0, 8,
		17, 85, 8, 131, 82, 7, 31, 0, 8, 113,
		0, 8, 49, 0, 9, 195, 80, 7, 10, 0,
		8, 97, 0, 8, 33, 0, 9, 163, 0, 8,
		1, 0, 8, 129, 0, 8, 65, 0, 9, 227,
		80, 7, 6, 0, 8, 89, 0, 8, 25, 0,
		9, 147, 83, 7, 59, 0, 8, 121, 0, 8,
		57, 0, 9, 211, 81, 7, 17, 0, 8, 105,
		0, 8, 41, 0, 9, 179, 0, 8, 9, 0,
		8, 137, 0, 8, 73, 0, 9, 243, 80, 7,
		4, 0, 8, 85, 0, 8, 21, 80, 8, 258,
		83, 7, 43, 0, 8, 117, 0, 8, 53, 0,
		9, 203, 81, 7, 13, 0, 8, 101, 0, 8,
		37, 0, 9, 171, 0, 8, 5, 0, 8, 133,
		0, 8, 69, 0, 9, 235, 80, 7, 8, 0,
		8, 93, 0, 8, 29, 0, 9, 155, 84, 7,
		83, 0, 8, 125, 0, 8, 61, 0, 9, 219,
		82, 7, 23, 0, 8, 109, 0, 8, 45, 0,
		9, 187, 0, 8, 13, 0, 8, 141, 0, 8,
		77, 0, 9, 251, 80, 7, 3, 0, 8, 83,
		0, 8, 19, 85, 8, 195, 83, 7, 35, 0,
		8, 115, 0, 8, 51, 0, 9, 199, 81, 7,
		11, 0, 8, 99, 0, 8, 35, 0, 9, 167,
		0, 8, 3, 0, 8, 131, 0, 8, 67, 0,
		9, 231, 80, 7, 7, 0, 8, 91, 0, 8,
		27, 0, 9, 151, 84, 7, 67, 0, 8, 123,
		0, 8, 59, 0, 9, 215, 82, 7, 19, 0,
		8, 107, 0, 8, 43, 0, 9, 183, 0, 8,
		11, 0, 8, 139, 0, 8, 75, 0, 9, 247,
		80, 7, 5, 0, 8, 87, 0, 8, 23, 192,
		8, 0, 83, 7, 51, 0, 8, 119, 0, 8,
		55, 0, 9, 207, 81, 7, 15, 0, 8, 103,
		0, 8, 39, 0, 9, 175, 0, 8, 7, 0,
		8, 135, 0, 8, 71, 0, 9, 239, 80, 7,
		9, 0, 8, 95, 0, 8, 31, 0, 9, 159,
		84, 7, 99, 0, 8, 127, 0, 8, 63, 0,
		9, 223, 82, 7, 27, 0, 8, 111, 0, 8,
		47, 0, 9, 191, 0, 8, 15, 0, 8, 143,
		0, 8, 79, 0, 9, 255
	};

	private static readonly int[] fixed_td = new int[96]
	{
		80, 5, 1, 87, 5, 257, 83, 5, 17, 91,
		5, 4097, 81, 5, 5, 89, 5, 1025, 85, 5,
		65, 93, 5, 16385, 80, 5, 3, 88, 5, 513,
		84, 5, 33, 92, 5, 8193, 82, 5, 9, 90,
		5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5,
		2, 87, 5, 385, 83, 5, 25, 91, 5, 6145,
		81, 5, 7, 89, 5, 1537, 85, 5, 97, 93,
		5, 24577, 80, 5, 4, 88, 5, 769, 84, 5,
		49, 92, 5, 12289, 82, 5, 13, 90, 5, 3073,
		86, 5, 193, 192, 5, 24577
	};

	private static readonly int[] cplens = new int[31]
	{
		3, 4, 5, 6, 7, 8, 9, 10, 11, 13,
		15, 17, 19, 23, 27, 31, 35, 43, 51, 59,
		67, 83, 99, 115, 131, 163, 195, 227, 258, 0,
		0
	};

	private static readonly int[] cplext = new int[31]
	{
		0, 0, 0, 0, 0, 0, 0, 0, 1, 1,
		1, 1, 2, 2, 2, 2, 3, 3, 3, 3,
		4, 4, 4, 4, 5, 5, 5, 5, 0, 112,
		112
	};

	private static readonly int[] cpdist = new int[30]
	{
		1, 2, 3, 4, 5, 7, 9, 13, 17, 25,
		33, 49, 65, 97, 129, 193, 257, 385, 513, 769,
		1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577
	};

	private static readonly int[] cpdext = new int[30]
	{
		0, 0, 0, 0, 1, 1, 2, 2, 3, 3,
		4, 4, 5, 5, 6, 6, 7, 7, 8, 8,
		9, 9, 10, 10, 11, 11, 12, 12, 13, 13
	};

	private int[] hn = null;

	private int[] v = null;

	private int[] c = null;

	private int[] r = null;

	private int[] u = null;

	private int[] x = null;

	private int huft_build(int[] b, int bindex, int n, int s, int[] d, int[] e, int[] t, int[] m, int[] hp, int[] hn, int[] v)
	{
		int num = 0;
		int num2 = n;
		nint num4;
		int[] array2;
		do
		{
			int[] array = (array2 = c);
			int num3 = b[bindex + num];
			num4 = num3;
			array[num3] = array2[num4] + 1;
			num++;
			num2--;
		}
		while (num2 != 0);
		if (c[0] == n)
		{
			t[0] = -1;
			m[0] = 0;
			return 0;
		}
		int num5 = m[0];
		int i;
		for (i = 1; i <= 15 && c[i] == 0; i++)
		{
		}
		int j = i;
		if (num5 < i)
		{
			num5 = i;
		}
		num2 = 15;
		while (num2 != 0 && c[num2] == 0)
		{
			num2--;
		}
		int num6 = num2;
		if (num5 > num2)
		{
			num5 = num2;
		}
		m[0] = num5;
		int num7 = 1 << i;
		while (i < num2)
		{
			if ((num7 -= c[i]) < 0)
			{
				return -3;
			}
			i++;
			num7 <<= 1;
		}
		if ((num7 -= c[num2]) < 0)
		{
			return -3;
		}
		int[] array3 = (array2 = c);
		int num8 = num2;
		num4 = num8;
		array3[num8] = array2[num4] + num7;
		i = (x[1] = 0);
		num = 1;
		int num9 = 2;
		while (--num2 != 0)
		{
			i = (x[num9] = i + c[num]);
			num9++;
			num++;
		}
		num2 = 0;
		num = 0;
		do
		{
			if ((i = b[bindex + num]) != 0)
			{
				int[] array4 = (array2 = x);
				int num10 = i;
				num4 = num10;
				int num11;
				array4[num10] = (num11 = array2[num4]) + 1;
				v[num11] = num2;
			}
			num++;
		}
		while (++num2 < n);
		n = x[num6];
		num2 = (x[0] = 0);
		num = 0;
		int num12 = -1;
		int num13 = -num5;
		u[0] = 0;
		int num14 = 0;
		int num15 = 0;
		for (; j <= num6; j++)
		{
			int num16 = c[j];
			while (num16-- != 0)
			{
				int num17;
				while (j > num13 + num5)
				{
					num12++;
					num13 += num5;
					num15 = num6 - num13;
					num15 = ((num15 > num5) ? num5 : num15);
					if ((num17 = 1 << (i = j - num13)) > num16 + 1)
					{
						num17 -= num16 + 1;
						num9 = j;
						if (i < num15)
						{
							while (++i < num15 && (num17 <<= 1) > c[++num9])
							{
								num17 -= c[num9];
							}
						}
					}
					num15 = 1 << i;
					if (hn[0] + num15 > 1440)
					{
						return -3;
					}
					num14 = (u[num12] = hn[0]);
					(array2 = hn)[0] = array2[0] + num15;
					if (num12 != 0)
					{
						x[num12] = num2;
						r[0] = (byte)i;
						r[1] = (byte)num5;
						i = num2 >> num13 - num5;
						r[2] = num14 - u[num12 - 1] - i;
						Array.Copy(r, 0, hp, (u[num12 - 1] + i) * 3, 3);
					}
					else
					{
						t[0] = num14;
					}
				}
				r[1] = (byte)(j - num13);
				if (num >= n)
				{
					r[0] = 192;
				}
				else if (v[num] < s)
				{
					r[0] = (byte)((v[num] >= 256) ? 96 : 0);
					r[2] = v[num++];
				}
				else
				{
					r[0] = (byte)(e[v[num] - s] + 16 + 64);
					r[2] = d[v[num++] - s];
				}
				num17 = 1 << j - num13;
				for (i = num2 >> num13; i < num15; i += num17)
				{
					Array.Copy(r, 0, hp, (num14 + i) * 3, 3);
				}
				i = 1 << j - 1;
				while ((num2 & i) != 0)
				{
					num2 ^= i;
					i >>= 1;
				}
				num2 ^= i;
				int num18 = (1 << num13) - 1;
				while ((num2 & num18) != x[num12])
				{
					num12--;
					num13 -= num5;
					num18 = (1 << num13) - 1;
				}
			}
		}
		if (num7 == 0 || num6 == 1)
		{
			return 0;
		}
		return -5;
	}

	internal int inflate_trees_bits(int[] c, int[] bb, int[] tb, int[] hp, ZStream z)
	{
		initWorkArea(19);
		hn[0] = 0;
		int num = huft_build(c, 0, 19, 19, null, null, tb, bb, hp, hn, v);
		if (num == -3)
		{
			z.msg = "oversubscribed dynamic bit lengths tree";
		}
		else if (num == -5 || bb[0] == 0)
		{
			z.msg = "incomplete dynamic bit lengths tree";
			num = -3;
		}
		return num;
	}

	internal int inflate_trees_dynamic(int nl, int nd, int[] c, int[] bl, int[] bd, int[] tl, int[] td, int[] hp, ZStream z)
	{
		initWorkArea(288);
		hn[0] = 0;
		int num = huft_build(c, 0, nl, 257, cplens, cplext, tl, bl, hp, hn, v);
		if (num != 0 || bl[0] == 0)
		{
			switch (num)
			{
			case -3:
				z.msg = "oversubscribed literal/length tree";
				break;
			default:
				z.msg = "incomplete literal/length tree";
				num = -3;
				break;
			case -4:
				break;
			}
			return num;
		}
		initWorkArea(288);
		num = huft_build(c, nl, nd, 0, cpdist, cpdext, td, bd, hp, hn, v);
		if (num != 0 || (bd[0] == 0 && nl > 257))
		{
			switch (num)
			{
			case -3:
				z.msg = "oversubscribed distance tree";
				break;
			case -5:
				z.msg = "incomplete distance tree";
				num = -3;
				break;
			default:
				z.msg = "empty distance tree with lengths";
				num = -3;
				break;
			case -4:
				break;
			}
			return num;
		}
		return 0;
	}

	internal static int inflate_trees_fixed(int[] bl, int[] bd, int[][] tl, int[][] td, ZStream z)
	{
		bl[0] = 9;
		bd[0] = 5;
		tl[0] = fixed_tl;
		td[0] = fixed_td;
		return 0;
	}

	private void initWorkArea(int vsize)
	{
		if (hn == null)
		{
			hn = new int[1];
			v = new int[vsize];
			c = new int[16];
			r = new int[3];
			u = new int[15];
			x = new int[16];
		}
		if (v.Length < vsize)
		{
			v = new int[vsize];
		}
		for (int i = 0; i < vsize; i++)
		{
			v[i] = 0;
		}
		for (int j = 0; j < 16; j++)
		{
			c[j] = 0;
		}
		for (int k = 0; k < 3; k++)
		{
			r[k] = 0;
		}
		Array.Copy(c, 0, u, 0, 15);
		Array.Copy(c, 0, x, 0, 16);
	}
}