HomeSort by relevance Sort by last modified time
    Searched refs:MAXBITS (Results 1 - 6 of 6) sorted by null

  /external/qemu/distrib/zlib-1.2.3/
inftrees.c 9 #define MAXBITS 15
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--)
126 for (min = 1; min <= MAXBITS; min++)
132 for (len = 1; len <= MAXBITS; len++)
    [all...]
  /external/zlib/src/contrib/infback9/
inftree9.c 9 #define MAXBITS 15
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; len++)
    [all...]
  /external/zlib/src/
inftrees.c 9 #define MAXBITS 15
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; len++
    [all...]
  /external/zlib/src/contrib/blast/
blast.c 33 #define MAXBITS 13 /* maximum code length */
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+1], lensym[16]; /* lencode memory *
    [all...]
  /external/zlib/src/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...]
  /external/chromium_org/third_party/zlib/
inftrees.c 9 #define MAXBITS 15
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; len++
    [all...]

Completed in 264 milliseconds