internal int Process(ZlibCodec 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.NextIn;
n = z.AvailableBytesIn;
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 = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [p++] & 0xff) << k;
k += 8;
}
t = (int)(b & 7);
last = t & 1;
switch (SharedUtils.URShift (t, 1)) {
case 0: // stored
{
b = SharedUtils.URShift (b, (3));
k -= (3);
}
t = k & 7; // go to byte boundary
{
b = SharedUtils.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.Init (bl [0], bd [0], tl [0], 0, td [0], 0, z);
}
{
b = SharedUtils.URShift (b, (3));
k -= (3);
}
mode = CODES;
break;
case 2: // dynamic
{
b = SharedUtils.URShift (b, (3));
k -= (3);
}
mode = TABLE;
break;
case 3: // illegal
{
b = SharedUtils.URShift (b, (3));
k -= (3);
}
mode = BAD;
z.Message = "invalid block type";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
break;
case LENS:
while (k < (32)) {
if (n != 0) {
r = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [p++] & 0xff) << k;
k += 8;
}
if (((SharedUtils.URShift ((~b), 16)) & 0xffff) != (b & 0xffff)) {
mode = BAD;
z.Message = "invalid stored block lengths";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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 = 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.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
}
}
r = ZlibConstants.Z_OK;
t = left;
if (t > n)
t = n;
if (t > m)
t = m;
Array.Copy (z.InputBuffer, 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 = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [p++] & 0xff) << k;
k += 8;
}
table = t = (b & 0x3fff);
if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29) {
mode = BAD;
z.Message = "too many length or distance symbols";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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 = SharedUtils.URShift (b, (14));
k -= (14);
}
index = 0;
mode = BTREE;
goto case BTREE;
case BTREE:
while (index < 4 + (SharedUtils.URShift(table, 10))) {
while (k < (3)) {
if (n != 0) {
r = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [p++] & 0xff) << k;
k += 8;
}
blens [border [index++]] = b & 7;
{
b = SharedUtils.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 != ZlibConstants.Z_OK) {
r = t;
if (r == ZlibConstants.Z_DATA_ERROR) {
blens = null;
mode = BAD;
}
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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 = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [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 = SharedUtils.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 = ZlibConstants.Z_OK;
} else {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
;
n--;
b |= (z.InputBuffer [p++] & 0xff) << k;
k += 8;
}
b = SharedUtils.URShift (b, (t));
k -= (t);
j += (b & inflate_mask [i]);
b = SharedUtils.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.Message = "invalid bit length repeat";
r = ZlibConstants.Z_DATA_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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[] { 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, z);
if (t != ZlibConstants.Z_OK) {
if (t == ZlibConstants.Z_DATA_ERROR) {
blens = null;
mode = BAD;
}
r = t;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return 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.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
if ((r = codes.Process (this, z, r)) != ZlibConstants.Z_STREAM_END) {
return Flush (z, r);
}
r = ZlibConstants.Z_OK;
p = z.NextIn;
n = z.AvailableBytesIn;
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 = Flush (z, r);
q = write;
m = (int)(q < read ? read - q - 1 : end - q);
if (read != write) {
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
mode = DONE;
goto case DONE;
case DONE:
r = ZlibConstants.Z_STREAM_END;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
case BAD:
r = ZlibConstants.Z_DATA_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
default:
r = ZlibConstants.Z_STREAM_ERROR;
bitb = b;
bitk = k;
z.AvailableBytesIn = n;
z.TotalBytesIn += p - z.NextIn;
z.NextIn = p;
write = q;
return Flush (z, r);
}
}
}
