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

/external/pdfium/third_party/zlib_v128/
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...]
/external/python/cpython2/Modules/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...]
/external/zlib/src/
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...]
/external/zlib/src/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...]
/external/zlib/src/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...]
/external/zlib/src/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...]
/external/syslinux/com32/lib/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...]
/external/skia/third_party/lua/src/
H A Dltable.c40 ** max size of array part is 2^MAXBITS
43 #define MAXBITS 30 macro
45 #define MAXBITS (LUAI_BITSINT-2) macro
48 #define MAXASIZE (1 << MAXBITS)
234 for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */
288 if (lsize > MAXBITS)
345 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */
348 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */
/external/syslinux/com32/lua/src/
H A Dltable.c40 ** max size of array part is 2^MAXBITS
43 #define MAXBITS 30 macro
45 #define MAXBITS (LUAI_BITSINT-2) macro
48 #define MAXASIZE (1 << MAXBITS)
235 for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */
289 if (lsize > MAXBITS)
346 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */
349 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */

Completed in 215 milliseconds