HomeSort by: relevance | last modified time | path
    Searched defs:MAXBITS (Results 1 - 4 of 4) sorted by relevancy

  /src/common/dist/zlib/contrib/infback9/
inftree9.c 9 #define MAXBITS 15
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */
54 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
86 lens[] are in the range 0..MAXBITS. The caller must assure this.
87 1..MAXBITS is interpreted as that code length. zero means that that
103 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
104 for (len = 0; len <= MAXBITS; len++)
111 for (max = MAXBITS; max >= 1; max--)
115 for (min = 1; min <= MAXBITS; min++)
121 for (len = 1; len <= MAXBITS; len++)
    [all...]
  /src/common/dist/zlib/
inftrees.c 11 #define MAXBITS 15
55 unsigned short count[MAXBITS+1]; /* number of codes of each length */
56 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
86 lens[] are in the range 0..MAXBITS. The caller must assure this.
87 1..MAXBITS is interpreted as that code length. zero means that that
103 /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
104 for (len = 0; len <= MAXBITS; len++)
111 for (mmax = MAXBITS; mmax >= 1; mmax--)
123 for (mmin = 1; mmin <= MAXBITS; mmin++)
129 for (len = 1; len <= MAXBITS; len++)
    [all...]
  /src/common/dist/zlib/contrib/blast/
blast.c 37 #define MAXBITS 13 /* maximum code length */
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;
196 short offs[MAXBITS+1]; /* offsets in symbol table for each length */
212 for (len = 0; len <= MAXBITS; len++)
221 for (len = 1; len <= MAXBITS; len++) {
229 for (len = 1; len < MAXBITS; len++)
292 static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */
293 static short lencnt[MAXBITS+1], lensym[16]; /* lencode memory *
    [all...]
  /src/common/dist/zlib/contrib/puff/
puff.c 91 #define MAXBITS 15 /* maximum bits in a code */
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; len++
    [all...]

Completed in 63 milliseconds