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

/haiku-buildtools/gcc/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...]
/haiku-buildtools/binutils/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...]
/haiku-buildtools/gcc/zlib/contrib/blast/
H A Dblast.c31 #define MAXBITS 13 /* maximum code length */ macro
91 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
106 * then -9 is returned after reading MAXBITS bits.
155 left = (MAXBITS+1) - len;
190 short offs[MAXBITS+1]; /* offsets in symbol table for each length */
206 for (len = 0; len <= MAXBITS; len++)
215 for (len = 1; len <= MAXBITS; len++) {
223 for (len = 1; len < MAXBITS; len++)
286 static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */
287 static short lencnt[MAXBITS
[all...]
/haiku-buildtools/binutils/zlib/contrib/blast/
H A Dblast.c33 #define MAXBITS 13 /* maximum code length */ macro
93 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
108 * then -9 is returned after reading MAXBITS bits.
157 left = (MAXBITS+1) - len;
192 short offs[MAXBITS+1]; /* offsets in symbol table for each length */
208 for (len = 0; len <= MAXBITS; len++)
217 for (len = 1; len <= MAXBITS; len++) {
225 for (len = 1; len < MAXBITS; len++)
288 static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */
289 static short lencnt[MAXBITS
[all...]
/haiku-buildtools/gcc/zlib/contrib/puff/
H A Dpuff.c90 #define MAXBITS 15 /* maximum bits in a code */ macro
199 * Huffman code decoding tables. count[1..MAXBITS] is the number of symbols of
214 * then -10 is returned after reading MAXBITS bits.
243 for (len = 1; len <= MAXBITS; len++) {
294 left = (MAXBITS+1) - len;
326 * Assumption: for all i in 0..n-1, 0 <= length[i] <= MAXBITS
344 short offs[MAXBITS+1]; /* offsets in symbol table for each length */
347 for (len = 0; len <= MAXBITS; len++)
356 for (len = 1; len <= MAXBITS; len++) {
365 for (len = 1; len < MAXBITS; le
[all...]
/haiku-buildtools/binutils/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++) {
295 left = (MAXBITS+1) - len;
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 */
348 for (len = 0; len <= MAXBITS; len++)
357 for (len = 1; len <= MAXBITS; len++) {
366 for (len = 1; len < MAXBITS; le
[all...]
/haiku-buildtools/gcc/zlib/contrib/infback9/
H A Dinftree9.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 */
91 lens[] are in the range 0..MAXBITS. The caller must assure this.
92 1..MAXBITS is interpreted as that code length. zero means that that
108 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
109 for (len = 0; len <= MAXBITS; len++)
116 for (max = MAXBITS; max >= 1; max--)
120 for (min = 1; min <= MAXBITS; min++)
126 for (len = 1; len <= MAXBITS; le
[all...]
/haiku-buildtools/binutils/zlib/contrib/infback9/
H A Dinftree9.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 */
91 lens[] are in the range 0..MAXBITS. The caller must assure this.
92 1..MAXBITS is interpreted as that code length. zero means that that
108 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
109 for (len = 0; len <= MAXBITS; len++)
116 for (max = MAXBITS; max >= 1; max--)
120 for (min = 1; min <= MAXBITS; min++)
126 for (len = 1; len <= MAXBITS; le
[all...]

Completed in 117 milliseconds