Searched refs:BMAX (Results 1 - 13 of 13) sorted by relevance

/asus-wl-520gu-7.0.1.45/src/cfe/cfe/zlib/
H A Dinftrees.c90 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
91 #define BMAX 15 /* maximum bit length of any code */ macro
94 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
112 uInt c[BMAX+1]; /* bit length count table */
124 inflate_huft *u[BMAX]; /* table stack */
126 uInt x[BMAX+1]; /* bit offsets, then code stack */
137 C4 /* clear c[]--assume BMAX+1 is 16 */
140 c[*p++]++; /* assume all entries <= BMAX */
152 for (j = 1; j <= BMAX; j++)
158 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/lib/zlib_inflate/
H A Dinftrees.c87 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
88 #define BMAX 15 /* maximum bit length of any code */ macro
91 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
109 uInt c[BMAX+1]; /* bit length count table */
121 inflate_huft *u[BMAX]; /* table stack */
123 uInt x[BMAX+1]; /* bit offsets, then code stack */
134 C4 /* clear c[]--assume BMAX+1 is 16 */
137 c[*p++]++; /* assume all entries <= BMAX */
149 for (j = 1; j <= BMAX; j++)
155 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/busybox/libbb/
H A Dunzip.c68 /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */
69 static const int BMAX = 16; /* maximum bit length of any code (16 for explode) */ variable
182 * b: code lengths in bits (all assumed <= BMAX)
194 unsigned c[BMAX + 1]; /* bit length count table */
205 huft_t *u[BMAX]; /* table stack */
208 unsigned x[BMAX + 1]; /* bit offsets, then code stack */
218 c[*p]++; /* assume all entries <= BMAX */
229 for (j = 1; j <= BMAX; j++)
235 for (i = BMAX; i; i--)
/asus-wl-520gu-7.0.1.45/src/linux/linux/lib/
H A Dinflate.c270 /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */
271 #define BMAX 16 /* maximum bit length of any code (16 for explode) */ macro
279 unsigned *b; /* code lengths in bits (all assumed <= BMAX) */
293 unsigned c[BMAX+1]; /* bit length count table */
304 struct huft *u[BMAX]; /* table stack */
307 unsigned x[BMAX+1]; /* bit offsets, then code stack */
320 c[*p]++; /* assume all entries <= BMAX */
334 for (j = 1; j <= BMAX; j++)
340 for (i = BMAX; i; i--)
/asus-wl-520gu-7.0.1.45/src/shared/
H A Dgzip_inflate.c272 /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */
273 #define BMAX 16 /* maximum bit length of any code (16 for explode) */ macro
281 unsigned *b; /* code lengths in bits (all assumed <= BMAX) */
295 unsigned c[BMAX+1]; /* bit length count table */
306 struct huft *u[BMAX]; /* table stack */
309 unsigned x[BMAX+1]; /* bit offsets, then code stack */
322 c[*p]++; /* assume all entries <= BMAX */
336 for (j = 1; j <= BMAX; j++)
342 for (i = BMAX; i; i--)
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/ppc/boot/lib/
H A Dzlib.c1225 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
1226 #define BMAX 15 /* maximum bit length of any code */ macro
1234 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
1250 uInt c[BMAX+1]; /* bit length count table */
1261 inflate_huft *u[BMAX]; /* table stack */
1264 uInt x[BMAX+1]; /* bit offsets, then code stack */
1275 C4 /* clear c[]--assume BMAX+1 is 16 */
1278 c[*p++]++; /* assume all entries <= BMAX */
1290 for (j = 1; j <= BMAX; j++)
1296 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/ppc64/boot/
H A Dzlib.c1238 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
1239 #define BMAX 15 /* maximum bit length of any code */ macro
1247 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
1263 uInt c[BMAX+1]; /* bit length count table */
1274 inflate_huft *u[BMAX]; /* table stack */
1277 uInt x[BMAX+1]; /* bit offsets, then code stack */
1288 C4 /* clear c[]--assume BMAX+1 is 16 */
1291 c[*p++]++; /* assume all entries <= BMAX */
1303 for (j = 1; j <= BMAX; j++)
1309 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/ppp/pppdump/
H A Dzlib.c3683 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
3684 #define BMAX 15 /* maximum bit length of any code */ macro
3692 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
3708 uInt c[BMAX+1]; /* bit length count table */
3719 inflate_huft *u[BMAX]; /* table stack */
3722 uInt x[BMAX+1]; /* bit offsets, then code stack */
3733 C4 /* clear c[]--assume BMAX+1 is 16 */
3736 c[*p++]++; /* assume all entries <= BMAX */
3748 for (j = 1; j <= BMAX; j++)
3754 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/pppd/pppdump/
H A Dzlib.c3683 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
3684 #define BMAX 15 /* maximum bit length of any code */ macro
3692 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
3708 uInt c[BMAX+1]; /* bit length count table */
3719 inflate_huft *u[BMAX]; /* table stack */
3722 uInt x[BMAX+1]; /* bit offsets, then code stack */
3733 C4 /* clear c[]--assume BMAX+1 is 16 */
3736 c[*p++]++; /* assume all entries <= BMAX */
3748 for (j = 1; j <= BMAX; j++)
3754 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/pppd.mppe/pppdump/
H A Dzlib.c3683 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
3684 #define BMAX 15 /* maximum bit length of any code */ macro
3692 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
3708 uInt c[BMAX+1]; /* bit length count table */
3719 inflate_huft *u[BMAX]; /* table stack */
3722 uInt x[BMAX+1]; /* bit offsets, then code stack */
3733 C4 /* clear c[]--assume BMAX+1 is 16 */
3736 c[*p++]++; /* assume all entries <= BMAX */
3748 for (j = 1; j <= BMAX; j++)
3754 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/ppp/common/
H A Dzlib.c4180 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
4181 #define BMAX 15 /* maximum bit length of any code */ macro
4189 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
4205 uInt c[BMAX+1]; /* bit length count table */
4216 inflate_huft *u[BMAX]; /* table stack */
4219 uInt x[BMAX+1]; /* bit offsets, then code stack */
4230 C4 /* clear c[]--assume BMAX+1 is 16 */
4233 c[*p++]++; /* assume all entries <= BMAX */
4245 for (j = 1; j <= BMAX; j++)
4251 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/pppd/common/
H A Dzlib.c4183 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
4184 #define BMAX 15 /* maximum bit length of any code */ macro
4192 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
4208 uInt c[BMAX+1]; /* bit length count table */
4219 inflate_huft *u[BMAX]; /* table stack */
4222 uInt x[BMAX+1]; /* bit offsets, then code stack */
4233 C4 /* clear c[]--assume BMAX+1 is 16 */
4236 c[*p++]++; /* assume all entries <= BMAX */
4248 for (j = 1; j <= BMAX; j++)
4254 for (i = BMAX;
[all...]
/asus-wl-520gu-7.0.1.45/src/router/pppd.mppe/common/
H A Dzlib.c4183 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
4184 #define BMAX 15 /* maximum bit length of any code */ macro
4192 uIntf *b; /* code lengths in bits (all assumed <= BMAX) */
4208 uInt c[BMAX+1]; /* bit length count table */
4219 inflate_huft *u[BMAX]; /* table stack */
4222 uInt x[BMAX+1]; /* bit offsets, then code stack */
4233 C4 /* clear c[]--assume BMAX+1 is 16 */
4236 c[*p++]++; /* assume all entries <= BMAX */
4248 for (j = 1; j <= BMAX; j++)
4254 for (i = BMAX;
[all...]

Completed in 316 milliseconds