Home
last modified time | relevance | path

Searched refs:MAXBITS (Results 1 - 8 of 8) sorted by relevance

/third_party/zlib/contrib/infback9/
H A Dinftree9.c9 #define MAXBITS 15 macro
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table9()
54 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ in inflate_table9()
86 lens[] are in the range 0..MAXBITS. The caller must assure this. in inflate_table9()
87 1..MAXBITS is interpreted as that code length. zero means that that in inflate_table9()
103 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ in inflate_table9()
104 for (len = 0; len <= MAXBITS; len++) in inflate_table9()
111 for (max = MAXBITS; max >= 1; max--) in inflate_table9()
115 for (min = 1; min <= MAXBITS; min++) in inflate_table9()
121 for (len = 1; len <= MAXBITS; le in inflate_table9()
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
90 1..MAXBITS is interpreted as that code length. zero means that that
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
107 for (len = 0; len <= MAXBITS; len++)
114 for (max = MAXBITS; max >= 1; max--)
132 for (len = 1; len <= MAXBITS; len++) {
142 for (len = 1; len < MAXBITS; le
[all...]
/third_party/node/deps/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
54 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ in inflate_table()
84 lens[] are in the range 0..MAXBITS. The caller must assure this. in inflate_table()
85 1..MAXBITS is interpreted as that code length. zero means that that in inflate_table()
101 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ in inflate_table()
102 for (len = 0; len <= MAXBITS; len++) in inflate_table()
109 for (max = MAXBITS; max >= 1; max--) in inflate_table()
127 for (len = 1; len <= MAXBITS; len++) { in inflate_table()
137 for (len = 1; len < MAXBITS; le in inflate_table()
[all...]
/third_party/skia/third_party/externals/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
90 1..MAXBITS is interpreted as that code length. zero means that that
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
107 for (len = 0; len <= MAXBITS; len++)
114 for (max = MAXBITS; max >= 1; max--)
132 for (len = 1; len <= MAXBITS; len++) {
142 for (len = 1; len < MAXBITS; le
[all...]
/third_party/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
54 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ in inflate_table()
84 lens[] are in the range 0..MAXBITS. The caller must assure this. in inflate_table()
85 1..MAXBITS is interpreted as that code length. zero means that that in inflate_table()
101 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ in inflate_table()
102 for (len = 0; len <= MAXBITS; len++) in inflate_table()
109 for (max = MAXBITS; max >= 1; max--) in inflate_table()
127 for (len = 1; len <= MAXBITS; len++) { in inflate_table()
137 for (len = 1; len < MAXBITS; le in inflate_table()
[all...]
/third_party/zlib/contrib/blast/
H A Dblast.c37 #define MAXBITS 13 /* maximum code length */ macro
97 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
112 * then -9 is returned after reading MAXBITS bits.
161 left = (MAXBITS+1) - len; in decode()
196 short offs[MAXBITS+1]; /* offsets in symbol table for each length */ in construct()
212 for (len = 0; len <= MAXBITS; len++) in construct()
221 for (len = 1; len <= MAXBITS; len++) { in construct()
229 for (len = 1; len < MAXBITS; len++) in construct()
292 static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */ in decomp()
293 static short lencnt[MAXBITS in decomp()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
90 1..MAXBITS is interpreted as that code length. zero means that that
106 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
107 for (len = 0; len <= MAXBITS; len++)
114 for (max = MAXBITS; max >= 1; max--)
132 for (len = 1; len <= MAXBITS; len++) {
142 for (len = 1; len < MAXBITS; le
[all...]
/third_party/zlib/contrib/puff/
H A Dpuff.c91 #define MAXBITS 15 /* maximum bits in a code */ macro
200 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
215 * then -10 is returned after reading MAXBITS bits.
244 for (len = 1; len <= MAXBITS; len++) { in decode()
295 left = (MAXBITS+1) - len; in decode()
327 * Assumption: for all i in 0..n-1, 0 <= length[i] <= MAXBITS
345 short offs[MAXBITS+1]; /* offsets in symbol table for each length */ in construct()
348 for (len = 0; len <= MAXBITS; len++) in construct()
357 for (len = 1; len <= MAXBITS; len++) { in construct()
366 for (len = 1; len < MAXBITS; le in construct()
[all...]

Completed in 5 milliseconds