internal int inflateEnd(ZStream z)
{
if (this.blocks != null)
{
this.blocks.free(z);
}
this.blocks = null;
return(0);
}
internal int inflateInit(ZStream z, int w)
{
z.msg = null;
this.blocks = null;
this.nowrap = 0;
if (w < 0)
{
w = -w;
this.nowrap = 1;
}
if ((w < 8) || (w > 15))
{
this.inflateEnd(z);
return(-2);
}
this.wbits = w;
z.istate.blocks = new InfBlocks(z, (z.istate.nowrap != 0) ? null : this, ((int)1) << w);
this.inflateReset(z);
return(0);
}
internal int inflateInit(ZStream z, int w) {
z.msg = null;
this.blocks = null;
this.nowrap = 0;
if (w < 0) {
w = -w;
this.nowrap = 1;
}
if ((w < 8) || (w > 15)) {
this.inflateEnd(z);
return -2;
}
this.wbits = w;
z.istate.blocks = new InfBlocks(z, (z.istate.nowrap != 0) ? null : this, ((int)1) << w);
this.inflateReset(z);
return 0;
}
internal int inflateEnd(ZStream z) {
if (this.blocks != null) {
this.blocks.free(z);
}
this.blocks = null;
return 0;
}
internal int inflate_fast(int bl, int bd, int[] tl, int tl_index, int[] td, int td_index, InfBlocks s, ZStream z) {
int num12;
int num6 = z.next_in_index;
int num7 = z.avail_in;
int bitb = s.bitb;
int bitk = s.bitk;
int write = s.write;
int num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
int num10 = inflate_mask[bl];
int num11 = inflate_mask[bd];
Label_0092:
while (bitk < 20) {
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int num = bitb & num10;
int[] numArray = tl;
int num2 = tl_index;
int index = numArray[(num2 + num) * 3];
if (index == 0) {
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
s.window[write++] = (byte)numArray[((num2 + num) * 3) + 2];
num9--;
goto Label_05E0;
}
Label_00F1:
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
if ((index & 0x10) == 0) {
if ((index & 0x40) == 0) {
num += numArray[((num2 + num) * 3) + 2];
num += bitb & inflate_mask[index];
index = numArray[(num2 + num) * 3];
if (index != 0) {
goto Label_00F1;
}
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
s.window[write++] = (byte)numArray[((num2 + num) * 3) + 2];
num9--;
} else {
if ((index & 0x20) != 0) {
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return 1;
}
z.msg = "invalid literal/length code";
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return -3;
}
goto Label_05E0;
}
index &= 15;
num12 = numArray[((num2 + num) * 3) + 2] + (bitb & inflate_mask[index]);
bitb = bitb >> index;
bitk -= index;
while (bitk < 15) {
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
num = bitb & num11;
numArray = td;
num2 = td_index;
index = numArray[(num2 + num) * 3];
Label_018B:
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
if ((index & 0x10) != 0) {
int num14;
index &= 15;
while (bitk < index) {
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int num13 = numArray[((num2 + num) * 3) + 2] + (bitb & inflate_mask[index]);
bitb = bitb >> index;
bitk -= index;
num9 -= num12;
if (write >= num13) {
num14 = write - num13;
if (((write - num14) > 0) && (2 > (write - num14))) {
s.window[write++] = s.window[num14++];
num12--;
s.window[write++] = s.window[num14++];
num12--;
} else {
Array.Copy(s.window, num14, s.window, write, 2);
write += 2;
num14 += 2;
num12 -= 2;
}
} else {
num14 = write - num13;
do {
num14 += s.end;
}
while (num14 < 0);
index = s.end - num14;
if (num12 > index) {
num12 -= index;
if (((write - num14) > 0) && (index > (write - num14))) {
do {
s.window[write++] = s.window[num14++];
}
while (--index != 0);
} else {
Array.Copy(s.window, num14, s.window, write, index);
write += index;
num14 += index;
index = 0;
}
num14 = 0;
}
}
if (((write - num14) > 0) && (num12 > (write - num14))) {
do {
s.window[write++] = s.window[num14++];
}
while (--num12 != 0);
} else {
Array.Copy(s.window, num14, s.window, write, num12);
write += num12;
num14 += num12;
num12 = 0;
}
} else {
if ((index & 0x40) == 0) {
num += numArray[((num2 + num) * 3) + 2];
num += bitb & inflate_mask[index];
index = numArray[(num2 + num) * 3];
goto Label_018B;
}
z.msg = "invalid distance code";
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return -3;
}
Label_05E0:
if ((num9 >= 0x102) && (num7 >= 10)) {
goto Label_0092;
}
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return 0;
}
internal int proc(InfBlocks s, ZStream z, int r) {
int num;
int num10;
int number = 0;
int bitk = 0;
int num6 = 0;
num6 = z.next_in_index;
int num7 = z.avail_in;
number = s.bitb;
bitk = s.bitk;
int write = s.write;
int num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
Label_0051:
switch (this.mode) {
case 0:
if ((num9 < 0x102) || (num7 < 10)) {
break;
}
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
r = this.inflate_fast(this.lbits, this.dbits, this.ltree, this.ltree_index, this.dtree, this.dtree_index, s, z);
num6 = z.next_in_index;
num7 = z.avail_in;
number = s.bitb;
bitk = s.bitk;
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if (r == 0) {
break;
}
this.mode = (r == 1) ? 7 : 9;
goto Label_0051;
case 1:
goto Label_0199;
case 2:
num = this.get_Renamed;
while (bitk < num) {
if (num7 != 0) {
r = 0;
} else {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
this.len += number & inflate_mask[num];
number = number >> num;
bitk -= num;
this.need = this.dbits;
this.tree = this.dtree;
this.tree_index = this.dtree_index;
this.mode = 3;
goto Label_0412;
case 3:
goto Label_0412;
case 4:
num = this.get_Renamed;
while (bitk < num) {
if (num7 != 0) {
r = 0;
} else {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
this.dist += number & inflate_mask[num];
number = number >> num;
bitk -= num;
this.mode = 5;
goto Label_0635;
case 5:
goto Label_0635;
case 6:
if (num9 == 0) {
if ((write == s.end) && (s.read != 0)) {
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0) {
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if ((write == s.end) && (s.read != 0)) {
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0) {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
}
}
r = 0;
s.window[write++] = (byte)this.lit;
num9--;
this.mode = 0;
goto Label_0051;
case 7:
if (bitk > 7) {
bitk -= 8;
num7++;
num6--;
}
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if (s.read != s.write) {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
this.mode = 8;
goto Label_098A;
case 8:
goto Label_098A;
case 9:
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
default:
r = -2;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
this.need = this.lbits;
this.tree = this.ltree;
this.tree_index = this.ltree_index;
this.mode = 1;
Label_0199:
num = this.need;
while (bitk < num) {
if (num7 != 0) {
r = 0;
} else {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int index = (this.tree_index + (number & inflate_mask[num])) * 3;
number = SupportClass.URShift(number, this.tree[index + 1]);
bitk -= this.tree[index + 1];
int num3 = this.tree[index];
if (num3 == 0) {
this.lit = this.tree[index + 2];
this.mode = 6;
goto Label_0051;
}
if ((num3 & 0x10) != 0) {
this.get_Renamed = num3 & 15;
this.len = this.tree[index + 2];
this.mode = 2;
goto Label_0051;
}
if ((num3 & 0x40) == 0) {
this.need = num3;
this.tree_index = (index / 3) + this.tree[index + 2];
goto Label_0051;
}
if ((num3 & 0x20) != 0) {
this.mode = 7;
goto Label_0051;
}
this.mode = 9;
z.msg = "invalid literal/length code";
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
Label_0412:
num = this.need;
while (bitk < num) {
if (num7 != 0) {
r = 0;
} else {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
index = (this.tree_index + (number & inflate_mask[num])) * 3;
number = number >> this.tree[index + 1];
bitk -= this.tree[index + 1];
num3 = this.tree[index];
if ((num3 & 0x10) != 0) {
this.get_Renamed = num3 & 15;
this.dist = this.tree[index + 2];
this.mode = 4;
goto Label_0051;
}
if ((num3 & 0x40) == 0) {
this.need = num3;
this.tree_index = (index / 3) + this.tree[index + 2];
goto Label_0051;
}
this.mode = 9;
z.msg = "invalid distance code";
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
Label_0635:
num10 = write - this.dist;
while (num10 < 0) {
num10 += s.end;
}
while (this.len != 0) {
if (num9 == 0) {
if ((write == s.end) && (s.read != 0)) {
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0) {
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if ((write == s.end) && (s.read != 0)) {
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0) {
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
}
}
s.window[write++] = s.window[num10++];
num9--;
if (num10 == s.end) {
num10 = 0;
}
this.len--;
}
this.mode = 0;
goto Label_0051;
Label_098A:
r = 1;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return s.inflate_flush(z, r);
}
internal int inflate_fast(int bl, int bd, int[] tl, int tl_index, int[] td, int td_index, InfBlocks s, ZStream z)
{
int num12;
int num6 = z.next_in_index;
int num7 = z.avail_in;
int bitb = s.bitb;
int bitk = s.bitk;
int write = s.write;
int num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
int num10 = inflate_mask[bl];
int num11 = inflate_mask[bd];
Label_0092:
while (bitk < 20)
{
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int num = bitb & num10;
int[] numArray = tl;
int num2 = tl_index;
int index = numArray[(num2 + num) * 3];
if (index == 0)
{
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
s.window[write++] = (byte)numArray[((num2 + num) * 3) + 2];
num9--;
goto Label_05E0;
}
Label_00F1:
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
if ((index & 0x10) == 0)
{
if ((index & 0x40) == 0)
{
num += numArray[((num2 + num) * 3) + 2];
num += bitb & inflate_mask[index];
index = numArray[(num2 + num) * 3];
if (index != 0)
{
goto Label_00F1;
}
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
s.window[write++] = (byte)numArray[((num2 + num) * 3) + 2];
num9--;
}
else
{
if ((index & 0x20) != 0)
{
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(1);
}
z.msg = "invalid literal/length code";
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(-3);
}
goto Label_05E0;
}
index &= 15;
num12 = numArray[((num2 + num) * 3) + 2] + (bitb & inflate_mask[index]);
bitb = bitb >> index;
bitk -= index;
while (bitk < 15)
{
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
num = bitb & num11;
numArray = td;
num2 = td_index;
index = numArray[(num2 + num) * 3];
Label_018B:
bitb = bitb >> numArray[((num2 + num) * 3) + 1];
bitk -= numArray[((num2 + num) * 3) + 1];
if ((index & 0x10) != 0)
{
int num14;
index &= 15;
while (bitk < index)
{
num7--;
bitb |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int num13 = numArray[((num2 + num) * 3) + 2] + (bitb & inflate_mask[index]);
bitb = bitb >> index;
bitk -= index;
num9 -= num12;
if (write >= num13)
{
num14 = write - num13;
if (((write - num14) > 0) && (2 > (write - num14)))
{
s.window[write++] = s.window[num14++];
num12--;
s.window[write++] = s.window[num14++];
num12--;
}
else
{
Array.Copy(s.window, num14, s.window, write, 2);
write += 2;
num14 += 2;
num12 -= 2;
}
}
else
{
num14 = write - num13;
do
{
num14 += s.end;
}while (num14 < 0);
index = s.end - num14;
if (num12 > index)
{
num12 -= index;
if (((write - num14) > 0) && (index > (write - num14)))
{
do
{
s.window[write++] = s.window[num14++];
}while (--index != 0);
}
else
{
Array.Copy(s.window, num14, s.window, write, index);
write += index;
num14 += index;
index = 0;
}
num14 = 0;
}
}
if (((write - num14) > 0) && (num12 > (write - num14)))
{
do
{
s.window[write++] = s.window[num14++];
}while (--num12 != 0);
}
else
{
Array.Copy(s.window, num14, s.window, write, num12);
write += num12;
num14 += num12;
num12 = 0;
}
}
else
{
if ((index & 0x40) == 0)
{
num += numArray[((num2 + num) * 3) + 2];
num += bitb & inflate_mask[index];
index = numArray[(num2 + num) * 3];
goto Label_018B;
}
z.msg = "invalid distance code";
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(-3);
}
Label_05E0:
if ((num9 >= 0x102) && (num7 >= 10))
{
goto Label_0092;
}
num12 = z.avail_in - num7;
num12 = ((bitk >> 3) < num12) ? (bitk >> 3) : num12;
num7 += num12;
num6 -= num12;
bitk -= num12 << 3;
s.bitb = bitb;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(0);
}
internal int proc(InfBlocks s, ZStream z, int r)
{
int num;
int num10;
int number = 0;
int bitk = 0;
int num6 = 0;
num6 = z.next_in_index;
int num7 = z.avail_in;
number = s.bitb;
bitk = s.bitk;
int write = s.write;
int num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
Label_0051:
switch (this.mode)
{
case 0:
if ((num9 < 0x102) || (num7 < 10))
{
break;
}
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
r = this.inflate_fast(this.lbits, this.dbits, this.ltree, this.ltree_index, this.dtree, this.dtree_index, s, z);
num6 = z.next_in_index;
num7 = z.avail_in;
number = s.bitb;
bitk = s.bitk;
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if (r == 0)
{
break;
}
this.mode = (r == 1) ? 7 : 9;
goto Label_0051;
case 1:
goto Label_0199;
case 2:
num = this.get_Renamed;
while (bitk < num)
{
if (num7 != 0)
{
r = 0;
}
else
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
this.len += number & inflate_mask[num];
number = number >> num;
bitk -= num;
this.need = this.dbits;
this.tree = this.dtree;
this.tree_index = this.dtree_index;
this.mode = 3;
goto Label_0412;
case 3:
goto Label_0412;
case 4:
num = this.get_Renamed;
while (bitk < num)
{
if (num7 != 0)
{
r = 0;
}
else
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
this.dist += number & inflate_mask[num];
number = number >> num;
bitk -= num;
this.mode = 5;
goto Label_0635;
case 5:
goto Label_0635;
case 6:
if (num9 == 0)
{
if ((write == s.end) && (s.read != 0))
{
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0)
{
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if ((write == s.end) && (s.read != 0))
{
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0)
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
}
}
r = 0;
s.window[write++] = (byte)this.lit;
num9--;
this.mode = 0;
goto Label_0051;
case 7:
if (bitk > 7)
{
bitk -= 8;
num7++;
num6--;
}
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if (s.read != s.write)
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
this.mode = 8;
goto Label_098A;
case 8:
goto Label_098A;
case 9:
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
default:
r = -2;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
this.need = this.lbits;
this.tree = this.ltree;
this.tree_index = this.ltree_index;
this.mode = 1;
Label_0199:
num = this.need;
while (bitk < num)
{
if (num7 != 0)
{
r = 0;
}
else
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
int index = (this.tree_index + (number & inflate_mask[num])) * 3;
number = SupportClass.URShift(number, this.tree[index + 1]);
bitk -= this.tree[index + 1];
int num3 = this.tree[index];
if (num3 == 0)
{
this.lit = this.tree[index + 2];
this.mode = 6;
goto Label_0051;
}
if ((num3 & 0x10) != 0)
{
this.get_Renamed = num3 & 15;
this.len = this.tree[index + 2];
this.mode = 2;
goto Label_0051;
}
if ((num3 & 0x40) == 0)
{
this.need = num3;
this.tree_index = (index / 3) + this.tree[index + 2];
goto Label_0051;
}
if ((num3 & 0x20) != 0)
{
this.mode = 7;
goto Label_0051;
}
this.mode = 9;
z.msg = "invalid literal/length code";
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
Label_0412:
num = this.need;
while (bitk < num)
{
if (num7 != 0)
{
r = 0;
}
else
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
num7--;
number |= (z.next_in[num6++] & 0xff) << bitk;
bitk += 8;
}
index = (this.tree_index + (number & inflate_mask[num])) * 3;
number = number >> this.tree[index + 1];
bitk -= this.tree[index + 1];
num3 = this.tree[index];
if ((num3 & 0x10) != 0)
{
this.get_Renamed = num3 & 15;
this.dist = this.tree[index + 2];
this.mode = 4;
goto Label_0051;
}
if ((num3 & 0x40) == 0)
{
this.need = num3;
this.tree_index = (index / 3) + this.tree[index + 2];
goto Label_0051;
}
this.mode = 9;
z.msg = "invalid distance code";
r = -3;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
Label_0635:
num10 = write - this.dist;
while (num10 < 0)
{
num10 += s.end;
}
while (this.len != 0)
{
if (num9 == 0)
{
if ((write == s.end) && (s.read != 0))
{
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0)
{
s.write = write;
r = s.inflate_flush(z, r);
write = s.write;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
if ((write == s.end) && (s.read != 0))
{
write = 0;
num9 = (write < s.read) ? ((s.read - write) - 1) : (s.end - write);
}
if (num9 == 0)
{
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}
}
}
s.window[write++] = s.window[num10++];
num9--;
if (num10 == s.end)
{
num10 = 0;
}
this.len--;
}
this.mode = 0;
goto Label_0051;
Label_098A:
r = 1;
s.bitb = number;
s.bitk = bitk;
z.avail_in = num7;
z.total_in += num6 - z.next_in_index;
z.next_in_index = num6;
s.write = write;
return(s.inflate_flush(z, r));
}