internal int proc(ZStream z, 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 = z.next_in_index; n = z.avail_in; b = bitb; k = bitk;
}
{
q = write; m = (int)(q < read?read - q - 1:end - q);
}
// process input based on current state
while (true)
{
switch (mode)
{
case TYPE:
while (k < (3))
{
if (n != 0)
{
r = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
t = (int)(b & 7);
last = t & 1;
switch (SupportClass.URShift(t, 1))
{
case 0: // stored
{
b = SupportClass.URShift(b, (3)); k -= (3);
}
t = k & 7; // go to byte boundary
{
b = SupportClass.URShift(b, (t)); k -= (t);
}
mode = 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, z);
codes = new InfCodes(bl[0], bd[0], tl[0], td[0], z);
}
{
b = SupportClass.URShift(b, (3)); k -= (3);
}
mode = CODES;
break;
case 2: // dynamic
{
b = SupportClass.URShift(b, (3)); k -= (3);
}
mode = TABLE;
break;
case 3: // illegal
{
b = SupportClass.URShift(b, (3)); k -= (3);
}
mode = BAD;
z.msg = "invalid block type";
r = Z_DATA_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
break;
case LENS:
while (k < (32))
{
if (n != 0)
{
r = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
if (((SupportClass.URShift((~b), 16)) & 0xffff) != (b & 0xffff))
{
mode = BAD;
z.msg = "invalid stored block lengths";
r = Z_DATA_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
left = (b & 0xffff);
b = k = 0; // dump bits
mode = left != 0?STORED:(last != 0?DRY:TYPE);
break;
case STORED:
if (n == 0)
{
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
if (m == 0)
{
if (q == end && read != 0)
{
q = 0; m = (int)(q < read?read - q - 1:end - q);
}
if (m == 0)
{
write = q;
r = inflate_flush(z, r);
q = write; m = (int)(q < read?read - q - 1:end - q);
if (q == end && read != 0)
{
q = 0; m = (int)(q < read?read - q - 1:end - q);
}
if (m == 0)
{
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
}
}
r = Z_OK;
t = left;
if (t > n)
{
t = n;
}
if (t > m)
{
t = m;
}
System.Array.Copy(z.next_in, p, window, q, t);
p += t; n -= t;
q += t; m -= t;
if ((left -= t) != 0)
{
break;
}
mode = last != 0?DRY:TYPE;
break;
case TABLE:
while (k < (14))
{
if (n != 0)
{
r = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
table = t = (b & 0x3fff);
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
{
mode = BAD;
z.msg = "too many length or distance symbols";
r = Z_DATA_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
blens = new int[t];
{
b = SupportClass.URShift(b, (14)); k -= (14);
}
index = 0;
mode = BTREE;
goto case BTREE;
case BTREE:
while (index < 4 + (SupportClass.URShift(table, 10)))
{
while (k < (3))
{
if (n != 0)
{
r = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
blens[border[index++]] = b & 7;
{
b = SupportClass.URShift(b, (3)); k -= (3);
}
}
while (index < 19)
{
blens[border[index++]] = 0;
}
bb[0] = 7;
t = InfTree.inflate_trees_bits(blens, bb, tb, hufts, z);
if (t != Z_OK)
{
r = t;
if (r == Z_DATA_ERROR)
{
blens = null;
mode = BAD;
}
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
index = 0;
mode = DTREE;
goto case DTREE;
case 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 = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
if (tb[0] == -1)
{
//System.err.println("null...");
}
t = hufts[(tb[0] + (b & inflate_mask[t])) * 3 + 1];
c = hufts[(tb[0] + (b & inflate_mask[t])) * 3 + 2];
if (c < 16)
{
b = SupportClass.URShift(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 = Z_OK;
}
else
{
bitb = b; bitk = k;
z.avail_in = n;
z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
;
n--;
b |= (z.next_in[p++] & 0xff) << k;
k += 8;
}
b = SupportClass.URShift(b, (t)); k -= (t);
j += (b & inflate_mask[i]);
b = SupportClass.URShift(b, (i)); k -= (i);
i = index;
t = table;
if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) || (c == 16 && i < 1))
{
blens = null;
mode = BAD;
z.msg = "invalid bit length repeat";
r = Z_DATA_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
c = c == 16?blens[i - 1]:0;
do
{
blens[i++] = c;
}while (--j != 0);
index = i;
}
}
tb[0] = -1;
{
int[] bl = new int[1];
int[] bd = new int[1];
int[] tl = new int[1];
int[] td = new int[1];
bl[0] = 9; // must be <= 9 for lookahead assumptions
bd[0] = 6; // must be <= 9 for lookahead assumptions
t = table;
t = InfTree.inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f), blens, bl, bd, tl, td, hufts, z);
if (t != Z_OK)
{
if (t == Z_DATA_ERROR)
{
blens = null;
mode = BAD;
}
r = t;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
codes = new InfCodes(bl[0], bd[0], hufts, tl[0], hufts, td[0], z);
}
blens = null;
mode = CODES;
goto case CODES;
case CODES:
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
if ((r = codes.proc(this, z, r)) != Z_STREAM_END)
{
return(inflate_flush(z, r));
}
r = Z_OK;
codes.free(z);
p = z.next_in_index; n = z.avail_in; b = bitb; k = bitk;
q = write; m = (int)(q < read?read - q - 1:end - q);
if (last == 0)
{
mode = TYPE;
break;
}
mode = DRY;
goto case DRY;
case DRY:
write = q;
r = inflate_flush(z, r);
q = write; m = (int)(q < read?read - q - 1:end - q);
if (read != write)
{
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
mode = DONE;
goto case DONE;
case DONE:
r = Z_STREAM_END;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
case BAD:
r = Z_DATA_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
default:
r = Z_STREAM_ERROR;
bitb = b; bitk = k;
z.avail_in = n; z.total_in += p - z.next_in_index; z.next_in_index = p;
write = q;
return(inflate_flush(z, r));
}
}
}
internal int Proc(ZStream z, 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 = z.NextInIndex; n = z.AvailIn; b = Bitb; k = Bitk;
}
{
q = Write; m = q < Read ? Read - q - 1 : End - q;
}
// process input based on current state
while (true)
{
switch (Mode)
{
case Type:
while (k < (3))
{
if (n != 0)
{
r = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
n--;
b |= (z.NextIn[p++] & 0xff) << k;
k += 8;
}
t = b & 7;
_last = t & 1;
switch (t >> 1)
{
case 0:
{ // stored
b >>= (3); k -= (3);
}
t = k & 7;
{ // go to byte boundary
b >>= (t); k -= (t);
}
Mode = 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, z);
codes.Init(bl[0], bd[0], tl[0], 0, td[0], 0, z);
}
{
b >>= (3); k -= (3);
}
Mode = Codes;
break;
case 2:
{ // dynamic
b >>= (3); k -= (3);
}
Mode = Table;
break;
case 3:
{ // illegal
b >>= (3); k -= (3);
}
Mode = Bad;
z.Msg = "invalid block type";
r = ZDataError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
break;
case Lens:
while (k < (32))
{
if (n != 0)
{
r = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
};
n--;
b |= (z.NextIn[p++] & 0xff) << k;
k += 8;
}
if ((((~b) >> 16) & 0xffff) != (b & 0xffff))
{
Mode = Bad;
z.Msg = "invalid stored block lengths";
r = ZDataError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
Left = (b & 0xffff);
b = k = 0; // dump bits
Mode = Left != 0 ? Stored : (_last != 0 ? Dry : Type);
break;
case Stored:
if (n == 0)
{
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
if (m == 0)
{
if (q == End && Read != 0)
{
q = 0; m = q < Read ? Read - q - 1 : End - q;
}
if (m == 0)
{
Write = q;
r = inflate_flush(z, r);
q = Write; m = q < Read ? Read - q - 1 : End - q;
if (q == End && Read != 0)
{
q = 0; m = q < Read ? Read - q - 1 : End - q;
}
if (m == 0)
{
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
}
}
r = ZOk;
t = Left;
if (t > n)
{
t = n;
}
if (t > m)
{
t = m;
}
Array.Copy(z.NextIn, p, Window, q, t);
p += t; n -= t;
q += t; m -= t;
if ((Left -= t) != 0)
{
break;
}
Mode = _last != 0 ? Dry : Type;
break;
case Table:
while (k < (14))
{
if (n != 0)
{
r = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
};
n--;
b |= (z.NextIn[p++] & 0xff) << k;
k += 8;
}
table = t = (b & 0x3fff);
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
{
Mode = Bad;
z.Msg = "too many length or distance symbols";
r = ZDataError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
if (Blens == null || Blens.Length < t)
{
Blens = new int[t];
}
else
{
for (int i = 0; i < t; i++)
{
Blens[i] = 0;
}
}
{
b >>= (14); k -= (14);
}
Index = 0;
Mode = Btree;
goto case Btree;
case Btree:
while (Index < 4 + (table >> 10))
{
while (k < (3))
{
if (n != 0)
{
r = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
n--;
b |= (z.NextIn[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, z);
if (t != ZOk)
{
r = t;
if (r == ZDataError)
{
Blens = null;
Mode = Bad;
}
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
Index = 0;
Mode = Dtree;
goto case Dtree;
case 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 = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
n--;
b |= (z.NextIn[p++] & 0xff) << k;
k += 8;
}
if (Tb[0] == -1)
{
//System.err.println("null...");
}
t = Hufts[(Tb[0] + (b & _inflateMask[t])) * 3 + 1];
c = Hufts[(Tb[0] + (b & _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 = ZOk;
}
else
{
Bitb = b; Bitk = k;
z.AvailIn = n;
z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
n--;
b |= (z.NextIn[p++] & 0xff) << k;
k += 8;
}
b >>= (t); k -= (t);
j += (b & _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 = Bad;
z.Msg = "invalid bit length repeat";
r = ZDataError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
c = c == 16 ? Blens[i - 1] : 0;
do
{
Blens[i++] = c;
}while (--j != 0);
Index = i;
}
}
Tb[0] = -1;
{
int[] bl = new int[1];
int[] bd = new int[1];
int[] tl = new int[1];
int[] td = new int[1];
bl[0] = 9; // must be <= 9 for lookahead assumptions
bd[0] = 6; // must be <= 9 for lookahead assumptions
t = table;
t = Inftree.inflate_trees_dynamic(257 + (t & 0x1f),
1 + ((t >> 5) & 0x1f),
Blens, bl, bd, tl, td, Hufts, z);
if (t != ZOk)
{
if (t == ZDataError)
{
Blens = null;
Mode = Bad;
}
r = t;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
codes.Init(bl[0], bd[0], Hufts, tl[0], Hufts, td[0], z);
}
Mode = Codes;
goto case Codes;
case Codes:
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
if ((r = codes.Proc(this, z, r)) != ZStreamEnd)
{
return(inflate_flush(z, r));
}
r = ZOk;
codes.Free(z);
p = z.NextInIndex; n = z.AvailIn; b = Bitb; k = Bitk;
q = Write; m = q < Read ? Read - q - 1 : End - q;
if (_last == 0)
{
Mode = Type;
break;
}
Mode = Dry;
goto case Dry;
case Dry:
Write = q;
r = inflate_flush(z, r);
q = Write; m = q < Read ? Read - q - 1 : End - q;
if (Read != Write)
{
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
Mode = Done;
goto case Done;
case Done:
r = ZStreamEnd;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
case Bad:
r = ZDataError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
default:
r = ZStreamError;
Bitb = b; Bitk = k;
z.AvailIn = n; z.TotalIn += p - z.NextInIndex; z.NextInIndex = p;
Write = q;
return(inflate_flush(z, r));
}
}
}
