internal int Process(InflateBlocks blocks, int r)
{
int num = 0;
int num2 = 0;
int num3 = 0;
ZlibCodec codec = blocks._codec;
num3 = codec.NextIn;
int num4 = codec.AvailableBytesIn;
num = blocks.bitb;
num2 = blocks.bitk;
int num5 = blocks.writeAt;
int num6 = (num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1);
while (true)
{
switch (mode)
{
case 0:
if (num6 >= 258 && num4 >= 10)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
r = InflateFast(lbits, dbits, ltree, ltree_index, dtree, dtree_index, blocks, codec);
num3 = codec.NextIn;
num4 = codec.AvailableBytesIn;
num = blocks.bitb;
num2 = blocks.bitk;
num5 = blocks.writeAt;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
if (r != 0)
{
mode = ((r != 1) ? 9 : 7);
break;
}
}
need = lbits;
tree = ltree;
tree_index = ltree_index;
mode = 1;
goto case 1;
case 1:
{
int num8;
for (num8 = need; num2 < num8; num2 += 8)
{
if (num4 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
r = 0;
num4--;
num |= (codec.InputBuffer[num3++] & 0xFF) << num2;
}
int num11 = (tree_index + (num & InternalInflateConstants.InflateMask[num8])) * 3;
num >>= tree[num11 + 1];
num2 -= tree[num11 + 1];
int num12 = tree[num11];
if (num12 == 0)
{
lit = tree[num11 + 2];
mode = 6;
}
else if ((num12 & 0x10) != 0)
{
bitsToGet = (num12 & 0xF);
len = tree[num11 + 2];
mode = 2;
}
else if ((num12 & 0x40) == 0)
{
need = num12;
tree_index = num11 / 3 + tree[num11 + 2];
}
else
{
if ((num12 & 0x20) == 0)
{
mode = 9;
codec.Message = "invalid literal/length code";
r = -3;
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
mode = 7;
}
break;
}
case 2:
{
int num8;
for (num8 = bitsToGet; num2 < num8; num2 += 8)
{
if (num4 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
r = 0;
num4--;
num |= (codec.InputBuffer[num3++] & 0xFF) << num2;
}
len += (num & InternalInflateConstants.InflateMask[num8]);
num >>= num8;
num2 -= num8;
need = dbits;
tree = dtree;
tree_index = dtree_index;
mode = 3;
goto case 3;
}
case 3:
{
int num8;
for (num8 = need; num2 < num8; num2 += 8)
{
if (num4 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
r = 0;
num4--;
num |= (codec.InputBuffer[num3++] & 0xFF) << num2;
}
int num11 = (tree_index + (num & InternalInflateConstants.InflateMask[num8])) * 3;
num >>= tree[num11 + 1];
num2 -= tree[num11 + 1];
int num12 = tree[num11];
if ((num12 & 0x10) != 0)
{
bitsToGet = (num12 & 0xF);
dist = tree[num11 + 2];
mode = 4;
}
else
{
if ((num12 & 0x40) != 0)
{
mode = 9;
codec.Message = "invalid distance code";
r = -3;
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
need = num12;
tree_index = num11 / 3 + tree[num11 + 2];
}
break;
}
case 4:
{
int num8;
for (num8 = bitsToGet; num2 < num8; num2 += 8)
{
if (num4 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
r = 0;
num4--;
num |= (codec.InputBuffer[num3++] & 0xFF) << num2;
}
dist += (num & InternalInflateConstants.InflateMask[num8]);
num >>= num8;
num2 -= num8;
mode = 5;
goto case 5;
}
case 5:
{
int i;
for (i = num5 - dist; i < 0; i += blocks.end)
{
}
while (len != 0)
{
if (num6 == 0)
{
if (num5 == blocks.end && blocks.readAt != 0)
{
num5 = 0;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
}
if (num6 == 0)
{
blocks.writeAt = num5;
r = blocks.Flush(r);
num5 = blocks.writeAt;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
if (num5 == blocks.end && blocks.readAt != 0)
{
num5 = 0;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
}
if (num6 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
}
}
blocks.window[num5++] = blocks.window[i++];
num6--;
if (i == blocks.end)
{
i = 0;
}
len--;
}
mode = 0;
break;
}
case 6:
if (num6 == 0)
{
if (num5 == blocks.end && blocks.readAt != 0)
{
num5 = 0;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
}
if (num6 == 0)
{
blocks.writeAt = num5;
r = blocks.Flush(r);
num5 = blocks.writeAt;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
if (num5 == blocks.end && blocks.readAt != 0)
{
num5 = 0;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
}
if (num6 == 0)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
}
}
r = 0;
blocks.window[num5++] = (byte)lit;
num6--;
mode = 0;
break;
case 7:
if (num2 > 7)
{
num2 -= 8;
num4++;
num3--;
}
blocks.writeAt = num5;
r = blocks.Flush(r);
num5 = blocks.writeAt;
num6 = ((num5 >= blocks.readAt) ? (blocks.end - num5) : (blocks.readAt - num5 - 1));
if (blocks.readAt != blocks.writeAt)
{
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
mode = 8;
goto case 8;
case 8:
r = 1;
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
case 9:
r = -3;
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
default:
r = -2;
blocks.bitb = num;
blocks.bitk = num2;
codec.AvailableBytesIn = num4;
codec.TotalBytesIn += num3 - codec.NextIn;
codec.NextIn = num3;
blocks.writeAt = num5;
return(blocks.Flush(r));
}
}
}
internal int InflateFast(int bl, int bd, int[] tl, int tl_index, int[] td, int td_index, InflateBlocks s, ZlibCodec z)
{
int num = z.NextIn;
int num2 = z.AvailableBytesIn;
int num3 = s.bitb;
int num4 = s.bitk;
int num5 = s.writeAt;
int num6 = (num5 >= s.readAt) ? (s.end - num5) : (s.readAt - num5 - 1);
int num7 = InternalInflateConstants.InflateMask[bl];
int num8 = InternalInflateConstants.InflateMask[bd];
int num13;
while (true)
{
if (num4 < 20)
{
num2--;
num3 |= (z.InputBuffer[num++] & 0xFF) << (num4 & 0x1F);
num4 += 8;
}
else
{
int num10 = num3 & num7;
int num11 = (tl_index + num10) * 3;
int num12;
if ((num12 = tl[num11]) != 0)
{
while (true)
{
num3 >>= tl[num11 + 1];
num4 -= tl[num11 + 1];
if ((num12 & 0x10) != 0)
{
num12 &= 0xF;
num13 = tl[num11 + 2] + (num3 & InternalInflateConstants.InflateMask[num12]);
num3 >>= num12;
for (num4 -= num12; num4 < 15; num4 += 8)
{
num2--;
num3 |= (z.InputBuffer[num++] & 0xFF) << num4;
}
num10 = (num3 & num8);
num11 = (td_index + num10) * 3;
num12 = td[num11];
while (true)
{
num3 >>= td[num11 + 1];
num4 -= td[num11 + 1];
if ((num12 & 0x10) != 0)
{
break;
}
if ((num12 & 0x40) != 0)
{
z.Message = "invalid distance code";
num13 = z.AvailableBytesIn - num2;
num13 = ((num4 >> 3 >= num13) ? num13 : (num4 >> 3));
num2 += num13;
num -= num13;
num4 -= num13 << 3;
s.bitb = num3;
s.bitk = num4;
z.AvailableBytesIn = num2;
z.TotalBytesIn += num - z.NextIn;
z.NextIn = num;
s.writeAt = num5;
return(-3);
}
num10 += td[num11 + 2];
num10 += (num3 & InternalInflateConstants.InflateMask[num12]);
num11 = (td_index + num10) * 3;
num12 = td[num11];
}
for (num12 &= 0xF; num4 < num12; num4 += 8)
{
num2--;
num3 |= (z.InputBuffer[num++] & 0xFF) << num4;
}
int num16 = td[num11 + 2] + (num3 & InternalInflateConstants.InflateMask[num12]);
num3 >>= num12;
num4 -= num12;
num6 -= num13;
int num17;
if (num5 >= num16)
{
num17 = num5 - num16;
if (num5 - num17 > 0 && 2 > num5 - num17)
{
s.window[num5++] = s.window[num17++];
s.window[num5++] = s.window[num17++];
num13 -= 2;
}
else
{
Array.Copy(s.window, num17, s.window, num5, 2);
num5 += 2;
num17 += 2;
num13 -= 2;
}
}
else
{
num17 = num5 - num16;
do
{
num17 += s.end;
}while (num17 < 0);
num12 = s.end - num17;
if (num13 > num12)
{
num13 -= num12;
if (num5 - num17 > 0 && num12 > num5 - num17)
{
do
{
s.window[num5++] = s.window[num17++];
}while (--num12 != 0);
}
else
{
Array.Copy(s.window, num17, s.window, num5, num12);
num5 += num12;
num17 += num12;
num12 = 0;
}
num17 = 0;
}
}
if (num5 - num17 > 0 && num13 > num5 - num17)
{
do
{
s.window[num5++] = s.window[num17++];
}while (--num13 != 0);
}
else
{
Array.Copy(s.window, num17, s.window, num5, num13);
num5 += num13;
num17 += num13;
num13 = 0;
}
break;
}
if ((num12 & 0x40) != 0)
{
if ((num12 & 0x20) != 0)
{
num13 = z.AvailableBytesIn - num2;
num13 = ((num4 >> 3 >= num13) ? num13 : (num4 >> 3));
num2 += num13;
num -= num13;
num4 -= num13 << 3;
s.bitb = num3;
s.bitk = num4;
z.AvailableBytesIn = num2;
z.TotalBytesIn += num - z.NextIn;
z.NextIn = num;
s.writeAt = num5;
return(1);
}
z.Message = "invalid literal/length code";
num13 = z.AvailableBytesIn - num2;
num13 = ((num4 >> 3 >= num13) ? num13 : (num4 >> 3));
num2 += num13;
num -= num13;
num4 -= num13 << 3;
s.bitb = num3;
s.bitk = num4;
z.AvailableBytesIn = num2;
z.TotalBytesIn += num - z.NextIn;
z.NextIn = num;
s.writeAt = num5;
return(-3);
}
num10 += tl[num11 + 2];
num10 += (num3 & InternalInflateConstants.InflateMask[num12]);
num11 = (tl_index + num10) * 3;
if ((num12 = tl[num11]) == 0)
{
num3 >>= tl[num11 + 1];
num4 -= tl[num11 + 1];
s.window[num5++] = (byte)tl[num11 + 2];
num6--;
break;
}
}
}
else
{
num3 >>= tl[num11 + 1];
num4 -= tl[num11 + 1];
s.window[num5++] = (byte)tl[num11 + 2];
num6--;
}
if (num6 < 258 || num2 < 10)
{
break;
}
}
}
num13 = z.AvailableBytesIn - num2;
num13 = ((num4 >> 3 >= num13) ? num13 : (num4 >> 3));
num2 += num13;
num -= num13;
num4 -= num13 << 3;
s.bitb = num3;
s.bitk = num4;
z.AvailableBytesIn = num2;
z.TotalBytesIn += num - z.NextIn;
z.NextIn = num;
s.writeAt = num5;
return(0);
}
