Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/lib/
H A Dinflate.c314 /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */
315 #define BMAX 16 /* maximum bit length of any code (16 for explode) */ macro
323 unsigned *b, /* code lengths in bits (all assumed <= BMAX) */ in huft_build()
353 unsigned c[BMAX+1]; /* bit length count table */ in huft_build()
354 struct huft *u[BMAX]; /* table stack */ in huft_build()
356 unsigned x[BMAX+1]; /* bit offsets, then code stack */ in huft_build()
379 c[*p]++; /* assume all entries <= BMAX */ in huft_build()
394 for (j = 1; j <= BMAX; j++) in huft_build()
400 for (i = BMAX; i; i--) in huft_build()
/kernel/linux/linux-6.6/lib/
H A Dinflate.c314 /* If BMAX needs to be larger than 16, then h and x[] should be ulg. */
315 #define BMAX 16 /* maximum bit length of any code (16 for explode) */ macro
323 unsigned *b, /* code lengths in bits (all assumed <= BMAX) */ in huft_build()
353 unsigned c[BMAX+1]; /* bit length count table */ in huft_build()
354 struct huft *u[BMAX]; /* table stack */ in huft_build()
356 unsigned x[BMAX+1]; /* bit offsets, then code stack */ in huft_build()
379 c[*p]++; /* assume all entries <= BMAX */ in huft_build()
394 for (j = 1; j <= BMAX; j++) in huft_build()
400 for (i = BMAX; i; i--) in huft_build()

Completed in 4 milliseconds