| private Init ( int bl, int bd, int tl, int tl_index, int td, int td_index ) : void | ||
| bl | int | |
| bd | int | |
| tl | int | |
| tl_index | int | |
| td | int | |
| td_index | int | |
| return | void | |
internal int Process(int r)
{
int t; // temporary storage
int b; // bit buffer
int k; // bits in bit buffer
int p; // input data pointer
int n; // bytes available there
int q; // output window write pointer
int m; // bytes to end of window or read pointer
// copy input/output information to locals (UPDATE macro restores)
p = _codec.NextIn;
n = _codec.AvailableBytesIn;
b = bitb;
k = bitk;
q = writeAt;
m = (int)(q < readAt ? readAt - q - 1 : end - q);
// process input based on current state
while (true)
{
switch (mode)
{
case InflateBlockMode.TYPE:
while (k < (3))
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
t = (int)(b & 7);
last = t & 1;
switch ((uint)t >> 1)
{
case 0: // stored
b >>= 3; k -= (3);
t = k & 7; // go to byte boundary
b >>= t; k -= t;
mode = InflateBlockMode.LENS; // get length of stored block
break;
case 1: // fixed
int[] bl = new int[1];
int[] bd = new int[1];
int[][] tl = new int[1][];
int[][] td = new int[1][];
InfTree.inflate_trees_fixed(bl, bd, tl, td, _codec);
codes.Init(bl[0], bd[0], tl[0], 0, td[0], 0);
b >>= 3; k -= 3;
mode = InflateBlockMode.CODES;
break;
case 2: // dynamic
b >>= 3; k -= 3;
mode = InflateBlockMode.TABLE;
break;
case 3: // illegal
b >>= 3; k -= 3;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid block type";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
break;
case InflateBlockMode.LENS:
while (k < (32))
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
;
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
if ((((~b) >> 16) & 0xffff) != (b & 0xffff))
{
mode = InflateBlockMode.BAD;
_codec.Message = "invalid stored block lengths";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
left = (b & 0xffff);
b = k = 0; // dump bits
mode = left != 0 ? InflateBlockMode.STORED : (last != 0 ? InflateBlockMode.DRY : InflateBlockMode.TYPE);
break;
case InflateBlockMode.STORED:
if (n == 0)
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
if (m == 0)
{
if (q == end && readAt != 0)
{
q = 0; m = (int)(q < readAt ? readAt - q - 1 : end - q);
}
if (m == 0)
{
writeAt = q;
r = Flush(r);
q = writeAt; m = (int)(q < readAt ? readAt - q - 1 : end - q);
if (q == end && readAt != 0)
{
q = 0; m = (int)(q < readAt ? readAt - q - 1 : end - q);
}
if (m == 0)
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
r = ZlibConstants.Z_OK;
t = left;
if (t > n)
{
t = n;
}
if (t > m)
{
t = m;
}
Array.Copy(_codec.InputBuffer, p, window, q, t);
p += t; n -= t;
q += t; m -= t;
if ((left -= t) != 0)
{
break;
}
mode = last != 0 ? InflateBlockMode.DRY : InflateBlockMode.TYPE;
break;
case InflateBlockMode.TABLE:
while (k < (14))
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
table = t = (b & 0x3fff);
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
{
mode = InflateBlockMode.BAD;
_codec.Message = "too many length or distance symbols";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
if (blens == null || blens.Length < t)
{
blens = new int[t];
}
else
{
Array.Clear(blens, 0, t);
// for (int i = 0; i < t; i++)
// {
// blens[i] = 0;
// }
}
b >>= 14;
k -= 14;
index = 0;
mode = InflateBlockMode.BTREE;
goto case InflateBlockMode.BTREE;
case InflateBlockMode.BTREE:
while (index < 4 + (table >> 10))
{
while (k < (3))
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
blens[border[index++]] = b & 7;
b >>= 3; k -= 3;
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb[0] = 7;
t = inftree.inflate_trees_bits(blens, bb, tb, hufts, _codec);
if (t != ZlibConstants.Z_OK)
{
r = t;
if (r == ZlibConstants.Z_DATA_ERROR)
{
blens = null;
mode = InflateBlockMode.BAD;
}
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
index = 0;
mode = InflateBlockMode.DTREE;
goto case InflateBlockMode.DTREE;
case InflateBlockMode.DTREE:
while (true)
{
t = table;
if (!(index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)))
{
break;
}
int i, j, c;
t = bb[0];
while (k < t)
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
t = hufts[(tb[0] + (b & InternalInflateConstants.InflateMask[t])) * 3 + 1];
c = hufts[(tb[0] + (b & InternalInflateConstants.InflateMask[t])) * 3 + 2];
if (c < 16)
{
b >>= t; k -= t;
blens[index++] = c;
}
else
{
// c == 16..18
i = c == 18 ? 7 : c - 14;
j = c == 18 ? 11 : 3;
while (k < (t + i))
{
if (n != 0)
{
r = ZlibConstants.Z_OK;
}
else
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
n--;
b |= (_codec.InputBuffer[p++] & 0xff) << k;
k += 8;
}
b >>= t; k -= t;
j += (b & InternalInflateConstants.InflateMask[i]);
b >>= i; k -= i;
i = index;
t = table;
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || (c == 16 && i < 1))
{
blens = null;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid bit length repeat";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
c = (c == 16) ? blens[i - 1] : 0;
do
{
blens[i++] = c;
}while (--j != 0);
index = i;
}
}
tb[0] = -1;
{
int[] bl = new int[] { 9 }; // must be <= 9 for lookahead assumptions
int[] bd = new int[] { 6 }; // must be <= 9 for lookahead assumptions
int[] tl = new int[1];
int[] td = new int[1];
t = table;
t = inftree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tl, td, hufts, _codec);
if (t != ZlibConstants.Z_OK)
{
if (t == ZlibConstants.Z_DATA_ERROR)
{
blens = null;
mode = InflateBlockMode.BAD;
}
r = t;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
codes.Init(bl[0], bd[0], hufts, tl[0], hufts, td[0]);
}
mode = InflateBlockMode.CODES;
goto case InflateBlockMode.CODES;
case InflateBlockMode.CODES:
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
r = codes.Process(this, r);
if (r != ZlibConstants.Z_STREAM_END)
{
return(Flush(r));
}
r = ZlibConstants.Z_OK;
p = _codec.NextIn;
n = _codec.AvailableBytesIn;
b = bitb;
k = bitk;
q = writeAt;
m = (int)(q < readAt ? readAt - q - 1 : end - q);
if (last == 0)
{
mode = InflateBlockMode.TYPE;
break;
}
mode = InflateBlockMode.DRY;
goto case InflateBlockMode.DRY;
case InflateBlockMode.DRY:
writeAt = q;
r = Flush(r);
q = writeAt; m = (int)(q < readAt ? readAt - q - 1 : end - q);
if (readAt != writeAt)
{
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
mode = InflateBlockMode.DONE;
goto case InflateBlockMode.DONE;
case InflateBlockMode.DONE:
r = ZlibConstants.Z_STREAM_END;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
case InflateBlockMode.BAD:
r = ZlibConstants.Z_DATA_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
default:
r = ZlibConstants.Z_STREAM_ERROR;
bitb = b; bitk = k;
_codec.AvailableBytesIn = n;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
internal int Process(int r)
{
int num = _codec.NextIn;
int num2 = _codec.AvailableBytesIn;
int num3 = bitb;
int i = bitk;
int num4 = writeAt;
int num5 = (num4 >= readAt) ? (end - num4) : (readAt - num4 - 1);
while (true)
{
switch (mode)
{
case InflateBlockMode.TYPE:
{
for (; i < 3; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
int num7 = num3 & 7;
last = (num7 & 1);
switch ((uint)num7 >> 1)
{
case 0u:
num3 >>= 3;
i -= 3;
num7 = (i & 7);
num3 >>= num7;
i -= num7;
mode = InflateBlockMode.LENS;
break;
case 1u:
{
int[] array = new int[1];
int[] array2 = new int[1];
int[][] array3 = new int[1][];
int[][] array4 = new int[1][];
InfTree.inflate_trees_fixed(array, array2, array3, array4, _codec);
codes.Init(array[0], array2[0], array3[0], 0, array4[0], 0);
num3 >>= 3;
i -= 3;
mode = InflateBlockMode.CODES;
break;
}
case 2u:
num3 >>= 3;
i -= 3;
mode = InflateBlockMode.TABLE;
break;
case 3u:
num3 >>= 3;
i -= 3;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid block type";
r = -3;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
break;
}
case InflateBlockMode.LENS:
for (; i < 32; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
if (((~num3 >> 16) & 0xFFFF) != (num3 & 0xFFFF))
{
mode = InflateBlockMode.BAD;
_codec.Message = "invalid stored block lengths";
r = -3;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
left = (num3 & 0xFFFF);
num3 = (i = 0);
mode = ((left != 0) ? InflateBlockMode.STORED : ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE));
break;
case InflateBlockMode.STORED:
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
if (num5 == 0)
{
if (num4 == end && readAt != 0)
{
num4 = 0;
num5 = ((num4 >= readAt) ? (end - num4) : (readAt - num4 - 1));
}
if (num5 == 0)
{
writeAt = num4;
r = Flush(r);
num4 = writeAt;
num5 = ((num4 >= readAt) ? (end - num4) : (readAt - num4 - 1));
if (num4 == end && readAt != 0)
{
num4 = 0;
num5 = ((num4 >= readAt) ? (end - num4) : (readAt - num4 - 1));
}
if (num5 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
}
}
r = 0;
int num7 = left;
if (num7 > num2)
{
num7 = num2;
}
if (num7 > num5)
{
num7 = num5;
}
Array.Copy(_codec.InputBuffer, num, window, num4, num7);
num += num7;
num2 -= num7;
num4 += num7;
num5 -= num7;
if ((left -= num7) == 0)
{
mode = ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE);
}
break;
}
case InflateBlockMode.TABLE:
{
for (; i < 14; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
int num7 = table = (num3 & 0x3FFF);
if ((num7 & 0x1F) > 29 || ((num7 >> 5) & 0x1F) > 29)
{
mode = InflateBlockMode.BAD;
_codec.Message = "too many length or distance symbols";
r = -3;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
num7 = 258 + (num7 & 0x1F) + ((num7 >> 5) & 0x1F);
if (blens == null || blens.Length < num7)
{
blens = new int[num7];
}
else
{
Array.Clear(blens, 0, num7);
}
num3 >>= 14;
i -= 14;
index = 0;
mode = InflateBlockMode.BTREE;
goto case InflateBlockMode.BTREE;
}
case InflateBlockMode.BTREE:
{
while (index < 4 + (table >> 10))
{
for (; i < 3; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
blens[border[index++]] = (num3 & 7);
num3 >>= 3;
i -= 3;
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb[0] = 7;
int num7 = inftree.inflate_trees_bits(blens, bb, tb, hufts, _codec);
if (num7 != 0)
{
r = num7;
if (r == -3)
{
blens = null;
mode = InflateBlockMode.BAD;
}
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
index = 0;
mode = InflateBlockMode.DTREE;
goto case InflateBlockMode.DTREE;
}
case InflateBlockMode.DTREE:
{
int num7;
while (true)
{
num7 = table;
if (index >= 258 + (num7 & 0x1F) + ((num7 >> 5) & 0x1F))
{
break;
}
for (num7 = bb[0]; i < num7; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
num7 = hufts[(tb[0] + (num3 & InternalInflateConstants.InflateMask[num7])) * 3 + 1];
int num11 = hufts[(tb[0] + (num3 & InternalInflateConstants.InflateMask[num7])) * 3 + 2];
if (num11 < 16)
{
num3 >>= num7;
i -= num7;
blens[index++] = num11;
}
else
{
int num12 = (num11 != 18) ? (num11 - 14) : 7;
int num13 = (num11 != 18) ? 3 : 11;
for (; i < num7 + num12; i += 8)
{
if (num2 == 0)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
r = 0;
num2--;
num3 |= (_codec.InputBuffer[num++] & 0xFF) << i;
}
num3 >>= num7;
i -= num7;
num13 += (num3 & InternalInflateConstants.InflateMask[num12]);
num3 >>= num12;
i -= num12;
num12 = index;
num7 = table;
if (num12 + num13 > 258 + (num7 & 0x1F) + ((num7 >> 5) & 0x1F) || (num11 == 16 && num12 < 1))
{
blens = null;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid bit length repeat";
r = -3;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
num11 = ((num11 == 16) ? blens[num12 - 1] : 0);
do
{
blens[num12++] = num11;
}while (--num13 != 0);
index = num12;
}
}
tb[0] = -1;
int[] array5 = new int[1]
{
9
};
int[] array6 = new int[1]
{
6
};
int[] array7 = new int[1];
int[] array8 = new int[1];
num7 = table;
num7 = inftree.inflate_trees_dynamic(257 + (num7 & 0x1F), 1 + ((num7 >> 5) & 0x1F), blens, array5, array6, array7, array8, hufts, _codec);
switch (num7)
{
case -3:
blens = null;
mode = InflateBlockMode.BAD;
goto default;
default:
r = num7;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
case 0:
break;
}
codes.Init(array5[0], array6[0], hufts, array7[0], hufts, array8[0]);
mode = InflateBlockMode.CODES;
goto case InflateBlockMode.CODES;
}
case InflateBlockMode.CODES:
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
r = codes.Process(this, r);
if (r != 1)
{
return(Flush(r));
}
r = 0;
num = _codec.NextIn;
num2 = _codec.AvailableBytesIn;
num3 = bitb;
i = bitk;
num4 = writeAt;
num5 = ((num4 >= readAt) ? (end - num4) : (readAt - num4 - 1));
if (last == 0)
{
mode = InflateBlockMode.TYPE;
break;
}
mode = InflateBlockMode.DRY;
goto case InflateBlockMode.DRY;
case InflateBlockMode.DRY:
writeAt = num4;
r = Flush(r);
num4 = writeAt;
num5 = ((num4 >= readAt) ? (end - num4) : (readAt - num4 - 1));
if (readAt != writeAt)
{
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
mode = InflateBlockMode.DONE;
goto case InflateBlockMode.DONE;
case InflateBlockMode.DONE:
r = 1;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
case InflateBlockMode.BAD:
r = -3;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
default:
r = -2;
bitb = num3;
bitk = i;
_codec.AvailableBytesIn = num2;
_codec.TotalBytesIn += num - _codec.NextIn;
_codec.NextIn = num;
writeAt = num4;
return(Flush(r));
}
}
}
internal int Process(int r)
{
int p = _codec.NextIn;
int m = _codec.AvailableBytesIn;
int b = bitb;
int k = bitk;
int q = writeAt;
int l = ((q < readAt) ? (readAt - q - 1) : (end - q));
while (true)
{
switch (mode)
{
case InflateBlockMode.TYPE:
{
for (; k < 3; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
int t = b & 7;
last = t & 1;
switch ((uint)t >> 1)
{
case 0u:
b >>= 3;
k -= 3;
t = k & 7;
b >>= t;
k -= t;
mode = InflateBlockMode.LENS;
break;
case 1u:
{
int[] bl = new int[1];
int[] bd = new int[1];
int[][] tl = new int[1][];
int[][] td = new int[1][];
InfTree.inflate_trees_fixed(bl, bd, tl, td, _codec);
codes.Init(bl[0], bd[0], tl[0], 0, td[0], 0);
b >>= 3;
k -= 3;
mode = InflateBlockMode.CODES;
break;
}
case 2u:
b >>= 3;
k -= 3;
mode = InflateBlockMode.TABLE;
break;
case 3u:
b >>= 3;
k -= 3;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid block type";
r = -3;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
break;
}
case InflateBlockMode.LENS:
for (; k < 32; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
if (((~b >> 16) & 0xFFFF) != (b & 0xFFFF))
{
mode = InflateBlockMode.BAD;
_codec.Message = "invalid stored block lengths";
r = -3;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
left = b & 0xFFFF;
b = (k = 0);
mode = ((left != 0) ? InflateBlockMode.STORED : ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE));
break;
case InflateBlockMode.STORED:
{
if (m == 0)
{
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
if (l == 0)
{
if (q == end && readAt != 0)
{
q = 0;
l = ((q < readAt) ? (readAt - q - 1) : (end - q));
}
if (l == 0)
{
writeAt = q;
r = Flush(r);
q = writeAt;
l = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (q == end && readAt != 0)
{
q = 0;
l = ((q < readAt) ? (readAt - q - 1) : (end - q));
}
if (l == 0)
{
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
r = 0;
int t = left;
if (t > m)
{
t = m;
}
if (t > l)
{
t = l;
}
Array.Copy(_codec.InputBuffer, p, window, q, t);
p += t;
m -= t;
q += t;
l -= t;
if ((left -= t) == 0)
{
mode = ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE);
}
break;
}
case InflateBlockMode.TABLE:
{
for (; k < 14; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
int t = (table = b & 0x3FFF);
if ((t & 0x1F) > 29 || ((t >> 5) & 0x1F) > 29)
{
mode = InflateBlockMode.BAD;
_codec.Message = "too many length or distance symbols";
r = -3;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
t = 258 + (t & 0x1F) + ((t >> 5) & 0x1F);
if (blens == null || blens.Length < t)
{
blens = new int[t];
}
else
{
Array.Clear(blens, 0, t);
}
b >>= 14;
k -= 14;
index = 0;
mode = InflateBlockMode.BTREE;
goto case InflateBlockMode.BTREE;
}
case InflateBlockMode.BTREE:
{
while (index < 4 + (table >> 10))
{
for (; k < 3; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
blens[border[index++]] = b & 7;
b >>= 3;
k -= 3;
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb[0] = 7;
int t = inftree.inflate_trees_bits(blens, bb, tb, hufts, _codec);
if (t != 0)
{
r = t;
if (r == -3)
{
blens = null;
mode = InflateBlockMode.BAD;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
index = 0;
mode = InflateBlockMode.DTREE;
goto case InflateBlockMode.DTREE;
}
case InflateBlockMode.DTREE:
{
int t;
while (true)
{
t = table;
if (index >= 258 + (t & 0x1F) + ((t >> 5) & 0x1F))
{
break;
}
for (t = bb[0]; k < t; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
t = hufts[(tb[0] + (b & InternalInflateConstants.InflateMask[t])) * 3 + 1];
int c = hufts[(tb[0] + (b & InternalInflateConstants.InflateMask[t])) * 3 + 2];
if (c < 16)
{
b >>= t;
k -= t;
blens[index++] = c;
continue;
}
int i = ((c == 18) ? 7 : (c - 14));
int j = ((c == 18) ? 11 : 3);
for (; k < t + i; k += 8)
{
if (m != 0)
{
r = 0;
m--;
b |= (_codec.InputBuffer[p++] & 0xFF) << k;
continue;
}
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
b >>= t;
k -= t;
j += b & InternalInflateConstants.InflateMask[i];
b >>= i;
k -= i;
i = index;
t = table;
if (i + j > 258 + (t & 0x1F) + ((t >> 5) & 0x1F) || (c == 16 && i < 1))
{
blens = null;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid bit length repeat";
r = -3;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
c = ((c == 16) ? blens[i - 1] : 0);
do
{
blens[i++] = c;
}while (--j != 0);
index = i;
}
tb[0] = -1;
int[] bl2 = new int[1]
{
9
};
int[] bd2 = new int[1]
{
6
};
int[] tl2 = new int[1];
int[] td2 = new int[1];
t = table;
t = inftree.inflate_trees_dynamic(257 + (t & 0x1F), 1 + ((t >> 5) & 0x1F), blens, bl2, bd2, tl2, td2, hufts, _codec);
if (t != 0)
{
if (t == -3)
{
blens = null;
mode = InflateBlockMode.BAD;
}
r = t;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
codes.Init(bl2[0], bd2[0], hufts, tl2[0], hufts, td2[0]);
mode = InflateBlockMode.CODES;
goto case InflateBlockMode.CODES;
}
case InflateBlockMode.CODES:
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
r = codes.Process(this, r);
if (r != 1)
{
return(Flush(r));
}
r = 0;
p = _codec.NextIn;
m = _codec.AvailableBytesIn;
b = bitb;
k = bitk;
q = writeAt;
l = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (last == 0)
{
mode = InflateBlockMode.TYPE;
break;
}
mode = InflateBlockMode.DRY;
goto case InflateBlockMode.DRY;
case InflateBlockMode.DRY:
writeAt = q;
r = Flush(r);
q = writeAt;
l = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (readAt != writeAt)
{
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
mode = InflateBlockMode.DONE;
goto case InflateBlockMode.DONE;
case InflateBlockMode.DONE:
r = 1;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
case InflateBlockMode.BAD:
r = -3;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
default:
r = -2;
bitb = b;
bitk = k;
_codec.AvailableBytesIn = m;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
internal int Process(int r)
{
int t; // temporary storage
int nextIn = _NextIn; // input data pointer
int availIn = _AvailIn; // bytes available there
int bits = bitb; // bit buffer
int bitsNum = bitk; // bits in bit buffer
int q = writeAt; // output window write pointer
int m = q < readAt ? readAt - q - 1 : end - q; // bytes to end of window or read pointer
// process input based on current state
while (true)
{
switch (mode)
{
case InflateBlockMode.TYPE:
while (bitsNum < 3)
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
last = bits & 0x1;
switch ((bits & 0x7) >> 1)
{
case 0: // stored
bits >>= 3; bitsNum -= 3;
t = bitsNum & 7; // go to byte boundary
bits >>= t; bitsNum -= t;
mode = InflateBlockMode.LENS; // get length of stored block
break;
case 1: // fixed
int bl, bd;
int[] tl, td;
InfTree.InflateTreesFixed(out bl, out bd, out tl, out td);
codes.Init(bl, bd, tl, 0, td, 0);
bits >>= 3; bitsNum -= 3;
mode = InflateBlockMode.CODES;
break;
case 2: // dynamic
bits >>= 3; bitsNum -= 3;
mode = InflateBlockMode.TABLE;
break;
case 3: // illegal
throw new InvalidDataException("invalid block type");
}
break;
case InflateBlockMode.LENS:
while (bitsNum < 32)
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
if (((~bits >> 16) & 0xffff) != (bits & 0xffff))
{
throw new InvalidDataException("invalid stored block lengths");
}
left = bits & 0xffff;
bits = bitsNum = 0; // dump bits
mode = left != 0 ? InflateBlockMode.STORED : (last != 0 ? InflateBlockMode.DRY : InflateBlockMode.TYPE);
break;
case InflateBlockMode.STORED:
if (availIn == 0)
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
if (m == 0)
{
if (q == end && readAt != 0)
{
q = 0;
m = q < readAt ? readAt - q - 1 : end - q;
}
if (m == 0)
{
writeAt = q;
r = Flush(r);
q = writeAt;
m = q < readAt ? readAt - q - 1 : end - q;
if (q == end && readAt != 0)
{
q = 0;
m = q < readAt ? readAt - q - 1 : end - q;
}
if (m == 0)
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
}
}
r = RCode.Okay;
t = left;
if (t > availIn)
{
t = availIn;
}
if (t > m)
{
t = m;
}
Array.Copy(InputBuffer, nextIn, window, q, t);
nextIn += t; availIn -= t;
q += t; m -= t;
if ((left -= t) != 0)
{
break;
}
mode = last != 0 ? InflateBlockMode.DRY : InflateBlockMode.TYPE;
break;
case InflateBlockMode.TABLE:
while (bitsNum < 14)
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
table = t = (bits & 0x3fff);
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
{
throw new InvalidDataException("too many length or distance symbols");
}
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
if (blens == null || blens.Length < t)
{
blens = new int[t];
}
else
{
Array.Clear(blens, 0, t);
}
bits >>= 14;
bitsNum -= 14;
index = 0;
mode = InflateBlockMode.BTREE;
goto case InflateBlockMode.BTREE;
case InflateBlockMode.BTREE:
while (index < 4 + (table >> 10))
{
while (bitsNum < 3)
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
blens[border[index++]] = bits & 7;
bits >>= 3; bitsNum -= 3;
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb = 7;
inftree.InflateTreeBits(blens, ref bb, ref tb, hufts);
index = 0;
mode = InflateBlockMode.DTREE;
goto case InflateBlockMode.DTREE;
case InflateBlockMode.DTREE:
while (true)
{
t = table;
if (!(index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f)))
{
break;
}
t = bb;
while (bitsNum < t)
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
t = hufts[(tb + (bits & Constants.InflateMask[t])) * 3 + 1];
int c = hufts[(tb + (bits & Constants.InflateMask[t])) * 3 + 2];
if (c < 16)
{
bits >>= t; bitsNum -= t;
blens[index++] = c;
}
else
{
// c == 16..18
int i = c == 18 ? 7 : c - 14;
int j = c == 18 ? 11 : 3;
while (bitsNum < (t + i))
{
if (availIn != 0)
{
r = RCode.Okay;
}
else
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
availIn--;
bits |= InputBuffer[nextIn++] << bitsNum;
bitsNum += 8;
}
bits >>= t; bitsNum -= t;
j += (bits & Constants.InflateMask[i]);
bits >>= i; bitsNum -= i;
i = index;
if (i + j > 258 + (table & 0x1f) + ((table >> 5) & 0x1f) || (c == 16 && i < 1))
{
throw new InvalidDataException("invalid bit length repeat");
}
c = (c == 16) ? blens[i - 1] : 0;
do
{
blens[i++] = c;
} while (--j != 0);
index = i;
}
}
tb = -1;
{
int bl = 9; // must be <= 9 for lookahead assumptions
int bd = 6; // must be <= 9 for lookahead assumptions
int tl = 0;
int td = 0;
inftree.InflateTreesDynamic(257 + (table & 0x1f), 1 + ((table >> 5) & 0x1f), blens,
ref bl, ref bd, ref tl, ref td, hufts);
codes.Init(bl, bd, hufts, tl, hufts, td);
}
mode = InflateBlockMode.CODES;
goto case InflateBlockMode.CODES;
case InflateBlockMode.CODES:
UpdateState(bits, bitsNum, availIn, nextIn, q);
r = codes.Process(this, r);
if (r != RCode.StreamEnd)
{
return(Flush(r));
}
r = RCode.Okay;
nextIn = _NextIn;
availIn = _AvailIn;
bits = bitb;
bitsNum = bitk;
q = writeAt;
m = q < readAt ? readAt - q - 1 : end - q;
if (last == 0)
{
mode = InflateBlockMode.TYPE;
break;
}
mode = InflateBlockMode.DRY;
goto case InflateBlockMode.DRY;
case InflateBlockMode.DRY:
writeAt = q;
r = Flush(r);
q = writeAt;
m = q < readAt ? readAt - q - 1 : end - q;
if (readAt != writeAt)
{
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, r));
}
mode = InflateBlockMode.DONE;
goto case InflateBlockMode.DONE;
case InflateBlockMode.DONE:
return(RanOutOfInput(bits, bitsNum, availIn, nextIn, q, RCode.StreamEnd));
default:
throw new InvalidOperationException("Invalid inflate block mode: " + mode);
}
}
}
internal int Process(int r)
{
int p = _codec.NextIn;
int n2 = _codec.AvailableBytesIn;
int b4 = bitb;
int k2 = bitk;
int q = writeAt;
int m2 = (q < readAt) ? (readAt - q - 1) : (end - q);
while (true)
{
switch (mode)
{
case InflateBlockMode.TYPE:
{
for (; k2 < 3; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
int t12 = b4 & 7;
last = (t12 & 1);
switch ((uint)t12 >> 1)
{
case 0u:
b4 >>= 3;
k2 -= 3;
t12 = (k2 & 7);
b4 >>= t12;
k2 -= t12;
mode = InflateBlockMode.LENS;
break;
case 1u:
{
int[] bl = new int[1];
int[] bd = new int[1];
int[][] tl = new int[1][];
int[][] td = new int[1][];
InfTree.inflate_trees_fixed(bl, bd, tl, td, _codec);
codes.Init(bl[0], bd[0], tl[0], 0, td[0], 0);
b4 >>= 3;
k2 -= 3;
mode = InflateBlockMode.CODES;
break;
}
case 2u:
b4 >>= 3;
k2 -= 3;
mode = InflateBlockMode.TABLE;
break;
case 3u:
b4 >>= 3;
k2 -= 3;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid block type";
r = -3;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
break;
}
case InflateBlockMode.LENS:
for (; k2 < 32; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
if (((~b4 >> 16) & 0xFFFF) != (b4 & 0xFFFF))
{
mode = InflateBlockMode.BAD;
_codec.Message = "invalid stored block lengths";
r = -3;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
left = (b4 & 0xFFFF);
b4 = (k2 = 0);
mode = ((left != 0) ? InflateBlockMode.STORED : ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE));
break;
case InflateBlockMode.STORED:
{
if (n2 == 0)
{
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
if (m2 == 0)
{
if (q == end && readAt != 0)
{
q = 0;
m2 = ((q < readAt) ? (readAt - q - 1) : (end - q));
}
if (m2 == 0)
{
writeAt = q;
r = Flush(r);
q = writeAt;
m2 = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (q == end && readAt != 0)
{
q = 0;
m2 = ((q < readAt) ? (readAt - q - 1) : (end - q));
}
if (m2 == 0)
{
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
r = 0;
int t12 = left;
if (t12 > n2)
{
t12 = n2;
}
if (t12 > m2)
{
t12 = m2;
}
Array.Copy(_codec.InputBuffer, p, window, q, t12);
p += t12;
n2 -= t12;
q += t12;
m2 -= t12;
if ((left -= t12) == 0)
{
mode = ((last != 0) ? InflateBlockMode.DRY : InflateBlockMode.TYPE);
}
break;
}
case InflateBlockMode.TABLE:
{
for (; k2 < 14; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
int t12 = table = (b4 & 0x3FFF);
if ((t12 & 0x1F) > 29 || ((t12 >> 5) & 0x1F) > 29)
{
mode = InflateBlockMode.BAD;
_codec.Message = "too many length or distance symbols";
r = -3;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
t12 = 258 + (t12 & 0x1F) + ((t12 >> 5) & 0x1F);
if (blens == null || blens.Length < t12)
{
blens = new int[t12];
}
else
{
Array.Clear(blens, 0, t12);
}
b4 >>= 14;
k2 -= 14;
index = 0;
mode = InflateBlockMode.BTREE;
goto case InflateBlockMode.BTREE;
}
case InflateBlockMode.BTREE:
{
while (index < 4 + (table >> 10))
{
for (; k2 < 3; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
blens[border[index++]] = (b4 & 7);
b4 >>= 3;
k2 -= 3;
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb[0] = 7;
int t12 = inftree.inflate_trees_bits(blens, bb, tb, hufts, _codec);
if (t12 != 0)
{
r = t12;
if (r == -3)
{
blens = null;
mode = InflateBlockMode.BAD;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
index = 0;
mode = InflateBlockMode.DTREE;
goto case InflateBlockMode.DTREE;
}
case InflateBlockMode.DTREE:
{
int t12;
while (true)
{
t12 = table;
if (index >= 258 + (t12 & 0x1F) + ((t12 >> 5) & 0x1F))
{
break;
}
for (t12 = bb[0]; k2 < t12; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
t12 = hufts[(tb[0] + (b4 & InternalInflateConstants.InflateMask[t12])) * 3 + 1];
int c2 = hufts[(tb[0] + (b4 & InternalInflateConstants.InflateMask[t12])) * 3 + 2];
if (c2 < 16)
{
b4 >>= t12;
k2 -= t12;
blens[index++] = c2;
continue;
}
int i2 = (c2 == 18) ? 7 : (c2 - 14);
int j2 = (c2 == 18) ? 11 : 3;
for (; k2 < t12 + i2; k2 += 8)
{
if (n2 != 0)
{
r = 0;
n2--;
b4 |= (_codec.InputBuffer[p++] & 0xFF) << k2;
continue;
}
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
b4 >>= t12;
k2 -= t12;
j2 += (b4 & InternalInflateConstants.InflateMask[i2]);
b4 >>= i2;
k2 -= i2;
i2 = index;
t12 = table;
if (i2 + j2 > 258 + (t12 & 0x1F) + ((t12 >> 5) & 0x1F) || (c2 == 16 && i2 < 1))
{
blens = null;
mode = InflateBlockMode.BAD;
_codec.Message = "invalid bit length repeat";
r = -3;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
c2 = ((c2 == 16) ? blens[i2 - 1] : 0);
do
{
blens[i2++] = c2;
}while (--j2 != 0);
index = i2;
}
tb[0] = -1;
int[] bl2 = new int[1]
{
9
};
int[] bd2 = new int[1]
{
6
};
int[] tl2 = new int[1];
int[] td2 = new int[1];
t12 = table;
t12 = inftree.inflate_trees_dynamic(257 + (t12 & 0x1F), 1 + ((t12 >> 5) & 0x1F), blens, bl2, bd2, tl2, td2, hufts, _codec);
if (t12 != 0)
{
if (t12 == -3)
{
blens = null;
mode = InflateBlockMode.BAD;
}
r = t12;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
codes.Init(bl2[0], bd2[0], hufts, tl2[0], hufts, td2[0]);
mode = InflateBlockMode.CODES;
goto case InflateBlockMode.CODES;
}
case InflateBlockMode.CODES:
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
r = codes.Process(this, r);
if (r != 1)
{
return(Flush(r));
}
r = 0;
p = _codec.NextIn;
n2 = _codec.AvailableBytesIn;
b4 = bitb;
k2 = bitk;
q = writeAt;
m2 = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (last == 0)
{
mode = InflateBlockMode.TYPE;
break;
}
mode = InflateBlockMode.DRY;
goto case InflateBlockMode.DRY;
case InflateBlockMode.DRY:
writeAt = q;
r = Flush(r);
q = writeAt;
m2 = ((q < readAt) ? (readAt - q - 1) : (end - q));
if (readAt != writeAt)
{
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
mode = InflateBlockMode.DONE;
goto case InflateBlockMode.DONE;
case InflateBlockMode.DONE:
r = 1;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
case InflateBlockMode.BAD:
r = -3;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
default:
r = -2;
bitb = b4;
bitk = k2;
_codec.AvailableBytesIn = n2;
_codec.TotalBytesIn += p - _codec.NextIn;
_codec.NextIn = p;
writeAt = q;
return(Flush(r));
}
}
}
