12 " inflate 1.2.11 Copyright 1995-2017 Mark Adler ";
34 unsigned short FAR *
lens;
36 code FAR * FAR *table;
38 unsigned short FAR *
work;
55 const unsigned short FAR *
base;
56 const unsigned short FAR *
extra;
58 unsigned short count[
MAXBITS+1];
60 static const unsigned short lbase[31] = {
61 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
62 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
63 static const unsigned short lext[31] = {
64 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
65 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 77, 202};
66 static const unsigned short dbase[32] = {
67 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
68 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
69 8193, 12289, 16385, 24577, 0, 0};
70 static const unsigned short dext[32] = {
71 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
72 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
73 28, 28, 29, 29, 64, 64};
107 for (len = 0; len <=
MAXBITS; len++)
109 for (sym = 0; sym <
codes; sym++)
114 for (max =
MAXBITS; max >= 1; max--)
115 if (count[max] != 0)
break;
116 if (root > max) root =
max;
118 here.
op = (
unsigned char)64;
119 here.
bits = (
unsigned char)1;
120 here.
val = (
unsigned short)0;
126 for (min = 1; min <
max; min++)
127 if (count[min] != 0)
break;
128 if (root < min) root =
min;
132 for (len = 1; len <=
MAXBITS; len++) {
135 if (left < 0)
return -1;
137 if (left > 0 && (type ==
CODES || max != 1))
142 for (len = 1; len <
MAXBITS; len++)
143 offs[len + 1] = offs[len] + count[len];
146 for (sym = 0; sym <
codes; sym++)
147 if (lens[sym] != 0) work[offs[lens[sym]]++] = (
unsigned short)sym;
204 low = (unsigned)(-1);
216 here.
bits = (
unsigned char)(len - drop);
217 if (work[sym] + 1U < match) {
218 here.
op = (
unsigned char)0;
219 here.
val = work[sym];
221 else if (work[sym] >= match) {
222 here.
op = (
unsigned char)(extra[work[sym] - match]);
223 here.
val = base[work[sym] - match];
226 here.
op = (
unsigned char)(32 + 64);
231 incr = 1U << (len - drop);
236 next[(huff >> drop) + fill] = here;
240 incr = 1U << (len - 1);
252 if (--(count[len]) == 0) {
253 if (len == max)
break;
254 len = lens[work[sym]];
258 if (len > root && (huff & mask) != low) {
268 left = (
int)(1 << curr);
269 while (curr + drop < max) {
270 left -= count[curr + drop];
271 if (left <= 0)
break;
284 (*table)[low].op = (
unsigned char)curr;
285 (*table)[low].bits = (
unsigned char)root;
286 (*table)[low].val = (
unsigned short)(next - *table);
294 here.
op = (
unsigned char)64;
295 here.
bits = (
unsigned char)(len - drop);
296 here.
val = (
unsigned short)0;