Home
last modified time | relevance | path

Searched refs:bl_count (Results 1 - 12 of 12) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
241 ush bl_count[MAX_BITS+1]; in tr_static_init() local
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
291 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
292 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init() local
293 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init() local
294 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
482 * array bl_count contains the frequencies for each bit length.
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bit
[all...]
H A Ddeflate.h206 ush bl_count[MAX_BITS+1]; member
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c147 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
248 ush bl_count[MAX_BITS+1]; in tr_static_init() local
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
298 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
299 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init() local
300 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init() local
301 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
490 * array bl_count contains the frequencies for each bit length.
511 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bit
[all...]
H A Ddeflate.h200 ush bl_count[MAX_BITS+1]; member
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
241 ush bl_count[MAX_BITS+1]; in tr_static_init() local
289 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
291 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
292 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init() local
293 while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++; in tr_static_init() local
294 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
482 * array bl_count contains the frequencies for each bit length.
503 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bit
[all...]
H A Ddeflate.h206 ush bl_count[MAX_BITS+1]; member
/third_party/node/deps/zlib/
H A Dtrees.c197 * IN assertion: the array bl_count contains the bit length statistics for
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) { in gen_codes() argument
212 code = (code + bl_count[bits - 1]) << 1; in gen_codes()
215 /* Check that the bit counts in bl_count are consistent. The last code in gen_codes()
218 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1, in gen_codes()
302 ush bl_count[MAX_BITS+1]; in tr_static_init() local
350 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
352 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
353 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init() local
354 while (n <= 279) static_ltree[n++].Len = 7, bl_count[ in tr_static_init() local
355 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; tr_static_init() local
[all...]
H A Ddeflate.h210 ush bl_count[MAX_BITS+1]; member
/third_party/zlib/
H A Dtrees.c209 * IN assertion: the array bl_count contains the bit length statistics for
214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) in gen_codes() argument
225 code = (code + bl_count[bits - 1]) << 1; in gen_codes()
228 /* Check that the bit counts in bl_count are consistent. The last code in gen_codes()
231 Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1, in gen_codes()
317 ush bl_count[MAX_BITS+1]; in tr_static_init() local
365 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
367 while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++; in tr_static_init() local
368 while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++; in tr_static_init() local
369 while (n <= 279) static_ltree[n++].Len = 7, bl_count[ in tr_static_init() local
370 while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++; tr_static_init() local
[all...]
H A Ddeflate.h210 ush bl_count[MAX_BITS+1]; member
/third_party/node/deps/brotli/c/enc/
H A Dentropy_encode.c481 uint16_t bl_count[MAX_HUFFMAN_BITS] = { 0 }; in BrotliConvertBitDepthsToSymbols() local
486 ++bl_count[depth[i]]; in BrotliConvertBitDepthsToSymbols()
488 bl_count[0] = 0; in BrotliConvertBitDepthsToSymbols()
491 code = (code + bl_count[i - 1]) << 1; in BrotliConvertBitDepthsToSymbols()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dentropy_encode.c481 uint16_t bl_count[MAX_HUFFMAN_BITS] = { 0 }; in BrotliConvertBitDepthsToSymbols() local
486 ++bl_count[depth[i]]; in BrotliConvertBitDepthsToSymbols()
488 bl_count[0] = 0; in BrotliConvertBitDepthsToSymbols()
491 code = (code + bl_count[i - 1]) << 1; in BrotliConvertBitDepthsToSymbols()

Completed in 12 milliseconds