Home
last modified time | relevance | path

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

/external/zlib/src/contrib/infback9/
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 */
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++) {
136 for (len = 1; len < MAXBITS; len++)
/external/zlib/src/
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 */
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++)
/external/pdfium/third_party/zlib_v128/
Dinftrees.c9 #define MAXBITS 15 macro
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ in inflate_table()
107 for (len = 0; len <= MAXBITS; len++) in inflate_table()
114 for (max = MAXBITS; max >= 1; max--) in inflate_table()
132 for (len = 1; len <= MAXBITS; len++) { in inflate_table()
142 for (len = 1; len < MAXBITS; len++) in inflate_table()
/external/python/cpython2/Modules/zlib/
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 */
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++)
/external/zlib/src/contrib/puff/
Dpuff.c91 #define MAXBITS 15 /* maximum bits in a code */ macro
244 for (len = 1; len <= MAXBITS; len++) { in decode()
295 left = (MAXBITS+1) - len; in decode()
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; len++) in construct()
539 static short lencnt[MAXBITS+1], lensym[FIXLCODES]; in fixed()
540 static short distcnt[MAXBITS+1], distsym[MAXDCODES]; in fixed()
671 short lencnt[MAXBITS+1], lensym[MAXLCODES]; /* lencode memory */ in dynamic()
[all …]
/external/syslinux/com32/lib/zlib/
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 */
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++)
/external/zlib/src/contrib/blast/
Dblast.c33 #define MAXBITS 13 /* maximum code length */ macro
157 left = (MAXBITS+1) - len; in decode()
192 short offs[MAXBITS+1]; /* offsets in symbol table for each length */ in construct()
208 for (len = 0; len <= MAXBITS; len++) in construct()
217 for (len = 1; len <= MAXBITS; len++) { in construct()
225 for (len = 1; len < MAXBITS; len++) in construct()
288 static short litcnt[MAXBITS+1], litsym[256]; /* litcode memory */ in decomp()
289 static short lencnt[MAXBITS+1], lensym[16]; /* lencode memory */ in decomp()
290 static short distcnt[MAXBITS+1], distsym[64]; /* distcode memory */ in decomp()
/external/skia/third_party/lua/src/
Dltable.c43 #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 */ in numusearray()
288 if (lsize > MAXBITS) in setnodevector()
345 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ in rehash()
348 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ in rehash()
/external/syslinux/com32/lua/src/
Dltable.c43 #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 */ in numusearray()
289 if (lsize > MAXBITS) in setnodevector()
346 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ in rehash()
349 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ in rehash()